./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 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_from_empty_array_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 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 12:38:26,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 12:38:26,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 12:38:26,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 12:38:26,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 12:38:26,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 12:38:26,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 12:38:26,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 12:38:26,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 12:38:26,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 12:38:26,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 12:38:26,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 12:38:26,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 12:38:26,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 12:38:26,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 12:38:26,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 12:38:26,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 12:38:26,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 12:38:26,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 12:38:26,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 12:38:26,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 12:38:26,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 12:38:26,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 12:38:26,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 12:38:26,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 12:38:26,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 12:38:26,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 12:38:26,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 12:38:26,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 12:38:26,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 12:38:26,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 12:38:26,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 12:38:26,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 12:38:26,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 12:38:26,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 12:38:26,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 12:38:26,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 12:38:26,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 12:38:26,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 12:38:26,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 12:38:26,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 12:38:26,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 12:38:26,893 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 12:38:26,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 12:38:26,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 12:38:26,896 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 12:38:26,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 12:38:26,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 12:38:26,897 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 12:38:26,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 12:38:26,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 12:38:26,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 12:38:26,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 12:38:26,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 12:38:26,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 12:38:26,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 12:38:26,899 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 12:38:26,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 12:38:26,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 12:38:26,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 12:38:26,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 12:38:26,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:38:26,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 12:38:26,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 12:38:26,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 12:38:26,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 12:38:26,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 12:38:26,901 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 12:38:26,901 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 12:38:26,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 12:38:26,902 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 12:38:26,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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2021-11-02 12:38:27,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 12:38:27,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 12:38:27,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 12:38:27,089 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 12:38:27,090 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 12:38:27,091 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_from_empty_array_harness.i [2021-11-02 12:38:27,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb5046265/b5f53c2b3fbd4613905884a582271586/FLAG78c3c0aac [2021-11-02 12:38:27,701 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 12:38:27,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2021-11-02 12:38:27,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb5046265/b5f53c2b3fbd4613905884a582271586/FLAG78c3c0aac [2021-11-02 12:38:28,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb5046265/b5f53c2b3fbd4613905884a582271586 [2021-11-02 12:38:28,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 12:38:28,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 12:38:28,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 12:38:28,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 12:38:28,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 12:38:28,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:38:28" (1/1) ... [2021-11-02 12:38:28,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3c50af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:28, skipping insertion in model container [2021-11-02 12:38:28,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:38:28" (1/1) ... [2021-11-02 12:38:28,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 12:38:28,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 12:38:28,429 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-11-02 12:38:28,435 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-11-02 12:38:28,449 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:38:28,453 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:38:28,900 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:28,901 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:28,901 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:28,902 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:28,903 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:28,910 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:28,911 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:28,911 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:28,912 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,099 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:38:29,100 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:38:29,100 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:38:29,101 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:38:29,102 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:38:29,102 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:38:29,103 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:38:29,103 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:38:29,104 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:38:29,104 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:38:29,223 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:38:29,306 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,307 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:38:29,368 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 12:38:29,377 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-11-02 12:38:29,378 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-11-02 12:38:29,379 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:38:29,379 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:38:29,397 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,397 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,398 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,398 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,398 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,401 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,402 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,402 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,403 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,485 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:38:29,486 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:38:29,486 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:38:29,487 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:38:29,487 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:38:29,488 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:38:29,488 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:38:29,488 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:38:29,488 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:38:29,489 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:38:29,518 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:38:29,563 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,564 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:38:29,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:38:29,760 INFO L208 MainTranslator]: Completed translation [2021-11-02 12:38:29,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29 WrapperNode [2021-11-02 12:38:29,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 12:38:29,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 12:38:29,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 12:38:29,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 12:38:29,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (1/1) ... [2021-11-02 12:38:29,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (1/1) ... [2021-11-02 12:38:29,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 12:38:29,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 12:38:29,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 12:38:29,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 12:38:29,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (1/1) ... [2021-11-02 12:38:29,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (1/1) ... [2021-11-02 12:38:29,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (1/1) ... [2021-11-02 12:38:29,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (1/1) ... [2021-11-02 12:38:30,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (1/1) ... [2021-11-02 12:38:30,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (1/1) ... [2021-11-02 12:38:30,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (1/1) ... [2021-11-02 12:38:30,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 12:38:30,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 12:38:30,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 12:38:30,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 12:38:30,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (1/1) ... [2021-11-02 12:38:30,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:38:30,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:38:30,065 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-02 12:38:30,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 12:38:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 12:38:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 12:38:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 12:38:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 12:38:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 12:38:30,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 12:38:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 12:38:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 12:38:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 12:38:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 12:38:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 12:38:34,392 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 12:38:34,393 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2021-11-02 12:38:34,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:38:34 BoogieIcfgContainer [2021-11-02 12:38:34,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 12:38:34,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 12:38:34,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 12:38:34,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 12:38:34,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:38:28" (1/3) ... [2021-11-02 12:38:34,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729830dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:38:34, skipping insertion in model container [2021-11-02 12:38:34,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:38:29" (2/3) ... [2021-11-02 12:38:34,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729830dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:38:34, skipping insertion in model container [2021-11-02 12:38:34,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:38:34" (3/3) ... [2021-11-02 12:38:34,409 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2021-11-02 12:38:34,416 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 12:38:34,417 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-02 12:38:34,458 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 12:38:34,462 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-02 12:38:34,462 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-02 12:38:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 77 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-02 12:38:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-02 12:38:34,479 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:38:34,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:38:34,480 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:38:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:38:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash 810375617, now seen corresponding path program 1 times [2021-11-02 12:38:34,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:38:34,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137413567] [2021-11-02 12:38:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:38:34,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:38:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:38:34,985 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-02 12:38:34,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:38:34,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137413567] [2021-11-02 12:38:34,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137413567] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:38:34,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:38:34,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 12:38:34,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646785936] [2021-11-02 12:38:34,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 12:38:34,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:38:35,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 12:38:35,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:38:35,010 INFO L87 Difference]: Start difference. First operand has 78 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 77 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:37,086 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:38:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:38:37,684 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2021-11-02 12:38:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 12:38:37,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-02 12:38:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:38:37,692 INFO L225 Difference]: With dead ends: 153 [2021-11-02 12:38:37,692 INFO L226 Difference]: Without dead ends: 71 [2021-11-02 12:38:37,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.02ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:38:37,696 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2401.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.73ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2636.60ms IncrementalHoareTripleChecker+Time [2021-11-02 12:38:37,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 1.73ms Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2636.60ms Time] [2021-11-02 12:38:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-02 12:38:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-02 12:38:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.328125) internal successors, (85), 70 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-02 12:38:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2021-11-02 12:38:37,719 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 14 [2021-11-02 12:38:37,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:38:37,720 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2021-11-02 12:38:37,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2021-11-02 12:38:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-02 12:38:37,721 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:38:37,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:38:37,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 12:38:37,721 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:38:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:38:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1068541055, now seen corresponding path program 1 times [2021-11-02 12:38:37,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:38:37,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137916401] [2021-11-02 12:38:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:38:37,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:38:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:38:37,933 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-02 12:38:37,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:38:37,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137916401] [2021-11-02 12:38:37,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137916401] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:38:37,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:38:37,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:38:37,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165368870] [2021-11-02 12:38:37,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:38:37,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:38:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:38:37,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:38:37,935 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:40,235 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:38:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:38:41,158 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2021-11-02 12:38:41,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:38:41,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-02 12:38:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:38:41,159 INFO L225 Difference]: With dead ends: 120 [2021-11-02 12:38:41,159 INFO L226 Difference]: Without dead ends: 71 [2021-11-02 12:38:41,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:38:41,161 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2899.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.45ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3161.60ms IncrementalHoareTripleChecker+Time [2021-11-02 12:38:41,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 186 Unknown, 0 Unchecked, 5.45ms Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 1 Unknown, 0 Unchecked, 3161.60ms Time] [2021-11-02 12:38:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-02 12:38:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-02 12:38:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.3125) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2021-11-02 12:38:41,166 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 14 [2021-11-02 12:38:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:38:41,167 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2021-11-02 12:38:41,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2021-11-02 12:38:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 12:38:41,168 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:38:41,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:38:41,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 12:38:41,168 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:38:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:38:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash -715146382, now seen corresponding path program 1 times [2021-11-02 12:38:41,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:38:41,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935430147] [2021-11-02 12:38:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:38:41,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:38:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:38:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:38:41,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:38:41,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935430147] [2021-11-02 12:38:41,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935430147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:38:41,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:38:41,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:38:41,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072426719] [2021-11-02 12:38:41,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:38:41,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:38:41,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:38:41,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:38:41,422 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:43,477 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:38:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:38:44,755 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2021-11-02 12:38:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:38:44,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-02 12:38:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:38:44,757 INFO L225 Difference]: With dead ends: 173 [2021-11-02 12:38:44,757 INFO L226 Difference]: Without dead ends: 115 [2021-11-02 12:38:44,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.17ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:38:44,758 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2962.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.40ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3266.69ms IncrementalHoareTripleChecker+Time [2021-11-02 12:38:44,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 7.40ms Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 1 Unknown, 0 Unchecked, 3266.69ms Time] [2021-11-02 12:38:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-02 12:38:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 75. [2021-11-02 12:38:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 74 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-02 12:38:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2021-11-02 12:38:44,777 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 20 [2021-11-02 12:38:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:38:44,778 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2021-11-02 12:38:44,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2021-11-02 12:38:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 12:38:44,779 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:38:44,779 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] [2021-11-02 12:38:44,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 12:38:44,779 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:38:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:38:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1524493008, now seen corresponding path program 1 times [2021-11-02 12:38:44,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:38:44,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133650844] [2021-11-02 12:38:44,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:38:44,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:38:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:38:44,975 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-02 12:38:44,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:38:44,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133650844] [2021-11-02 12:38:44,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133650844] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:38:44,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:38:44,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:38:44,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606182876] [2021-11-02 12:38:44,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:38:44,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:38:44,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:38:44,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:38:44,977 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:47,021 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:38:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:38:48,104 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2021-11-02 12:38:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:38:48,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-02 12:38:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:38:48,105 INFO L225 Difference]: With dead ends: 147 [2021-11-02 12:38:48,105 INFO L226 Difference]: Without dead ends: 95 [2021-11-02 12:38:48,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.20ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:38:48,106 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2815.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.92ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3078.13ms IncrementalHoareTripleChecker+Time [2021-11-02 12:38:48,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 257 Unknown, 0 Unchecked, 4.92ms Time], IncrementalHoareTripleChecker [5 Valid, 251 Invalid, 1 Unknown, 0 Unchecked, 3078.13ms Time] [2021-11-02 12:38:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-02 12:38:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2021-11-02 12:38:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 78 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-02 12:38:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2021-11-02 12:38:48,112 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 20 [2021-11-02 12:38:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:38:48,112 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2021-11-02 12:38:48,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2021-11-02 12:38:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 12:38:48,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:38:48,113 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] [2021-11-02 12:38:48,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 12:38:48,113 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:38:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:38:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash -322119372, now seen corresponding path program 1 times [2021-11-02 12:38:48,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:38:48,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345798178] [2021-11-02 12:38:48,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:38:48,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:38:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:38:48,685 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-02 12:38:48,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:38:48,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345798178] [2021-11-02 12:38:48,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345798178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:38:48,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:38:48,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:38:48,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787334553] [2021-11-02 12:38:48,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:38:48,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:38:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:38:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:38:48,687 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:50,928 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:38:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:38:52,737 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2021-11-02 12:38:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:38:52,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-02 12:38:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:38:52,739 INFO L225 Difference]: With dead ends: 139 [2021-11-02 12:38:52,739 INFO L226 Difference]: Without dead ends: 135 [2021-11-02 12:38:52,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 257.29ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:38:52,740 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3597.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.40ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3871.01ms IncrementalHoareTripleChecker+Time [2021-11-02 12:38:52,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 497 Unknown, 0 Unchecked, 8.40ms Time], IncrementalHoareTripleChecker [17 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 3871.01ms Time] [2021-11-02 12:38:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-02 12:38:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2021-11-02 12:38:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.25) internal successors, (100), 86 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-02 12:38:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2021-11-02 12:38:52,745 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 20 [2021-11-02 12:38:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:38:52,745 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2021-11-02 12:38:52,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2021-11-02 12:38:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 12:38:52,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:38:52,746 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] [2021-11-02 12:38:52,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 12:38:52,746 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:38:52,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:38:52,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2144800216, now seen corresponding path program 1 times [2021-11-02 12:38:52,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:38:52,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363712178] [2021-11-02 12:38:52,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:38:52,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:38:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:38:53,203 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-02 12:38:53,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:38:53,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363712178] [2021-11-02 12:38:53,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363712178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:38:53,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:38:53,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:38:53,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490989608] [2021-11-02 12:38:53,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:38:53,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:38:53,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:38:53,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:38:53,204 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:55,258 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:38:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:38:56,821 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2021-11-02 12:38:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 12:38:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-11-02 12:38:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:38:56,822 INFO L225 Difference]: With dead ends: 159 [2021-11-02 12:38:56,823 INFO L226 Difference]: Without dead ends: 100 [2021-11-02 12:38:56,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 292.23ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:38:56,826 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3182.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.03ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3397.04ms IncrementalHoareTripleChecker+Time [2021-11-02 12:38:56,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 411 Unknown, 0 Unchecked, 6.03ms Time], IncrementalHoareTripleChecker [4 Valid, 406 Invalid, 1 Unknown, 0 Unchecked, 3397.04ms Time] [2021-11-02 12:38:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-02 12:38:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2021-11-02 12:38:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 88 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-02 12:38:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2021-11-02 12:38:56,840 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 24 [2021-11-02 12:38:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:38:56,841 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2021-11-02 12:38:56,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:38:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2021-11-02 12:38:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 12:38:56,842 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:38:56,842 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] [2021-11-02 12:38:56,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 12:38:56,842 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:38:56,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:38:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1464741846, now seen corresponding path program 1 times [2021-11-02 12:38:56,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:38:56,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783256039] [2021-11-02 12:38:56,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:38:56,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:38:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:38:59,294 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-02 12:38:59,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:38:59,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783256039] [2021-11-02 12:38:59,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783256039] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:38:59,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:38:59,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 12:38:59,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918907588] [2021-11-02 12:38:59,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 12:38:59,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:38:59,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 12:38:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:38:59,296 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:01,435 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:39:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:39:03,051 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2021-11-02 12:39:03,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 12:39:03,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-11-02 12:39:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:39:03,052 INFO L225 Difference]: With dead ends: 181 [2021-11-02 12:39:03,053 INFO L226 Difference]: Without dead ends: 118 [2021-11-02 12:39:03,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 305.39ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:39:03,053 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3264.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.96ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3533.83ms IncrementalHoareTripleChecker+Time [2021-11-02 12:39:03,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 400 Unknown, 0 Unchecked, 7.96ms Time], IncrementalHoareTripleChecker [7 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 3533.83ms Time] [2021-11-02 12:39:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-02 12:39:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2021-11-02 12:39:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 100 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2021-11-02 12:39:03,060 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 24 [2021-11-02 12:39:03,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:39:03,061 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2021-11-02 12:39:03,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2021-11-02 12:39:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 12:39:03,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:39:03,062 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] [2021-11-02 12:39:03,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 12:39:03,063 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:39:03,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:39:03,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1241877548, now seen corresponding path program 1 times [2021-11-02 12:39:03,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:39:03,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594071488] [2021-11-02 12:39:03,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:39:03,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:39:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 12:39:04,436 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 12:39:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 12:39:05,890 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 12:39:05,891 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-02 12:39:05,891 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-11-02 12:39:05,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-11-02 12:39:05,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2021-11-02 12:39:05,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2021-11-02 12:39:05,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2021-11-02 12:39:05,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-11-02 12:39:05,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-11-02 12:39:05,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 12:39:05,896 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:39:05,898 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 12:39:05,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,922 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,928 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,933 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,933 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,934 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,934 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,936 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,936 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,937 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,937 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,937 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,938 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,940 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,941 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,941 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,942 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,942 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,943 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,943 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,943 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,944 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,944 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,945 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,945 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,945 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,946 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,947 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,948 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,948 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,948 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,960 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,960 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,960 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,961 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,963 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,963 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,964 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,971 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,972 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,972 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,973 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,973 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,974 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,976 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,976 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,977 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,977 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,978 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,978 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,979 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,979 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,979 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,980 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,980 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,980 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,981 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,981 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,982 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,982 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,982 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,983 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:05,983 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 12:39:05,984 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 12:39:05,984 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 12:39:05,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 12:39:05,984 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 12:39:05,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 12:39:06,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 12:39:06 BoogieIcfgContainer [2021-11-02 12:39:06,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 12:39:06,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 12:39:06,139 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 12:39:06,139 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 12:39:06,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:38:34" (3/4) ... [2021-11-02 12:39:06,141 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 12:39:06,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 12:39:06,142 INFO L158 Benchmark]: Toolchain (without parser) took 37967.68ms. Allocated memory was 90.2MB in the beginning and 593.5MB in the end (delta: 503.3MB). Free memory was 50.2MB in the beginning and 433.5MB in the end (delta: -383.3MB). Peak memory consumption was 120.8MB. Max. memory is 16.1GB. [2021-11-02 12:39:06,142 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory was 47.7MB in the beginning and 47.7MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 12:39:06,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1586.90ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 50.0MB in the beginning and 66.0MB in the end (delta: -16.0MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2021-11-02 12:39:06,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 187.90ms. Allocated memory is still 132.1MB. Free memory was 66.0MB in the beginning and 54.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-02 12:39:06,143 INFO L158 Benchmark]: Boogie Preprocessor took 83.28ms. Allocated memory is still 132.1MB. Free memory was 54.8MB in the beginning and 78.6MB in the end (delta: -23.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-02 12:39:06,143 INFO L158 Benchmark]: RCFGBuilder took 4358.88ms. Allocated memory was 132.1MB in the beginning and 593.5MB in the end (delta: 461.4MB). Free memory was 78.6MB in the beginning and 368.6MB in the end (delta: -290.1MB). Peak memory consumption was 354.1MB. Max. memory is 16.1GB. [2021-11-02 12:39:06,143 INFO L158 Benchmark]: TraceAbstraction took 31738.99ms. Allocated memory is still 593.5MB. Free memory was 367.6MB in the beginning and 433.5MB in the end (delta: -65.9MB). Peak memory consumption was 194.0MB. Max. memory is 16.1GB. [2021-11-02 12:39:06,143 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 593.5MB. Free memory is still 433.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 12:39:06,144 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory was 47.7MB in the beginning and 47.7MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1586.90ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 50.0MB in the beginning and 66.0MB in the end (delta: -16.0MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 187.90ms. Allocated memory is still 132.1MB. Free memory was 66.0MB in the beginning and 54.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.28ms. Allocated memory is still 132.1MB. Free memory was 54.8MB in the beginning and 78.6MB in the end (delta: -23.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 4358.88ms. Allocated memory was 132.1MB in the beginning and 593.5MB in the end (delta: 461.4MB). Free memory was 78.6MB in the beginning and 368.6MB in the end (delta: -290.1MB). Peak memory consumption was 354.1MB. Max. memory is 16.1GB. * TraceAbstraction took 31738.99ms. Allocated memory is still 593.5MB. Free memory was 367.6MB in the beginning and 433.5MB in the end (delta: -65.9MB). Peak memory consumption was 194.0MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 593.5MB. Free memory is still 433.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 8772. Possible FailurePath: [L6866-L6871] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7311] static __thread int tl_last_error = 0; [L7648-L7660] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; [L8771-L8919] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L8922-L8925] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L8927-L8936] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L8938-L8941] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L8943-L8947] static _Bool s_common_library_initialized = 0 ; VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] [L8960] size_t capacity; [L8961] void *array; [L211] COND FALSE !(!cond) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list=2, s_common_log_subject_list={393:0}, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] [L6886] return malloc(size); [L8963] array = bounded_malloc(sizeof(*(array)) * (capacity)) [L8965] struct aws_byte_buf buf = aws_byte_buf_from_empty_array(array, capacity); [L211] COND FALSE !(!cond) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list={484:0}, s_list=46, s_tolower_table={455:0}, tl_last_error=0] [L8221] struct aws_byte_buf buf; VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list=2, s_common_log_subject_list={393:0}, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] [L8222-L8223] EXPR (capacity > 0) ? (uint8_t *)bytes : ((void *)0) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list={484:0}, s_list=46, s_tolower_table={455:0}, tl_last_error=0] [L8222-L8223] buf.buffer = (capacity > 0) ? (uint8_t *)bytes : ((void *)0) [L8225] buf.len = 0 [L8226] buf.capacity = capacity [L8227-L8228] buf.allocator = ((void *)0) [L7377-L7380] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7377] EXPR buf->capacity [L7377] EXPR buf->capacity == 0 && buf->len == 0 VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] [L7377-L7378] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list={484:0}, s_list=46, s_tolower_table={455:0}, tl_last_error=0] [L7377-L7380] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) [L7380] EXPR buf->capacity [L7380] EXPR buf->capacity > 0 && buf->len <= buf->capacity VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list={484:0}, s_list=46, s_tolower_table={455:0}, tl_last_error=0] [L7380] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list={484:0}, s_list=46, s_tolower_table={455:0}, tl_last_error=0] [L7377-L7380] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list=2, s_common_log_subject_list={393:0}, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] [L7377-L7380] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list=2, s_common_log_subject_list={393:0}, s_list={484:0}, s_list=46, s_tolower_table={455:0}, tl_last_error=0] [L7377-L7380] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L223] COND TRUE !cond VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] [L223] reach_error() VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 31440.65ms, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 13.54ms, AutomataDifference: 23839.45ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 7.13ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 22944.90ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 492 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 21123.81ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1156 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2110 IncrementalHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 0 mSDtfsCounter, 2110 mSolverCounterSat, 41.89ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1032.04ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 62.64ms AutomataMinimizationTime, 7 MinimizatonAttempts, 132 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 116.27ms SsaConstructionTime, 4305.72ms SatisfiabilityAnalysisTime, 1441.87ms InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-02 12:39:06,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_from_empty_array_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 12:39:07,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 12:39:07,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 12:39:07,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 12:39:07,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 12:39:07,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 12:39:07,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 12:39:07,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 12:39:07,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 12:39:07,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 12:39:07,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 12:39:07,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 12:39:07,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 12:39:07,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 12:39:07,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 12:39:07,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 12:39:07,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 12:39:07,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 12:39:07,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 12:39:07,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 12:39:07,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 12:39:07,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 12:39:07,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 12:39:07,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 12:39:07,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 12:39:07,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 12:39:07,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 12:39:07,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 12:39:07,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 12:39:07,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 12:39:07,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 12:39:07,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 12:39:07,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 12:39:07,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 12:39:07,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 12:39:07,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 12:39:07,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 12:39:07,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 12:39:07,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 12:39:07,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 12:39:07,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 12:39:07,863 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-02 12:39:07,886 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 12:39:07,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 12:39:07,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 12:39:07,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 12:39:07,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 12:39:07,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 12:39:07,889 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 12:39:07,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 12:39:07,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 12:39:07,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 12:39:07,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 12:39:07,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 12:39:07,891 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 12:39:07,891 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 12:39:07,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 12:39:07,891 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 12:39:07,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 12:39:07,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 12:39:07,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 12:39:07,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 12:39:07,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:39:07,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 12:39:07,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 12:39:07,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 12:39:07,893 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 12:39:07,893 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 12:39:07,893 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 12:39:07,893 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 12:39:07,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 12:39:07,893 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 12:39:07,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 12:39:07,894 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2021-11-02 12:39:08,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 12:39:08,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 12:39:08,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 12:39:08,169 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 12:39:08,170 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 12:39:08,171 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_from_empty_array_harness.i [2021-11-02 12:39:08,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95d614c2/3b7f8bc004ae4a71b87613e886c10d73/FLAG8ca163b0e [2021-11-02 12:39:08,829 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 12:39:08,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2021-11-02 12:39:08,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95d614c2/3b7f8bc004ae4a71b87613e886c10d73/FLAG8ca163b0e [2021-11-02 12:39:09,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95d614c2/3b7f8bc004ae4a71b87613e886c10d73 [2021-11-02 12:39:09,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 12:39:09,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 12:39:09,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 12:39:09,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 12:39:09,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 12:39:09,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:39:09" (1/1) ... [2021-11-02 12:39:09,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c8beef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:09, skipping insertion in model container [2021-11-02 12:39:09,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:39:09" (1/1) ... [2021-11-02 12:39:09,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 12:39:09,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 12:39:09,523 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-11-02 12:39:09,528 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-11-02 12:39:09,547 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:39:09,552 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:39:10,021 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,021 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,026 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,027 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,027 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,037 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,038 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,039 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,039 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,259 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:39:10,260 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:39:10,261 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:39:10,263 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:39:10,267 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:39:10,268 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:39:10,269 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:39:10,270 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:39:10,272 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:39:10,274 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:39:10,375 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:39:10,475 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,476 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:39:10,586 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 12:39:10,603 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-11-02 12:39:10,603 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-11-02 12:39:10,605 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:39:10,606 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:39:10,632 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,632 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,633 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,634 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,635 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,640 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,640 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,640 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,641 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,664 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:39:10,665 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:39:10,665 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:39:10,666 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:39:10,676 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:39:10,678 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:39:10,679 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:39:10,679 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:39:10,679 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:39:10,679 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:39:10,698 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:39:10,742 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,743 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:39:10,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:39:11,039 INFO L208 MainTranslator]: Completed translation [2021-11-02 12:39:11,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11 WrapperNode [2021-11-02 12:39:11,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 12:39:11,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 12:39:11,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 12:39:11,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 12:39:11,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (1/1) ... [2021-11-02 12:39:11,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (1/1) ... [2021-11-02 12:39:11,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 12:39:11,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 12:39:11,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 12:39:11,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 12:39:11,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (1/1) ... [2021-11-02 12:39:11,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (1/1) ... [2021-11-02 12:39:11,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (1/1) ... [2021-11-02 12:39:11,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (1/1) ... [2021-11-02 12:39:11,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (1/1) ... [2021-11-02 12:39:11,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (1/1) ... [2021-11-02 12:39:11,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (1/1) ... [2021-11-02 12:39:11,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 12:39:11,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 12:39:11,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 12:39:11,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 12:39:11,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (1/1) ... [2021-11-02 12:39:11,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:39:11,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:39:11,274 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-02 12:39:11,277 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-02 12:39:11,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 12:39:11,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 12:39:11,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-02 12:39:11,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-02 12:39:11,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 12:39:11,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 12:39:11,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 12:39:11,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 12:39:11,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-02 12:39:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-02 12:39:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 12:39:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 12:39:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-02 12:39:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 12:39:17,786 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 12:39:17,786 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2021-11-02 12:39:17,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:39:17 BoogieIcfgContainer [2021-11-02 12:39:17,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 12:39:17,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 12:39:17,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 12:39:17,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 12:39:17,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:39:09" (1/3) ... [2021-11-02 12:39:17,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222596e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:39:17, skipping insertion in model container [2021-11-02 12:39:17,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:11" (2/3) ... [2021-11-02 12:39:17,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222596e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:39:17, skipping insertion in model container [2021-11-02 12:39:17,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:39:17" (3/3) ... [2021-11-02 12:39:17,797 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2021-11-02 12:39:17,801 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 12:39:17,801 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-02 12:39:17,851 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 12:39:17,858 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-02 12:39:17,861 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-02 12:39:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 77 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-02 12:39:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-02 12:39:17,878 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:39:17,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:39:17,879 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:39:17,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:39:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash 810375617, now seen corresponding path program 1 times [2021-11-02 12:39:17,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:39:17,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447945658] [2021-11-02 12:39:17,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:39:17,900 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:39:17,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:39:17,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:39:17,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-02 12:39:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:39:20,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-02 12:39:20,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:39:20,184 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-02 12:39:20,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:39:20,215 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-02 12:39:20,216 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:39:20,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447945658] [2021-11-02 12:39:20,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447945658] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:39:20,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:39:20,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 12:39:20,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396236826] [2021-11-02 12:39:20,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 12:39:20,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:39:20,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 12:39:20,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:39:20,263 INFO L87 Difference]: Start difference. First operand has 78 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 77 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:22,546 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:39:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:39:23,127 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2021-11-02 12:39:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 12:39:23,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-02 12:39:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:39:23,137 INFO L225 Difference]: With dead ends: 153 [2021-11-02 12:39:23,137 INFO L226 Difference]: Without dead ends: 71 [2021-11-02 12:39:23,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.15ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:39:23,141 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2686.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.05ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2823.45ms IncrementalHoareTripleChecker+Time [2021-11-02 12:39:23,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 2.05ms Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2823.45ms Time] [2021-11-02 12:39:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-02 12:39:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-02 12:39:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.328125) internal successors, (85), 70 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-02 12:39:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2021-11-02 12:39:23,167 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 14 [2021-11-02 12:39:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:39:23,168 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2021-11-02 12:39:23,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2021-11-02 12:39:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-02 12:39:23,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:39:23,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:39:23,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-02 12:39:23,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:39:23,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:39:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:39:23,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1068541055, now seen corresponding path program 1 times [2021-11-02 12:39:23,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:39:23,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023627673] [2021-11-02 12:39:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:39:23,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:39:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:39:23,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:39:23,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-02 12:39:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:39:25,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 12:39:25,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:39:25,666 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-02 12:39:25,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:39:25,725 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-02 12:39:25,725 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:39:25,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023627673] [2021-11-02 12:39:25,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023627673] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:39:25,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:39:25,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 12:39:25,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253779057] [2021-11-02 12:39:25,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:39:25,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:39:25,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:39:25,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:39:25,727 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:27,934 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:39:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:39:28,704 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2021-11-02 12:39:28,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:39:28,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-02 12:39:28,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:39:28,706 INFO L225 Difference]: With dead ends: 120 [2021-11-02 12:39:28,706 INFO L226 Difference]: Without dead ends: 71 [2021-11-02 12:39:28,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.07ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:39:28,707 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2808.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.67ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2919.84ms IncrementalHoareTripleChecker+Time [2021-11-02 12:39:28,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 186 Unknown, 0 Unchecked, 4.67ms Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 1 Unknown, 0 Unchecked, 2919.84ms Time] [2021-11-02 12:39:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-02 12:39:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-02 12:39:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.3125) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2021-11-02 12:39:28,712 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 14 [2021-11-02 12:39:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:39:28,713 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2021-11-02 12:39:28,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2021-11-02 12:39:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 12:39:28,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:39:28,714 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] [2021-11-02 12:39:28,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-02 12:39:28,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:39:28,915 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:39:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:39:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash -715146382, now seen corresponding path program 1 times [2021-11-02 12:39:28,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:39:28,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528585579] [2021-11-02 12:39:28,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:39:28,920 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:39:28,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:39:28,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:39:28,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-02 12:39:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:39:31,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 12:39:31,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:39:31,212 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-02 12:39:31,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:39:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:39:31,260 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:39:31,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528585579] [2021-11-02 12:39:31,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528585579] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:39:31,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:39:31,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 12:39:31,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299690721] [2021-11-02 12:39:31,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:39:31,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:39:31,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:39:31,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:39:31,261 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:33,467 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:39:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:39:35,042 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2021-11-02 12:39:35,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:39:35,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-02 12:39:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:39:35,043 INFO L225 Difference]: With dead ends: 173 [2021-11-02 12:39:35,044 INFO L226 Difference]: Without dead ends: 115 [2021-11-02 12:39:35,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.91ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:39:35,046 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3562.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.77ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3723.21ms IncrementalHoareTripleChecker+Time [2021-11-02 12:39:35,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 6.77ms Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 1 Unknown, 0 Unchecked, 3723.21ms Time] [2021-11-02 12:39:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-02 12:39:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 75. [2021-11-02 12:39:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 74 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-02 12:39:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2021-11-02 12:39:35,052 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 20 [2021-11-02 12:39:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:39:35,052 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2021-11-02 12:39:35,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2021-11-02 12:39:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 12:39:35,053 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:39:35,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:39:35,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-02 12:39:35,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:39:35,267 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:39:35,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:39:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1524493008, now seen corresponding path program 1 times [2021-11-02 12:39:35,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:39:35,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495196342] [2021-11-02 12:39:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:39:35,271 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:39:35,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:39:35,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:39:35,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-02 12:39:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:39:37,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 12:39:37,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:39:37,585 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-02 12:39:37,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:39:37,649 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-02 12:39:37,649 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:39:37,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495196342] [2021-11-02 12:39:37,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495196342] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:39:37,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:39:37,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-02 12:39:37,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912220335] [2021-11-02 12:39:37,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:39:37,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:39:37,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:39:37,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:39:37,651 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:39,857 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:39:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:39:41,924 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2021-11-02 12:39:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 12:39:41,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-02 12:39:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:39:41,925 INFO L225 Difference]: With dead ends: 167 [2021-11-02 12:39:41,926 INFO L226 Difference]: Without dead ends: 115 [2021-11-02 12:39:41,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 128.32ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:39:41,927 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3953.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.59ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4150.89ms IncrementalHoareTripleChecker+Time [2021-11-02 12:39:41,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 389 Unknown, 0 Unchecked, 7.59ms Time], IncrementalHoareTripleChecker [8 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 4150.89ms Time] [2021-11-02 12:39:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-02 12:39:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2021-11-02 12:39:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 78 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-02 12:39:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2021-11-02 12:39:41,932 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 20 [2021-11-02 12:39:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:39:41,932 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2021-11-02 12:39:41,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2021-11-02 12:39:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 12:39:41,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:39:41,933 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] [2021-11-02 12:39:41,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-02 12:39:42,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:39:42,134 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:39:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:39:42,135 INFO L85 PathProgramCache]: Analyzing trace with hash -322119372, now seen corresponding path program 1 times [2021-11-02 12:39:42,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:39:42,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033637797] [2021-11-02 12:39:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:39:42,138 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:39:42,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:39:42,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:39:42,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-02 12:39:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:39:44,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 1573 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 12:39:44,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:39:44,437 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-02 12:39:44,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:39:44,535 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-02 12:39:44,535 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:39:44,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033637797] [2021-11-02 12:39:44,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033637797] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:39:44,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:39:44,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-02 12:39:44,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816223033] [2021-11-02 12:39:44,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 12:39:44,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:39:44,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 12:39:44,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:39:44,536 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:46,732 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:39:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:39:49,284 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2021-11-02 12:39:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 12:39:49,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 20 [2021-11-02 12:39:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:39:49,286 INFO L225 Difference]: With dead ends: 139 [2021-11-02 12:39:49,286 INFO L226 Difference]: Without dead ends: 135 [2021-11-02 12:39:49,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 332.04ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-11-02 12:39:49,287 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 181 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4278.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.99ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4485.71ms IncrementalHoareTripleChecker+Time [2021-11-02 12:39:49,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 0 Invalid, 512 Unknown, 0 Unchecked, 8.99ms Time], IncrementalHoareTripleChecker [32 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 4485.71ms Time] [2021-11-02 12:39:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-02 12:39:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2021-11-02 12:39:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.25) internal successors, (100), 86 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-02 12:39:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2021-11-02 12:39:49,293 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 20 [2021-11-02 12:39:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:39:49,294 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2021-11-02 12:39:49,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:39:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2021-11-02 12:39:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 12:39:49,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:39:49,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:39:49,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-02 12:39:49,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:39:49,501 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:39:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:39:49,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2144800216, now seen corresponding path program 1 times [2021-11-02 12:39:49,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:39:49,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671421244] [2021-11-02 12:39:49,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:39:49,505 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:39:49,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:39:49,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:39:49,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-02 12:40:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:40:13,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 1577 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-02 12:40:13,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:40:13,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 12:40:13,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2021-11-02 12:40:15,755 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 12:40:15,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 33 [2021-11-02 12:40:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:40:15,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:40:16,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:40:16,359 INFO L354 Elim1Store]: treesize reduction 380, result has 0.3 percent of original size [2021-11-02 12:40:16,359 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 4 case distinctions, treesize of input 90 treesize of output 1 [2021-11-02 12:40:16,371 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-02 12:40:16,371 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:40:16,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671421244] [2021-11-02 12:40:16,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671421244] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:40:16,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:40:16,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2021-11-02 12:40:16,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204059156] [2021-11-02 12:40:16,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:40:16,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:40:16,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:40:16,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:40:16,373 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:40:18,599 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:40:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:40:24,240 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2021-11-02 12:40:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 12:40:24,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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 24 [2021-11-02 12:40:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:40:24,241 INFO L225 Difference]: With dead ends: 172 [2021-11-02 12:40:24,241 INFO L226 Difference]: Without dead ends: 113 [2021-11-02 12:40:24,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 5187.12ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-02 12:40:24,242 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4883.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.15ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 5180.16ms IncrementalHoareTripleChecker+Time [2021-11-02 12:40:24,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 601 Unknown, 0 Unchecked, 7.15ms Time], IncrementalHoareTripleChecker [10 Valid, 477 Invalid, 1 Unknown, 113 Unchecked, 5180.16ms Time] [2021-11-02 12:40:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-02 12:40:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2021-11-02 12:40:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:40:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2021-11-02 12:40:24,249 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 24 [2021-11-02 12:40:24,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:40:24,250 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2021-11-02 12:40:24,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:40:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2021-11-02 12:40:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 12:40:24,250 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:40:24,251 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] [2021-11-02 12:40:24,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-02 12:40:24,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:40:24,460 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:40:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:40:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1464741846, now seen corresponding path program 1 times [2021-11-02 12:40:24,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:40:24,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53063536] [2021-11-02 12:40:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:40:24,463 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:40:24,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:40:24,465 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:40:24,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-02 12:40:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:40:37,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-02 12:40:37,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:40:37,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 12:40:37,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2021-11-02 12:40:39,494 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 12:40:39,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 43 [2021-11-02 12:40:39,601 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-02 12:40:39,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:40:40,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:40:40,274 INFO L354 Elim1Store]: treesize reduction 340, result has 10.8 percent of original size [2021-11-02 12:40:40,274 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 4 case distinctions, treesize of input 77 treesize of output 75 [2021-11-02 12:40:40,290 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-02 12:40:40,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 29 [2021-11-02 12:40:40,654 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-02 12:40:40,654 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:40:40,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53063536] [2021-11-02 12:40:40,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53063536] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:40:40,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:40:40,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 16 [2021-11-02 12:40:40,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63020171] [2021-11-02 12:40:40,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 12:40:40,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:40:40,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 12:40:40,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-02 12:40:40,657 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:40:42,865 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:40:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:40:46,492 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2021-11-02 12:40:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:40:46,493 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-02 12:40:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:40:46,493 INFO L225 Difference]: With dead ends: 155 [2021-11-02 12:40:46,493 INFO L226 Difference]: Without dead ends: 92 [2021-11-02 12:40:46,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2444.56ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-11-02 12:40:46,494 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5136.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.69ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 5458.19ms IncrementalHoareTripleChecker+Time [2021-11-02 12:40:46,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 817 Unknown, 0 Unchecked, 8.69ms Time], IncrementalHoareTripleChecker [1 Valid, 733 Invalid, 1 Unknown, 82 Unchecked, 5458.19ms Time] [2021-11-02 12:40:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-02 12:40:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-11-02 12:40:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 91 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-02 12:40:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-11-02 12:40:46,501 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 24 [2021-11-02 12:40:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:40:46,501 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-11-02 12:40:46,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:40:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-11-02 12:40:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 12:40:46,503 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:40:46,503 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] [2021-11-02 12:40:46,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-02 12:40:46,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:40:46,707 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:40:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:40:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1391848404, now seen corresponding path program 1 times [2021-11-02 12:40:46,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:40:46,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473844904] [2021-11-02 12:40:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:40:46,711 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:40:46,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:40:46,712 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:40:46,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-02 12:40:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:40:48,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 1582 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 12:40:48,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:40:49,023 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-02 12:40:49,023 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 59 treesize of output 23 [2021-11-02 12:40:49,095 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-02 12:40:49,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:40:49,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-02 12:40:49,298 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:40:49,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473844904] [2021-11-02 12:40:49,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473844904] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:40:49,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:40:49,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-02 12:40:49,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262769856] [2021-11-02 12:40:49,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 12:40:49,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:40:49,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 12:40:49,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:40:49,300 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:40:51,505 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:40:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:40:54,083 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2021-11-02 12:40:54,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:40:54,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-02 12:40:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:40:54,084 INFO L225 Difference]: With dead ends: 212 [2021-11-02 12:40:54,085 INFO L226 Difference]: Without dead ends: 149 [2021-11-02 12:40:54,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 339.82ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:40:54,085 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4344.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.63ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4615.03ms IncrementalHoareTripleChecker+Time [2021-11-02 12:40:54,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 473 Unknown, 0 Unchecked, 7.63ms Time], IncrementalHoareTripleChecker [8 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 4615.03ms Time] [2021-11-02 12:40:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-11-02 12:40:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 95. [2021-11-02 12:40:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:40:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2021-11-02 12:40:54,089 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 24 [2021-11-02 12:40:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:40:54,090 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2021-11-02 12:40:54,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:40:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2021-11-02 12:40:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 12:40:54,090 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:40:54,091 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] [2021-11-02 12:40:54,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-02 12:40:54,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:40:54,300 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:40:54,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:40:54,301 INFO L85 PathProgramCache]: Analyzing trace with hash -711790034, now seen corresponding path program 1 times [2021-11-02 12:40:54,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:40:54,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815723976] [2021-11-02 12:40:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:40:54,304 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:40:54,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:40:54,305 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:40:54,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-02 12:41:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:41:07,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-02 12:41:07,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:41:07,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 12:41:07,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2021-11-02 12:41:07,610 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 12:41:07,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 40 [2021-11-02 12:41:07,732 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-02 12:41:07,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:41:07,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:41:08,150 INFO L354 Elim1Store]: treesize reduction 340, result has 10.8 percent of original size [2021-11-02 12:41:08,151 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 4 case distinctions, treesize of input 61 treesize of output 59 [2021-11-02 12:41:08,166 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-02 12:41:08,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 25 [2021-11-02 12:41:08,247 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-02 12:41:08,247 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:41:08,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815723976] [2021-11-02 12:41:08,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815723976] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:41:08,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:41:08,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 5] imperfect sequences [] total 11 [2021-11-02 12:41:08,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141705344] [2021-11-02 12:41:08,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 12:41:08,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:41:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 12:41:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-02 12:41:08,249 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:41:10,466 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:41:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:41:15,159 INFO L93 Difference]: Finished difference Result 187 states and 213 transitions. [2021-11-02 12:41:15,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:41:15,160 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 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 24 [2021-11-02 12:41:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:41:15,160 INFO L225 Difference]: With dead ends: 187 [2021-11-02 12:41:15,160 INFO L226 Difference]: Without dead ends: 110 [2021-11-02 12:41:15,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 832.79ms TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-11-02 12:41:15,161 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6136.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.63ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 6499.86ms IncrementalHoareTripleChecker+Time [2021-11-02 12:41:15,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 854 Unknown, 0 Unchecked, 11.63ms Time], IncrementalHoareTripleChecker [3 Valid, 849 Invalid, 1 Unknown, 1 Unchecked, 6499.86ms Time] [2021-11-02 12:41:15,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-02 12:41:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2021-11-02 12:41:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:41:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-11-02 12:41:15,165 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 24 [2021-11-02 12:41:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:41:15,165 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-11-02 12:41:15,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:41:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-11-02 12:41:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 12:41:15,166 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:41:15,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:41:15,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-02 12:41:15,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:41:15,380 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:41:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:41:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1994829360, now seen corresponding path program 1 times [2021-11-02 12:41:15,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:41:15,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162110932] [2021-11-02 12:41:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:41:15,383 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:41:15,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:41:15,384 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:41:15,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-02 12:47:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:47:25,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-02 12:47:25,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:47:25,927 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 0 case distinctions, treesize of input 65 treesize of output 58 [2021-11-02 12:47:25,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 43 [2021-11-02 12:47:25,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2021-11-02 12:47:25,985 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 0 case distinctions, treesize of input 38 treesize of output 31 [2021-11-02 12:47:25,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2021-11-02 12:47:26,308 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-02 12:47:26,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:47:26,669 INFO L354 Elim1Store]: treesize reduction 88, result has 10.2 percent of original size [2021-11-02 12:47:26,669 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 2 case distinctions, treesize of input 156 treesize of output 134 [2021-11-02 12:47:26,790 INFO L354 Elim1Store]: treesize reduction 88, result has 10.2 percent of original size [2021-11-02 12:47:26,791 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 2 case distinctions, treesize of input 134 treesize of output 112 [2021-11-02 12:47:26,802 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 111 treesize of output 105 [2021-11-02 12:47:26,822 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 1146 treesize of output 1110 [2021-11-02 12:47:26,933 INFO L354 Elim1Store]: treesize reduction 98, result has 9.3 percent of original size [2021-11-02 12:47:26,933 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 2 case distinctions, treesize of input 60 treesize of output 33 [2021-11-02 12:47:26,940 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 29 treesize of output 25 [2021-11-02 12:47:26,946 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 37 treesize of output 29 [2021-11-02 12:47:27,014 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-02 12:47:27,014 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:47:27,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162110932] [2021-11-02 12:47:27,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162110932] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:47:27,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:47:27,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2021-11-02 12:47:27,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121745309] [2021-11-02 12:47:27,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:47:27,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:47:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:47:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:47:27,015 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:47:29,213 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:47:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:47:33,026 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2021-11-02 12:47:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:47:33,026 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 24 [2021-11-02 12:47:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:47:33,027 INFO L225 Difference]: With dead ends: 183 [2021-11-02 12:47:33,027 INFO L226 Difference]: Without dead ends: 116 [2021-11-02 12:47:33,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 439.00ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:47:33,029 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5481.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.33ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5785.88ms IncrementalHoareTripleChecker+Time [2021-11-02 12:47:33,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 699 Unknown, 0 Unchecked, 7.33ms Time], IncrementalHoareTripleChecker [2 Valid, 696 Invalid, 1 Unknown, 0 Unchecked, 5785.88ms Time] [2021-11-02 12:47:33,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-02 12:47:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2021-11-02 12:47:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 97 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:47:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2021-11-02 12:47:33,032 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 24 [2021-11-02 12:47:33,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:47:33,032 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2021-11-02 12:47:33,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:47:33,032 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2021-11-02 12:47:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 12:47:33,033 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:47:33,033 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] [2021-11-02 12:47:33,239 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forcibly destroying the process [2021-11-02 12:47:33,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 137 [2021-11-02 12:47:33,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:47:33,339 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:47:33,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:47:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2041972498, now seen corresponding path program 1 times [2021-11-02 12:47:33,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:47:33,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029954242] [2021-11-02 12:47:33,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:47:33,342 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:47:33,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:47:33,343 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:47:33,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-02 12:47:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:47:44,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-02 12:47:44,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:47:44,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 12:47:44,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2021-11-02 12:47:47,002 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 12:47:47,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 34 [2021-11-02 12:47:47,129 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-02 12:47:47,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:47:47,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:47:47,321 INFO L354 Elim1Store]: treesize reduction 380, result has 0.3 percent of original size [2021-11-02 12:47:47,322 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 4 case distinctions, treesize of input 58 treesize of output 1 [2021-11-02 12:47:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:47:47,332 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:47:47,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029954242] [2021-11-02 12:47:47,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029954242] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:47:47,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:47:47,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2021-11-02 12:47:47,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783803665] [2021-11-02 12:47:47,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 12:47:47,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:47:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 12:47:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:47:47,333 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:47:49,545 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:47:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:47:53,430 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2021-11-02 12:47:53,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 12:47:53,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 24 [2021-11-02 12:47:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:47:53,431 INFO L225 Difference]: With dead ends: 162 [2021-11-02 12:47:53,431 INFO L226 Difference]: Without dead ends: 93 [2021-11-02 12:47:53,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4293.16ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:47:53,432 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3786.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.10ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 3969.08ms IncrementalHoareTripleChecker+Time [2021-11-02 12:47:53,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 395 Unknown, 0 Unchecked, 3.10ms Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 1 Unknown, 3 Unchecked, 3969.08ms Time] [2021-11-02 12:47:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-02 12:47:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-11-02 12:47:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 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-02 12:47:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-11-02 12:47:53,435 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 24 [2021-11-02 12:47:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:47:53,435 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-11-02 12:47:53,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:47:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-11-02 12:47:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-02 12:47:53,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:47:53,436 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] [2021-11-02 12:47:53,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-11-02 12:47:53,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:47:53,644 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:47:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:47:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1548380899, now seen corresponding path program 1 times [2021-11-02 12:47:53,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:47:53,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887726981] [2021-11-02 12:47:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:47:53,647 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:47:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:47:53,648 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:47:53,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-02 12:47:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:47:55,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 1581 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-02 12:47:55,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:47:55,801 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-02 12:47:55,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:47:55,925 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-02 12:47:55,925 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:47:55,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887726981] [2021-11-02 12:47:55,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887726981] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:47:55,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:47:55,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2021-11-02 12:47:55,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721035772] [2021-11-02 12:47:55,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 12:47:55,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:47:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 12:47:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:47:55,927 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:47:58,121 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:48:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:48:02,153 INFO L93 Difference]: Finished difference Result 165 states and 180 transitions. [2021-11-02 12:48:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 12:48:02,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 26 [2021-11-02 12:48:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:48:02,155 INFO L225 Difference]: With dead ends: 165 [2021-11-02 12:48:02,155 INFO L226 Difference]: Without dead ends: 161 [2021-11-02 12:48:02,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 717.00ms TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2021-11-02 12:48:02,157 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5388.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.90ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5649.00ms IncrementalHoareTripleChecker+Time [2021-11-02 12:48:02,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 897 Unknown, 0 Unchecked, 7.90ms Time], IncrementalHoareTripleChecker [49 Valid, 847 Invalid, 1 Unknown, 0 Unchecked, 5649.00ms Time] [2021-11-02 12:48:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-02 12:48:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 97. [2021-11-02 12:48:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:48:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-11-02 12:48:02,160 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 26 [2021-11-02 12:48:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:48:02,160 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-11-02 12:48:02,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:48:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-11-02 12:48:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-02 12:48:02,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:48:02,161 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] [2021-11-02 12:48:02,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-02 12:48:02,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:48:02,369 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:48:02,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:48:02,370 INFO L85 PathProgramCache]: Analyzing trace with hash 739034273, now seen corresponding path program 1 times [2021-11-02 12:48:02,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:48:02,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061789422] [2021-11-02 12:48:02,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:48:02,373 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:48:02,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:48:02,374 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:48:02,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-02 12:48:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:48:56,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 1584 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-02 12:48:56,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:48:57,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 12:48:57,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2021-11-02 12:48:59,435 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 12:48:59,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 34 [2021-11-02 12:48:59,498 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-02 12:48:59,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:48:59,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:48:59,723 INFO L354 Elim1Store]: treesize reduction 380, result has 0.3 percent of original size [2021-11-02 12:48:59,723 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 4 case distinctions, treesize of input 58 treesize of output 1 [2021-11-02 12:48:59,734 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-02 12:48:59,734 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:48:59,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061789422] [2021-11-02 12:48:59,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061789422] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:48:59,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:48:59,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 6 [2021-11-02 12:48:59,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563118637] [2021-11-02 12:48:59,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:48:59,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:48:59,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:48:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:48:59,736 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:49:01,997 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:49:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:49:05,539 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-11-02 12:49:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:49:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-02 12:49:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:49:05,540 INFO L225 Difference]: With dead ends: 158 [2021-11-02 12:49:05,540 INFO L226 Difference]: Without dead ends: 93 [2021-11-02 12:49:05,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4202.90ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:49:05,541 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3573.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.86ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 3721.07ms IncrementalHoareTripleChecker+Time [2021-11-02 12:49:05,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 364 Unknown, 0 Unchecked, 1.86ms Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 1 Unknown, 82 Unchecked, 3721.07ms Time] [2021-11-02 12:49:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-02 12:49:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2021-11-02 12:49:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 88 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-02 12:49:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2021-11-02 12:49:05,544 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 26 [2021-11-02 12:49:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:49:05,544 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2021-11-02 12:49:05,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:49:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2021-11-02 12:49:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-02 12:49:05,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:49:05,545 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] [2021-11-02 12:49:05,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-02 12:49:05,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:49:05,757 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:49:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:49:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash -365390039, now seen corresponding path program 1 times [2021-11-02 12:49:05,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:49:05,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218121302] [2021-11-02 12:49:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:49:05,761 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:49:05,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:49:05,762 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:49:05,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-02 12:49:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:49:08,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 12:49:08,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:49:08,227 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-02 12:49:08,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:49:08,369 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-02 12:49:08,369 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:49:08,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218121302] [2021-11-02 12:49:08,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218121302] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:49:08,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:49:08,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 12:49:08,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065055988] [2021-11-02 12:49:08,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:49:08,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:49:08,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:49:08,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:49:08,370 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:49:10,588 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:49:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:49:11,240 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2021-11-02 12:49:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:49:11,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-02 12:49:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:49:11,241 INFO L225 Difference]: With dead ends: 118 [2021-11-02 12:49:11,241 INFO L226 Difference]: Without dead ends: 89 [2021-11-02 12:49:11,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.90ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:49:11,242 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2726.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.16ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2835.37ms IncrementalHoareTripleChecker+Time [2021-11-02 12:49:11,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 125 Unknown, 0 Unchecked, 1.16ms Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 2835.37ms Time] [2021-11-02 12:49:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-02 12:49:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-02 12:49:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:49:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2021-11-02 12:49:11,249 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 26 [2021-11-02 12:49:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:49:11,249 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2021-11-02 12:49:11,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:49:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2021-11-02 12:49:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-02 12:49:11,250 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:49:11,250 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] [2021-11-02 12:49:11,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-02 12:49:11,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:49:11,451 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:49:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:49:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1400671456, now seen corresponding path program 1 times [2021-11-02 12:49:11,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:49:11,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261943350] [2021-11-02 12:49:11,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:49:11,455 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:49:11,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:49:11,456 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:49:11,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-02 12:49:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:49:13,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-02 12:49:13,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:49:14,898 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-11-02 12:49:14,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 38 [2021-11-02 12:49:14,979 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-02 12:49:14,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:49:16,904 INFO L354 Elim1Store]: treesize reduction 94, result has 49.7 percent of original size [2021-11-02 12:49:16,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 118 [2021-11-02 12:49:18,915 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-02 12:49:18,916 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:49:18,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261943350] [2021-11-02 12:49:18,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261943350] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:49:18,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:49:18,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2021-11-02 12:49:18,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663299888] [2021-11-02 12:49:18,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 12:49:18,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:49:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 12:49:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:49:18,917 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:49:21,132 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:49:23,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:49:23,804 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-11-02 12:49:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 12:49:23,804 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 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 34 [2021-11-02 12:49:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:49:23,805 INFO L225 Difference]: With dead ends: 100 [2021-11-02 12:49:23,805 INFO L226 Difference]: Without dead ends: 98 [2021-11-02 12:49:23,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1851.44ms TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2021-11-02 12:49:23,806 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4059.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.19ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 4270.73ms IncrementalHoareTripleChecker+Time [2021-11-02 12:49:23,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 590 Unknown, 0 Unchecked, 4.19ms Time], IncrementalHoareTripleChecker [9 Valid, 412 Invalid, 1 Unknown, 168 Unchecked, 4270.73ms Time] [2021-11-02 12:49:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-02 12:49:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2021-11-02 12:49:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 89 states have (on average 1.146067415730337) internal successors, (102), 94 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-02 12:49:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-11-02 12:49:23,809 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 34 [2021-11-02 12:49:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:49:23,809 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-11-02 12:49:23,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:49:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-11-02 12:49:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:49:23,809 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:49:23,809 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] [2021-11-02 12:49:23,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-02 12:49:24,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:49:24,010 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:49:24,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:49:24,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1720376510, now seen corresponding path program 1 times [2021-11-02 12:49:24,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:49:24,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308804542] [2021-11-02 12:49:24,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:49:24,013 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:49:24,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:49:24,014 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:49:24,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-02 12:49:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:49:26,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 1620 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-02 12:49:26,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:49:28,176 INFO L354 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2021-11-02 12:49:28,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 45 [2021-11-02 12:49:28,294 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-02 12:49:28,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:49:30,526 INFO L354 Elim1Store]: treesize reduction 94, result has 56.7 percent of original size [2021-11-02 12:49:30,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 148 [2021-11-02 12:49:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:49:40,451 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:49:40,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308804542] [2021-11-02 12:49:40,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308804542] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:49:40,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:49:40,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [] total 23 [2021-11-02 12:49:40,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336278861] [2021-11-02 12:49:40,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-02 12:49:40,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:49:40,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-02 12:49:40,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2021-11-02 12:49:40,452 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:49:42,665 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:49:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:49:47,100 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2021-11-02 12:49:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 12:49:47,101 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-02 12:49:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:49:47,102 INFO L225 Difference]: With dead ends: 133 [2021-11-02 12:49:47,102 INFO L226 Difference]: Without dead ends: 131 [2021-11-02 12:49:47,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 3471.56ms TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2021-11-02 12:49:47,103 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5363.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.36ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 5634.88ms IncrementalHoareTripleChecker+Time [2021-11-02 12:49:47,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 718 Unknown, 0 Unchecked, 5.36ms Time], IncrementalHoareTripleChecker [7 Valid, 362 Invalid, 1 Unknown, 348 Unchecked, 5634.88ms Time] [2021-11-02 12:49:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-02 12:49:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2021-11-02 12:49:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 109 states have (on average 1.146788990825688) internal successors, (125), 114 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:49:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2021-11-02 12:49:47,106 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 36 [2021-11-02 12:49:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:49:47,107 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2021-11-02 12:49:47,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:49:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2021-11-02 12:49:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:49:47,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:49:47,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] [2021-11-02 12:49:47,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-02 12:49:47,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:49:47,317 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:49:47,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:49:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash -869409000, now seen corresponding path program 1 times [2021-11-02 12:49:47,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:49:47,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593118344] [2021-11-02 12:49:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:49:47,321 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:49:47,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:49:47,322 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:49:47,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-02 12:49:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:49:49,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-02 12:49:49,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:49:51,101 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-02 12:49:51,102 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 74 treesize of output 54 [2021-11-02 12:49:51,111 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-02 12:49:51,111 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 40 treesize of output 20 [2021-11-02 12:49:51,267 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-02 12:49:51,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:50:01,398 WARN L210 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2021-11-02 12:50:01,398 INFO L354 Elim1Store]: treesize reduction 23, result has 50.0 percent of original size [2021-11-02 12:50:01,398 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 72 treesize of output 70 [2021-11-02 12:50:01,534 INFO L354 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2021-11-02 12:50:01,534 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 62 treesize of output 52 [2021-11-02 12:50:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:50:01,763 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:50:01,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593118344] [2021-11-02 12:50:01,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593118344] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:01,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:01,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 18 [2021-11-02 12:50:01,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843165865] [2021-11-02 12:50:01,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-02 12:50:01,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:50:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-02 12:50:01,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-11-02 12:50:01,764 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:03,990 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:50:07,817 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-11-02 12:50:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 12:50:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-02 12:50:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:50:07,818 INFO L225 Difference]: With dead ends: 157 [2021-11-02 12:50:07,818 INFO L226 Difference]: Without dead ends: 115 [2021-11-02 12:50:07,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2551.45ms TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-11-02 12:50:07,819 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4815.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.00ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 5068.77ms IncrementalHoareTripleChecker+Time [2021-11-02 12:50:07,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 763 Unknown, 0 Unchecked, 5.00ms Time], IncrementalHoareTripleChecker [7 Valid, 488 Invalid, 1 Unknown, 267 Unchecked, 5068.77ms Time] [2021-11-02 12:50:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-02 12:50:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-11-02 12:50:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 114 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2021-11-02 12:50:07,823 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 36 [2021-11-02 12:50:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:50:07,823 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2021-11-02 12:50:07,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2021-11-02 12:50:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:50:07,824 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:50:07,824 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] [2021-11-02 12:50:07,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-11-02 12:50:08,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:50:08,040 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:50:08,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:50:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash -611243562, now seen corresponding path program 1 times [2021-11-02 12:50:08,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:50:08,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796767250] [2021-11-02 12:50:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:50:08,043 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:50:08,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:50:08,044 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:50:08,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-02 12:50:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:50:10,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-02 12:50:10,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:50:11,532 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-02 12:50:11,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 35 [2021-11-02 12:50:11,711 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-02 12:50:11,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:50:13,724 INFO L354 Elim1Store]: treesize reduction 94, result has 49.7 percent of original size [2021-11-02 12:50:13,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 118 [2021-11-02 12:50:15,859 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-02 12:50:15,859 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:50:15,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796767250] [2021-11-02 12:50:15,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796767250] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:15,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:15,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 18 [2021-11-02 12:50:15,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626838463] [2021-11-02 12:50:15,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-02 12:50:15,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:50:15,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-02 12:50:15,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-11-02 12:50:15,861 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:18,081 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:50:21,781 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2021-11-02 12:50:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 12:50:21,781 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-02 12:50:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:50:21,782 INFO L225 Difference]: With dead ends: 168 [2021-11-02 12:50:21,782 INFO L226 Difference]: Without dead ends: 124 [2021-11-02 12:50:21,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2243.85ms TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2021-11-02 12:50:21,783 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4790.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.04ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 5078.91ms IncrementalHoareTripleChecker+Time [2021-11-02 12:50:21,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 903 Unknown, 0 Unchecked, 7.04ms Time], IncrementalHoareTripleChecker [11 Valid, 588 Invalid, 1 Unknown, 303 Unchecked, 5078.91ms Time] [2021-11-02 12:50:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-02 12:50:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2021-11-02 12:50:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.1214953271028036) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-11-02 12:50:21,787 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 36 [2021-11-02 12:50:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:50:21,788 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-11-02 12:50:21,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-11-02 12:50:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:50:21,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:50:21,789 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] [2021-11-02 12:50:21,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-02 12:50:22,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:50:22,001 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:50:22,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:50:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1992548114, now seen corresponding path program 1 times [2021-11-02 12:50:22,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:50:22,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615865121] [2021-11-02 12:50:22,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:50:22,006 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:50:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:50:22,007 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:50:22,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-02 12:50:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:50:24,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-02 12:50:24,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:50:25,345 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-02 12:50:25,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 35 [2021-11-02 12:50:25,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-02 12:50:25,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:50:27,391 INFO L354 Elim1Store]: treesize reduction 124, result has 42.9 percent of original size [2021-11-02 12:50:27,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 118 [2021-11-02 12:50:29,643 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-02 12:50:29,643 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:50:29,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615865121] [2021-11-02 12:50:29,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615865121] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:29,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:29,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 15 [2021-11-02 12:50:29,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686410972] [2021-11-02 12:50:29,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 12:50:29,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:50:29,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 12:50:29,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-11-02 12:50:29,645 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:31,868 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:50:33,607 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2021-11-02 12:50:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:50:33,608 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-02 12:50:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:50:33,608 INFO L225 Difference]: With dead ends: 159 [2021-11-02 12:50:33,608 INFO L226 Difference]: Without dead ends: 113 [2021-11-02 12:50:33,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1360.83ms TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:50:33,609 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3517.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.61ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 3695.31ms IncrementalHoareTripleChecker+Time [2021-11-02 12:50:33,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 569 Unknown, 0 Unchecked, 3.61ms Time], IncrementalHoareTripleChecker [5 Valid, 330 Invalid, 1 Unknown, 233 Unchecked, 3695.31ms Time] [2021-11-02 12:50:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-02 12:50:33,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-11-02 12:50:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.1121495327102804) internal successors, (119), 112 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2021-11-02 12:50:33,612 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 36 [2021-11-02 12:50:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:50:33,612 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2021-11-02 12:50:33,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2021-11-02 12:50:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 12:50:33,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:50:33,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:50:33,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-02 12:50:33,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:50:33,814 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:50:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:50:33,814 INFO L85 PathProgramCache]: Analyzing trace with hash 280712196, now seen corresponding path program 1 times [2021-11-02 12:50:33,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:50:33,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114876211] [2021-11-02 12:50:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:50:33,817 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:50:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:50:33,819 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:50:33,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-02 12:50:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:50:36,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-02 12:50:36,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:50:36,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-02 12:50:36,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-02 12:50:37,265 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-02 12:50:37,266 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 97 treesize of output 67 [2021-11-02 12:50:37,274 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-02 12:50:37,275 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 53 treesize of output 23 [2021-11-02 12:50:37,329 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-02 12:50:37,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:50:38,293 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-02 12:50:38,293 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:50:38,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114876211] [2021-11-02 12:50:38,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114876211] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:38,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:38,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2021-11-02 12:50:38,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275452699] [2021-11-02 12:50:38,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:50:38,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:50:38,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:50:38,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:50:38,295 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:40,523 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:50:42,937 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2021-11-02 12:50:42,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:50:42,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-02 12:50:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:50:42,938 INFO L225 Difference]: With dead ends: 113 [2021-11-02 12:50:42,938 INFO L226 Difference]: Without dead ends: 111 [2021-11-02 12:50:42,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 793.33ms TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:50:42,939 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4055.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.77ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 4302.51ms IncrementalHoareTripleChecker+Time [2021-11-02 12:50:42,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 443 Unknown, 0 Unchecked, 2.77ms Time], IncrementalHoareTripleChecker [6 Valid, 292 Invalid, 1 Unknown, 144 Unchecked, 4302.51ms Time] [2021-11-02 12:50:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-02 12:50:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-11-02 12:50:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.1037735849056605) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2021-11-02 12:50:42,944 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 38 [2021-11-02 12:50:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:50:42,944 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2021-11-02 12:50:42,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2021-11-02 12:50:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 12:50:42,944 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:50:42,945 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-02 12:50:42,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-11-02 12:50:43,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:50:43,163 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:50:43,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:50:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash 399724621, now seen corresponding path program 1 times [2021-11-02 12:50:43,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:50:43,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796253286] [2021-11-02 12:50:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:50:43,167 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:50:43,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:50:43,168 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:50:43,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-02 12:50:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:50:45,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-02 12:50:45,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:50:47,133 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-02 12:50:47,134 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 59 treesize of output 39 [2021-11-02 12:50:47,142 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-02 12:50:47,143 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 33 treesize of output 13 [2021-11-02 12:50:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:50:47,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:50:57,348 WARN L210 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2021-11-02 12:50:57,348 INFO L354 Elim1Store]: treesize reduction 23, result has 50.0 percent of original size [2021-11-02 12:50:57,349 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 72 treesize of output 70 [2021-11-02 12:50:57,487 INFO L354 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2021-11-02 12:50:57,488 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 62 treesize of output 52 [2021-11-02 12:50:57,715 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-02 12:50:57,715 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:50:57,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796253286] [2021-11-02 12:50:57,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796253286] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:57,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:57,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 16 [2021-11-02 12:50:57,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263510317] [2021-11-02 12:50:57,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 12:50:57,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:50:57,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 12:50:57,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-02 12:50:57,717 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:50:59,948 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:51:03,493 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2021-11-02 12:51:03,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 12:51:03,494 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-02 12:51:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:51:03,494 INFO L225 Difference]: With dead ends: 140 [2021-11-02 12:51:03,494 INFO L226 Difference]: Without dead ends: 102 [2021-11-02 12:51:03,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2157.36ms TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-11-02 12:51:03,495 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4748.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.16ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 5005.16ms IncrementalHoareTripleChecker+Time [2021-11-02 12:51:03,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 529 Unknown, 0 Unchecked, 3.16ms Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 1 Unknown, 213 Unchecked, 5005.16ms Time] [2021-11-02 12:51:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-02 12:51:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2021-11-02 12:51:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 83 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-02 12:51:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-11-02 12:51:03,498 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 41 [2021-11-02 12:51:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:51:03,498 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-11-02 12:51:03,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:51:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-11-02 12:51:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 12:51:03,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:51:03,499 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] [2021-11-02 12:51:03,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-11-02 12:51:03,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:51:03,700 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:51:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:51:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1999613423, now seen corresponding path program 1 times [2021-11-02 12:51:03,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:51:03,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511281572] [2021-11-02 12:51:03,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:51:03,704 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:51:03,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:51:03,705 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:51:03,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-02 12:51:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:51:05,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 12:51:05,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:51:07,342 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-02 12:51:07,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 35 [2021-11-02 12:51:07,458 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-02 12:51:07,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:51:09,686 INFO L354 Elim1Store]: treesize reduction 150, result has 30.9 percent of original size [2021-11-02 12:51:09,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 98 [2021-11-02 12:51:10,937 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-02 12:51:10,937 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:51:10,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511281572] [2021-11-02 12:51:10,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511281572] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:51:10,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:51:10,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 19 [2021-11-02 12:51:10,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582848531] [2021-11-02 12:51:10,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-02 12:51:10,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:51:10,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-02 12:51:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-11-02 12:51:10,938 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:51:13,159 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:51:15,858 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2021-11-02 12:51:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 12:51:15,859 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-02 12:51:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:51:15,859 INFO L225 Difference]: With dead ends: 123 [2021-11-02 12:51:15,859 INFO L226 Difference]: Without dead ends: 73 [2021-11-02 12:51:15,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2518.74ms TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2021-11-02 12:51:15,860 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3823.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.74ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 4031.85ms IncrementalHoareTripleChecker+Time [2021-11-02 12:51:15,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 588 Unknown, 0 Unchecked, 3.74ms Time], IncrementalHoareTripleChecker [7 Valid, 283 Invalid, 1 Unknown, 297 Unchecked, 4031.85ms Time] [2021-11-02 12:51:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-02 12:51:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-11-02 12:51:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 72 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-02 12:51:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-11-02 12:51:15,863 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 42 [2021-11-02 12:51:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:51:15,863 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-11-02 12:51:15,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:51:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-11-02 12:51:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 12:51:15,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:51:15,864 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] [2021-11-02 12:51:15,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-11-02 12:51:16,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:51:16,092 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-02 12:51:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:51:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1417570751, now seen corresponding path program 1 times [2021-11-02 12:51:16,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:51:16,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057010931] [2021-11-02 12:51:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:51:16,095 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:51:16,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:51:16,096 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:51:16,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-02 12:51:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:51:18,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-02 12:51:18,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:51:20,334 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-02 12:51:20,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 58 [2021-11-02 12:51:20,530 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-02 12:51:20,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:51:29,950 WARN L210 SmtUtils]: Spent 7.31s on a formula simplification. DAG size of input: 298 DAG size of output: 180 [2021-11-02 12:51:29,951 INFO L354 Elim1Store]: treesize reduction 394, result has 54.8 percent of original size [2021-11-02 12:51:29,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 133 treesize of output 517 Killed by 15