./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_eq_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_array_eq_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 c9f60659fbb0886b2c3c86084c4cc81dbedd027936fc1dda43226ecbc4710056 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 12:09:24,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 12:09:24,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 12:09:24,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 12:09:24,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 12:09:25,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 12:09:25,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 12:09:25,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 12:09:25,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 12:09:25,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 12:09:25,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 12:09:25,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 12:09:25,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 12:09:25,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 12:09:25,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 12:09:25,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 12:09:25,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 12:09:25,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 12:09:25,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 12:09:25,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 12:09:25,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 12:09:25,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 12:09:25,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 12:09:25,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 12:09:25,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 12:09:25,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 12:09:25,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 12:09:25,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 12:09:25,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 12:09:25,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 12:09:25,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 12:09:25,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 12:09:25,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 12:09:25,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 12:09:25,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 12:09:25,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 12:09:25,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 12:09:25,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 12:09:25,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 12:09:25,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 12:09:25,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 12:09:25,034 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:09:25,047 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 12:09:25,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 12:09:25,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 12:09:25,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 12:09:25,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 12:09:25,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 12:09:25,048 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 12:09:25,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 12:09:25,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 12:09:25,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 12:09:25,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 12:09:25,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 12:09:25,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 12:09:25,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 12:09:25,049 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 12:09:25,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 12:09:25,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 12:09:25,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 12:09:25,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 12:09:25,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:09:25,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 12:09:25,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 12:09:25,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 12:09:25,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 12:09:25,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 12:09:25,051 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 12:09:25,051 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 12:09:25,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 12:09:25,051 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 12:09:25,051 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 -> c9f60659fbb0886b2c3c86084c4cc81dbedd027936fc1dda43226ecbc4710056 [2021-11-02 12:09:25,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 12:09:25,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 12:09:25,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 12:09:25,210 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 12:09:25,211 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 12:09:25,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i [2021-11-02 12:09:25,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc68a86c/e8f691c508fc4ba8a6c8260bb4a13aa1/FLAG7d1ff531d [2021-11-02 12:09:25,829 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 12:09:25,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i [2021-11-02 12:09:25,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc68a86c/e8f691c508fc4ba8a6c8260bb4a13aa1/FLAG7d1ff531d [2021-11-02 12:09:26,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc68a86c/e8f691c508fc4ba8a6c8260bb4a13aa1 [2021-11-02 12:09:26,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 12:09:26,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 12:09:26,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 12:09:26,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 12:09:26,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 12:09:26,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:09:26" (1/1) ... [2021-11-02 12:09:26,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d10cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:26, skipping insertion in model container [2021-11-02 12:09:26,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:09:26" (1/1) ... [2021-11-02 12:09:26,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 12:09:26,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 12:09:26,547 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_array_eq_harness.i[4486,4499] [2021-11-02 12:09:26,550 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_array_eq_harness.i[4546,4559] [2021-11-02 12:09:26,561 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:09:26,563 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:09:27,103 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,104 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,104 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,104 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,105 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,114 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,114 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,115 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,116 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,312 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:09:27,313 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:09:27,313 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:09:27,314 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:09:27,315 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:09:27,315 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:09:27,316 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:09:27,316 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:09:27,316 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:09:27,317 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:09:27,422 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:09:27,482 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,482 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:09:27,593 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 12:09:27,610 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_array_eq_harness.i[4486,4499] [2021-11-02 12:09:27,612 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_array_eq_harness.i[4546,4559] [2021-11-02 12:09:27,614 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:09:27,615 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:09:27,646 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,647 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,647 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,647 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,649 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,661 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,661 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,662 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,662 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,697 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:09:27,698 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:09:27,698 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:09:27,699 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:09:27,699 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:09:27,700 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:09:27,700 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:09:27,700 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:09:27,700 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:09:27,701 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:09:27,718 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:09:27,760 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,760 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:09:27,992 INFO L208 MainTranslator]: Completed translation [2021-11-02 12:09:27,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:27 WrapperNode [2021-11-02 12:09:27,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 12:09:27,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 12:09:27,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 12:09:27,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 12:09:27,999 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:09:27" (1/1) ... [2021-11-02 12:09:28,138 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:09:27" (1/1) ... [2021-11-02 12:09:28,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 12:09:28,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 12:09:28,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 12:09:28,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 12:09:28,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:27" (1/1) ... [2021-11-02 12:09:28,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:27" (1/1) ... [2021-11-02 12:09:28,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:27" (1/1) ... [2021-11-02 12:09:28,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:27" (1/1) ... [2021-11-02 12:09:28,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:27" (1/1) ... [2021-11-02 12:09:28,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:27" (1/1) ... [2021-11-02 12:09:28,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:27" (1/1) ... [2021-11-02 12:09:28,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 12:09:28,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 12:09:28,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 12:09:28,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 12:09:28,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:27" (1/1) ... [2021-11-02 12:09:28,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:09:28,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:09:28,445 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:09:28,472 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:09:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-02 12:09:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 12:09:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 12:09:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 12:09:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 12:09:28,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 12:09:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 12:09:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 12:09:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 12:09:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 12:09:32,901 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 12:09:32,901 INFO L299 CfgBuilder]: Removed 70 assume(true) statements. [2021-11-02 12:09:32,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:09:32 BoogieIcfgContainer [2021-11-02 12:09:32,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 12:09:32,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 12:09:32,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 12:09:32,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 12:09:32,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:09:26" (1/3) ... [2021-11-02 12:09:32,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a314d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:09:32, skipping insertion in model container [2021-11-02 12:09:32,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:27" (2/3) ... [2021-11-02 12:09:32,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a314d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:09:32, skipping insertion in model container [2021-11-02 12:09:32,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:09:32" (3/3) ... [2021-11-02 12:09:32,908 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_eq_harness.i [2021-11-02 12:09:32,911 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 12:09:32,911 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-02 12:09:32,938 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 12:09:32,942 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:09:32,942 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-02 12:09:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 70 states have (on average 1.5) internal successors, (105), 75 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:09:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-02 12:09:32,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:32,955 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:09:32,955 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:09:32,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1732530516, now seen corresponding path program 1 times [2021-11-02 12:09:32,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:32,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922997032] [2021-11-02 12:09:32,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:32,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:33,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:33,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922997032] [2021-11-02 12:09:33,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922997032] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:33,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:33,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 12:09:33,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017176997] [2021-11-02 12:09:33,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 12:09:33,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:33,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 12:09:33,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:09:33,420 INFO L87 Difference]: Start difference. First operand has 76 states, 70 states have (on average 1.5) internal successors, (105), 75 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) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:09:35,494 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:09:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:36,080 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2021-11-02 12:09:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 12:09:36,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-11-02 12:09:36,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:36,089 INFO L225 Difference]: With dead ends: 149 [2021-11-02 12:09:36,089 INFO L226 Difference]: Without dead ends: 70 [2021-11-02 12:09:36,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:09:36,093 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2364.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.81ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2617.39ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:36,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 89 Unknown, 0 Unchecked, 1.81ms Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 2617.39ms Time] [2021-11-02 12:09:36,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-02 12:09:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-11-02 12:09:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 69 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2021-11-02 12:09:36,119 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 27 [2021-11-02 12:09:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:36,119 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2021-11-02 12:09:36,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:09:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2021-11-02 12:09:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-02 12:09:36,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:36,121 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] [2021-11-02 12:09:36,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 12:09:36,121 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:09:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:36,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1816035494, now seen corresponding path program 1 times [2021-11-02 12:09:36,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:36,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309452212] [2021-11-02 12:09:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:36,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:36,484 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:09:36,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:36,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309452212] [2021-11-02 12:09:36,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309452212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:36,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:36,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:09:36,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44071090] [2021-11-02 12:09:36,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:09:36,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:09:36,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:09:36,487 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:09:38,535 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:09:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:39,656 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2021-11-02 12:09:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:09:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-11-02 12:09:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:39,657 INFO L225 Difference]: With dead ends: 174 [2021-11-02 12:09:39,658 INFO L226 Difference]: Without dead ends: 146 [2021-11-02 12:09:39,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.55ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:09:39,659 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2812.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.62ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3094.46ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:39,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 270 Unknown, 0 Unchecked, 8.62ms Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 1 Unknown, 0 Unchecked, 3094.46ms Time] [2021-11-02 12:09:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-02 12:09:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2021-11-02 12:09:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.2142857142857142) 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:09:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2021-11-02 12:09:39,667 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 27 [2021-11-02 12:09:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:39,667 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2021-11-02 12:09:39,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:09:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2021-11-02 12:09:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-02 12:09:39,671 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:39,671 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] [2021-11-02 12:09:39,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 12:09:39,671 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:09:39,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash 515997540, now seen corresponding path program 1 times [2021-11-02 12:09:39,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:39,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151486595] [2021-11-02 12:09:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:39,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:40,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:40,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151486595] [2021-11-02 12:09:40,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151486595] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:40,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:40,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:09:40,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776669164] [2021-11-02 12:09:40,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:09:40,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:09:40,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:09:40,084 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:09:42,133 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:09:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:43,248 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2021-11-02 12:09:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:09:43,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-11-02 12:09:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:43,250 INFO L225 Difference]: With dead ends: 122 [2021-11-02 12:09:43,250 INFO L226 Difference]: Without dead ends: 120 [2021-11-02 12:09:43,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.22ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:09:43,251 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2821.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.69ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3101.14ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:43,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 249 Unknown, 0 Unchecked, 4.69ms Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 1 Unknown, 0 Unchecked, 3101.14ms Time] [2021-11-02 12:09:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-02 12:09:43,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2021-11-02 12:09:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 92 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:09:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2021-11-02 12:09:43,260 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 28 [2021-11-02 12:09:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:43,261 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2021-11-02 12:09:43,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:09:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2021-11-02 12:09:43,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-02 12:09:43,262 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:43,262 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] [2021-11-02 12:09:43,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 12:09:43,262 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:09:43,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:43,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1952527688, now seen corresponding path program 1 times [2021-11-02 12:09:43,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:43,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847440938] [2021-11-02 12:09:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:43,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:43,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:43,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847440938] [2021-11-02 12:09:43,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847440938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:43,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:43,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 12:09:43,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639982548] [2021-11-02 12:09:43,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:09:43,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:43,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:09:43,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:09:43,617 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:09:45,672 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:09:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:47,088 INFO L93 Difference]: Finished difference Result 267 states and 310 transitions. [2021-11-02 12:09:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 12:09:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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 30 [2021-11-02 12:09:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:47,090 INFO L225 Difference]: With dead ends: 267 [2021-11-02 12:09:47,090 INFO L226 Difference]: Without dead ends: 245 [2021-11-02 12:09:47,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 153.99ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:09:47,091 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3080.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.41ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3369.17ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:47,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 452 Unknown, 0 Unchecked, 7.41ms Time], IncrementalHoareTripleChecker [7 Valid, 444 Invalid, 1 Unknown, 0 Unchecked, 3369.17ms Time] [2021-11-02 12:09:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-02 12:09:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 154. [2021-11-02 12:09:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.2147651006711409) internal successors, (181), 153 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:09:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2021-11-02 12:09:47,129 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 30 [2021-11-02 12:09:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:47,129 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2021-11-02 12:09:47,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:09:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2021-11-02 12:09:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-02 12:09:47,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:47,131 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] [2021-11-02 12:09:47,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 12:09:47,131 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:09:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:47,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1832182561, now seen corresponding path program 1 times [2021-11-02 12:09:47,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:47,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650079420] [2021-11-02 12:09:47,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:47,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:47,416 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:09:47,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:47,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650079420] [2021-11-02 12:09:47,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650079420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:47,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:47,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:09:47,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329253408] [2021-11-02 12:09:47,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:09:47,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:47,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:09:47,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:09:47,417 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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:09:49,458 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:09:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:51,487 INFO L93 Difference]: Finished difference Result 241 states and 279 transitions. [2021-11-02 12:09:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:09:51,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 31 [2021-11-02 12:09:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:51,489 INFO L225 Difference]: With dead ends: 241 [2021-11-02 12:09:51,489 INFO L226 Difference]: Without dead ends: 209 [2021-11-02 12:09:51,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 267.95ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:09:51,490 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3538.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.71ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3839.76ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:51,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 569 Unknown, 0 Unchecked, 9.71ms Time], IncrementalHoareTripleChecker [7 Valid, 561 Invalid, 1 Unknown, 0 Unchecked, 3839.76ms Time] [2021-11-02 12:09:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-02 12:09:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2021-11-02 12:09:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.2192513368983957) internal successors, (228), 191 states have internal predecessors, (228), 0 states have call successors, (0), 0 states 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:09:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 228 transitions. [2021-11-02 12:09:51,504 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 228 transitions. Word has length 31 [2021-11-02 12:09:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:51,519 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 228 transitions. [2021-11-02 12:09:51,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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:09:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 228 transitions. [2021-11-02 12:09:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-02 12:09:51,521 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:51,521 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] [2021-11-02 12:09:51,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 12:09:51,521 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:09:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1532986451, now seen corresponding path program 1 times [2021-11-02 12:09:51,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:51,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858545021] [2021-11-02 12:09:51,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:51,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:51,813 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:09:51,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:51,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858545021] [2021-11-02 12:09:51,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858545021] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:51,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:51,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:09:51,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667607414] [2021-11-02 12:09:51,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:09:51,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:09:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:09:51,814 INFO L87 Difference]: Start difference. First operand 192 states and 228 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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:09:53,853 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:09:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:54,420 INFO L93 Difference]: Finished difference Result 252 states and 301 transitions. [2021-11-02 12:09:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:09:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 33 [2021-11-02 12:09:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:54,422 INFO L225 Difference]: With dead ends: 252 [2021-11-02 12:09:54,422 INFO L226 Difference]: Without dead ends: 218 [2021-11-02 12:09:54,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.66ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:09:54,423 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2472.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.00ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2588.07ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:54,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 203 Unknown, 0 Unchecked, 2.00ms Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 1 Unknown, 0 Unchecked, 2588.07ms Time] [2021-11-02 12:09:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-02 12:09:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 195. [2021-11-02 12:09:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.2210526315789474) internal successors, (232), 194 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2021-11-02 12:09:54,429 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 33 [2021-11-02 12:09:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:54,429 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2021-11-02 12:09:54,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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:09:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2021-11-02 12:09:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-02 12:09:54,430 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:54,430 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] [2021-11-02 12:09:54,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 12:09:54,431 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:09:54,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 242020911, now seen corresponding path program 1 times [2021-11-02 12:09:54,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:54,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758857549] [2021-11-02 12:09:54,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:54,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:55,059 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:09:55,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:55,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758857549] [2021-11-02 12:09:55,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758857549] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:55,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:55,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 12:09:55,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818161297] [2021-11-02 12:09:55,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:09:55,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:55,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:09:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:09:55,060 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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:09:57,114 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:10:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:00,734 INFO L93 Difference]: Finished difference Result 379 states and 441 transitions. [2021-11-02 12:10:00,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 12:10:00,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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 33 [2021-11-02 12:10:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:00,736 INFO L225 Difference]: With dead ends: 379 [2021-11-02 12:10:00,736 INFO L226 Difference]: Without dead ends: 295 [2021-11-02 12:10:00,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 799.95ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-11-02 12:10:00,740 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 638 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4629.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.34ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5043.90ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:00,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 0 Invalid, 1056 Unknown, 0 Unchecked, 15.34ms Time], IncrementalHoareTripleChecker [26 Valid, 1029 Invalid, 1 Unknown, 0 Unchecked, 5043.90ms Time] [2021-11-02 12:10:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-02 12:10:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 201. [2021-11-02 12:10:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.2040816326530612) internal successors, (236), 200 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 236 transitions. [2021-11-02 12:10:00,749 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 236 transitions. Word has length 33 [2021-11-02 12:10:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:00,750 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 236 transitions. [2021-11-02 12:10:00,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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:10:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 236 transitions. [2021-11-02 12:10:00,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-02 12:10:00,751 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:00,751 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] [2021-11-02 12:10:00,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 12:10:00,751 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:10:00,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:00,752 INFO L85 PathProgramCache]: Analyzing trace with hash -358833571, now seen corresponding path program 1 times [2021-11-02 12:10:00,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:00,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554094259] [2021-11-02 12:10:00,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:00,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:00,960 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:10:00,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:00,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554094259] [2021-11-02 12:10:00,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554094259] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:00,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:00,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:10:00,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324622468] [2021-11-02 12:10:00,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:10:00,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:00,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:10:00,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:10:00,962 INFO L87 Difference]: Start difference. First operand 201 states and 236 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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:10:03,006 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:10:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:03,746 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2021-11-02 12:10:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:10:03,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 33 [2021-11-02 12:10:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:03,748 INFO L225 Difference]: With dead ends: 266 [2021-11-02 12:10:03,748 INFO L226 Difference]: Without dead ends: 222 [2021-11-02 12:10:03,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.79ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:10:03,748 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2614.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.02ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2746.17ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:03,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 255 Unknown, 0 Unchecked, 2.02ms Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 1 Unknown, 0 Unchecked, 2746.17ms Time] [2021-11-02 12:10:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-02 12:10:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 207. [2021-11-02 12:10:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.193069306930693) internal successors, (241), 206 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2021-11-02 12:10:03,754 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 33 [2021-11-02 12:10:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:03,754 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2021-11-02 12:10:03,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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:10:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2021-11-02 12:10:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-02 12:10:03,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:03,767 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:10:03,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 12:10:03,767 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:10:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1814533261, now seen corresponding path program 1 times [2021-11-02 12:10:03,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:03,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969414440] [2021-11-02 12:10:03,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:03,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:10:04,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:04,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969414440] [2021-11-02 12:10:04,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969414440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:04,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:04,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 12:10:04,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113308759] [2021-11-02 12:10:04,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:10:04,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:04,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:10:04,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:10:04,075 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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:10:06,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:07,448 INFO L93 Difference]: Finished difference Result 225 states and 260 transitions. [2021-11-02 12:10:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:10:07,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 34 [2021-11-02 12:10:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:07,449 INFO L225 Difference]: With dead ends: 225 [2021-11-02 12:10:07,449 INFO L226 Difference]: Without dead ends: 198 [2021-11-02 12:10:07,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 86.61ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:10:07,450 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3108.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.58ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3324.10ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:07,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 287 Unknown, 0 Unchecked, 2.58ms Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 1 Unknown, 0 Unchecked, 3324.10ms Time] [2021-11-02 12:10:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-02 12:10:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2021-11-02 12:10:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.1704545454545454) internal successors, (206), 179 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:10:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2021-11-02 12:10:07,454 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 34 [2021-11-02 12:10:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:07,454 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2021-11-02 12:10:07,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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:10:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2021-11-02 12:10:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 12:10:07,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:07,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:10:07,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 12:10:07,455 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:10:07,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1013590275, now seen corresponding path program 1 times [2021-11-02 12:10:07,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:07,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612279436] [2021-11-02 12:10:07,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:07,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:09,874 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:10:09,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:09,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612279436] [2021-11-02 12:10:09,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612279436] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:09,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:09,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 12:10:09,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815876130] [2021-11-02 12:10:09,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 12:10:09,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 12:10:09,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:10:09,875 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:11,984 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:14,074 INFO L93 Difference]: Finished difference Result 218 states and 246 transitions. [2021-11-02 12:10:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 12:10:14,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-02 12:10:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:14,076 INFO L225 Difference]: With dead ends: 218 [2021-11-02 12:10:14,076 INFO L226 Difference]: Without dead ends: 216 [2021-11-02 12:10:14,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 405.04ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-11-02 12:10:14,077 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 326 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3614.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.24ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3923.16ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:14,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 0 Invalid, 600 Unknown, 0 Unchecked, 7.24ms Time], IncrementalHoareTripleChecker [6 Valid, 593 Invalid, 1 Unknown, 0 Unchecked, 3923.16ms Time] [2021-11-02 12:10:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-02 12:10:14,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 180. [2021-11-02 12:10:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.1590909090909092) internal successors, (204), 179 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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:10:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 204 transitions. [2021-11-02 12:10:14,081 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 204 transitions. Word has length 39 [2021-11-02 12:10:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:14,082 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 204 transitions. [2021-11-02 12:10:14,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 204 transitions. [2021-11-02 12:10:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 12:10:14,082 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:14,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:10:14,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 12:10:14,083 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:10:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1059303570, now seen corresponding path program 1 times [2021-11-02 12:10:14,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:14,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755320861] [2021-11-02 12:10:14,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:14,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:18,442 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:10:18,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:18,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755320861] [2021-11-02 12:10:18,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755320861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:18,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:18,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-02 12:10:18,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776663326] [2021-11-02 12:10:18,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 12:10:18,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 12:10:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-02 12:10:18,443 INFO L87 Difference]: Start difference. First operand 180 states and 204 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:20,487 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:26,233 INFO L93 Difference]: Finished difference Result 227 states and 252 transitions. [2021-11-02 12:10:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 12:10:26,234 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-02 12:10:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:26,234 INFO L225 Difference]: With dead ends: 227 [2021-11-02 12:10:26,234 INFO L226 Difference]: Without dead ends: 225 [2021-11-02 12:10:26,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 2375.28ms TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2021-11-02 12:10:26,235 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 375 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5604.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.06ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6042.11ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:26,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 0 Invalid, 1486 Unknown, 0 Unchecked, 16.06ms Time], IncrementalHoareTripleChecker [30 Valid, 1455 Invalid, 1 Unknown, 0 Unchecked, 6042.11ms Time] [2021-11-02 12:10:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-02 12:10:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 182. [2021-11-02 12:10:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 178 states have (on average 1.1629213483146068) internal successors, (207), 181 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:10:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 207 transitions. [2021-11-02 12:10:26,240 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 207 transitions. Word has length 39 [2021-11-02 12:10:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:26,240 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 207 transitions. [2021-11-02 12:10:26,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2021-11-02 12:10:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 12:10:26,241 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:26,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:10:26,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 12:10:26,241 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:10:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1520474377, now seen corresponding path program 1 times [2021-11-02 12:10:26,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:26,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243017298] [2021-11-02 12:10:26,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:26,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:10:26,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:26,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243017298] [2021-11-02 12:10:26,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243017298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:26,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:26,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 12:10:26,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006465263] [2021-11-02 12:10:26,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 12:10:26,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:26,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 12:10:26,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:10:26,559 INFO L87 Difference]: Start difference. First operand 182 states and 207 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:28,598 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:10:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:30,871 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2021-11-02 12:10:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 12:10:30,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-02 12:10:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:30,873 INFO L225 Difference]: With dead ends: 247 [2021-11-02 12:10:30,873 INFO L226 Difference]: Without dead ends: 224 [2021-11-02 12:10:30,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 366.93ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:10:30,874 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 367 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3806.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.05ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4054.58ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:30,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 0 Invalid, 661 Unknown, 0 Unchecked, 7.05ms Time], IncrementalHoareTripleChecker [4 Valid, 656 Invalid, 1 Unknown, 0 Unchecked, 4054.58ms Time] [2021-11-02 12:10:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-02 12:10:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 197. [2021-11-02 12:10:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 193 states have (on average 1.1554404145077721) internal successors, (223), 196 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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:10:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 223 transitions. [2021-11-02 12:10:30,880 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 223 transitions. Word has length 39 [2021-11-02 12:10:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:30,880 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 223 transitions. [2021-11-02 12:10:30,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 223 transitions. [2021-11-02 12:10:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 12:10:30,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:30,881 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:10:30,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 12:10:30,881 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:10:30,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 94110528, now seen corresponding path program 1 times [2021-11-02 12:10:30,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:30,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278718913] [2021-11-02 12:10:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:30,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:10:31,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:31,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278718913] [2021-11-02 12:10:31,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278718913] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:31,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:31,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 12:10:31,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792306513] [2021-11-02 12:10:31,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:10:31,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:31,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:10:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:10:31,388 INFO L87 Difference]: Start difference. First operand 197 states and 223 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:33,508 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:35,600 INFO L93 Difference]: Finished difference Result 245 states and 272 transitions. [2021-11-02 12:10:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 12:10:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-02 12:10:35,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:35,601 INFO L225 Difference]: With dead ends: 245 [2021-11-02 12:10:35,601 INFO L226 Difference]: Without dead ends: 240 [2021-11-02 12:10:35,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 679.83ms TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-11-02 12:10:35,602 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3473.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.44ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3739.42ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:35,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 0 Invalid, 541 Unknown, 0 Unchecked, 5.44ms Time], IncrementalHoareTripleChecker [7 Valid, 533 Invalid, 1 Unknown, 0 Unchecked, 3739.42ms Time] [2021-11-02 12:10:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-02 12:10:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 197. [2021-11-02 12:10:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 193 states have (on average 1.145077720207254) internal successors, (221), 196 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:10:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 221 transitions. [2021-11-02 12:10:35,608 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 221 transitions. Word has length 41 [2021-11-02 12:10:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:35,608 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 221 transitions. [2021-11-02 12:10:35,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 221 transitions. [2021-11-02 12:10:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 12:10:35,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:35,608 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:10:35,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 12:10:35,609 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:10:35,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:35,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1947021686, now seen corresponding path program 1 times [2021-11-02 12:10:35,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:35,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136180724] [2021-11-02 12:10:35,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:35,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:39,561 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:10:39,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:39,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136180724] [2021-11-02 12:10:39,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136180724] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:39,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:39,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 12:10:39,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029180017] [2021-11-02 12:10:39,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 12:10:39,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:39,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 12:10:39,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:10:39,562 INFO L87 Difference]: Start difference. First operand 197 states and 221 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:41,737 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:46,305 INFO L93 Difference]: Finished difference Result 273 states and 300 transitions. [2021-11-02 12:10:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-02 12:10:46,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-02 12:10:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:46,306 INFO L225 Difference]: With dead ends: 273 [2021-11-02 12:10:46,306 INFO L226 Difference]: Without dead ends: 259 [2021-11-02 12:10:46,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1671.70ms TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2021-11-02 12:10:46,307 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 371 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4923.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.65ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5422.29ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:46,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 0 Invalid, 1063 Unknown, 0 Unchecked, 9.65ms Time], IncrementalHoareTripleChecker [26 Valid, 1036 Invalid, 1 Unknown, 0 Unchecked, 5422.29ms Time] [2021-11-02 12:10:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-02 12:10:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 217. [2021-11-02 12:10:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 213 states have (on average 1.1267605633802817) internal successors, (240), 216 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:10:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 240 transitions. [2021-11-02 12:10:46,313 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 240 transitions. Word has length 41 [2021-11-02 12:10:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:46,314 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 240 transitions. [2021-11-02 12:10:46,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 240 transitions. [2021-11-02 12:10:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 12:10:46,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:46,314 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:10:46,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 12:10:46,315 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:10:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash -27102983, now seen corresponding path program 1 times [2021-11-02 12:10:46,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:46,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587398208] [2021-11-02 12:10:46,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:46,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:47,020 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:10:47,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:47,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587398208] [2021-11-02 12:10:47,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587398208] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:47,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:47,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 12:10:47,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060593958] [2021-11-02 12:10:47,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 12:10:47,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:47,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 12:10:47,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:10:47,021 INFO L87 Difference]: Start difference. First operand 217 states and 240 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:10:49,079 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:52,233 INFO L93 Difference]: Finished difference Result 232 states and 252 transitions. [2021-11-02 12:10:52,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:10:52,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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:10:52,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:52,234 INFO L225 Difference]: With dead ends: 232 [2021-11-02 12:10:52,234 INFO L226 Difference]: Without dead ends: 190 [2021-11-02 12:10:52,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 930.69ms TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-11-02 12:10:52,235 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4064.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.88ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4566.92ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:52,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 836 Unknown, 0 Unchecked, 4.88ms Time], IncrementalHoareTripleChecker [7 Valid, 828 Invalid, 1 Unknown, 0 Unchecked, 4566.92ms Time] [2021-11-02 12:10:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-02 12:10:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2021-11-02 12:10:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 185 states have (on average 1.1081081081081081) internal successors, (205), 187 states have internal predecessors, (205), 0 states have call successors, (0), 0 states 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:10:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 205 transitions. [2021-11-02 12:10:52,240 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 205 transitions. Word has length 42 [2021-11-02 12:10:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:52,241 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 205 transitions. [2021-11-02 12:10:52,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:10:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 205 transitions. [2021-11-02 12:10:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 12:10:52,241 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:52,241 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:10:52,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 12:10:52,242 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:10:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1833906296, now seen corresponding path program 1 times [2021-11-02 12:10:52,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:52,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463010723] [2021-11-02 12:10:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:52,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:56,272 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:10:56,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:56,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463010723] [2021-11-02 12:10:56,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463010723] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:56,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:56,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 12:10:56,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224154147] [2021-11-02 12:10:56,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 12:10:56,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 12:10:56,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:10:56,273 INFO L87 Difference]: Start difference. First operand 188 states and 205 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:10:58,691 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:11:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:11:02,369 INFO L93 Difference]: Finished difference Result 200 states and 213 transitions. [2021-11-02 12:11:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:11:02,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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:11:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:11:02,370 INFO L225 Difference]: With dead ends: 200 [2021-11-02 12:11:02,371 INFO L226 Difference]: Without dead ends: 154 [2021-11-02 12:11:02,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1252.30ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:11:02,371 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4734.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.33ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5199.83ms IncrementalHoareTripleChecker+Time [2021-11-02 12:11:02,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 884 Unknown, 0 Unchecked, 6.33ms Time], IncrementalHoareTripleChecker [4 Valid, 879 Invalid, 1 Unknown, 0 Unchecked, 5199.83ms Time] [2021-11-02 12:11:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-11-02 12:11:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2021-11-02 12:11:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 142 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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:11:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2021-11-02 12:11:02,375 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 42 [2021-11-02 12:11:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:11:02,376 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2021-11-02 12:11:02,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:11:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2021-11-02 12:11:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-02 12:11:02,376 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:11:02,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:11:02,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 12:11:02,376 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:11:02,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:11:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1252880233, now seen corresponding path program 1 times [2021-11-02 12:11:02,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:11:02,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199402800] [2021-11-02 12:11:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:11:02,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:11:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:11:06,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:11:06,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:11:06,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199402800] [2021-11-02 12:11:06,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199402800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:11:06,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:11:06,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 12:11:06,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425963465] [2021-11-02 12:11:06,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:11:06,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:11:06,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:11:06,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:11:06,532 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:11:08,967 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:11:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:11:13,336 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2021-11-02 12:11:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 12:11:13,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-02 12:11:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:11:13,337 INFO L225 Difference]: With dead ends: 154 [2021-11-02 12:11:13,337 INFO L226 Difference]: Without dead ends: 142 [2021-11-02 12:11:13,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2767.80ms TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2021-11-02 12:11:13,338 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 388 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4197.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.60ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4643.65ms IncrementalHoareTripleChecker+Time [2021-11-02 12:11:13,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 0 Invalid, 659 Unknown, 0 Unchecked, 6.60ms Time], IncrementalHoareTripleChecker [21 Valid, 637 Invalid, 1 Unknown, 0 Unchecked, 4643.65ms Time] [2021-11-02 12:11:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-02 12:11:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2021-11-02 12:11:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 111 states have (on average 1.063063063063063) internal successors, (118), 112 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:11:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2021-11-02 12:11:13,343 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 43 [2021-11-02 12:11:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:11:13,343 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2021-11-02 12:11:13,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:11:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2021-11-02 12:11:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-02 12:11:13,344 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:11:13,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:11:13,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 12:11:13,344 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:11:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:11:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash -629619840, now seen corresponding path program 1 times [2021-11-02 12:11:13,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:11:13,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555853006] [2021-11-02 12:11:13,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:11:13,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:11:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:11:18,084 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:11:18,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:11:18,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555853006] [2021-11-02 12:11:18,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555853006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:11:18,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:11:18,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 12:11:18,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189099614] [2021-11-02 12:11:18,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:11:18,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:11:18,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:11:18,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:11:18,085 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:11:20,311 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:11:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:11:21,850 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2021-11-02 12:11:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 12:11:21,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2021-11-02 12:11:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:11:21,851 INFO L225 Difference]: With dead ends: 135 [2021-11-02 12:11:21,852 INFO L226 Difference]: Without dead ends: 103 [2021-11-02 12:11:21,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 535.34ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-11-02 12:11:21,852 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3089.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.75ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3466.91ms IncrementalHoareTripleChecker+Time [2021-11-02 12:11:21,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 361 Unknown, 0 Unchecked, 2.75ms Time], IncrementalHoareTripleChecker [12 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 3466.91ms Time] [2021-11-02 12:11:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-02 12:11:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-11-02 12:11:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 102 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:11:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2021-11-02 12:11:21,855 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 44 [2021-11-02 12:11:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:11:21,856 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2021-11-02 12:11:21,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:11:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2021-11-02 12:11:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-02 12:11:21,856 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:11:21,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:11:21,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 12:11:21,856 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:11:21,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:11:21,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1828761527, now seen corresponding path program 1 times [2021-11-02 12:11:21,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:11:21,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566674744] [2021-11-02 12:11:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:11:21,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:11:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:11:22,112 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:11:22,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:11:22,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566674744] [2021-11-02 12:11:22,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566674744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:11:22,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:11:22,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:11:22,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323563395] [2021-11-02 12:11:22,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:11:22,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:11:22,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:11:22,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:11:22,114 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:11:24,360 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:11:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:11:25,587 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2021-11-02 12:11:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:11:25,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2021-11-02 12:11:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:11:25,588 INFO L225 Difference]: With dead ends: 110 [2021-11-02 12:11:25,588 INFO L226 Difference]: Without dead ends: 82 [2021-11-02 12:11:25,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 190.10ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:11:25,589 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2995.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.68ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3381.69ms IncrementalHoareTripleChecker+Time [2021-11-02 12:11:25,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 315 Unknown, 0 Unchecked, 1.68ms Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 1 Unknown, 0 Unchecked, 3381.69ms Time] [2021-11-02 12:11:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-02 12:11:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-11-02 12:11:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.0625) internal successors, (85), 81 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:11:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2021-11-02 12:11:25,591 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 44 [2021-11-02 12:11:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:11:25,592 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2021-11-02 12:11:25,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:11:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2021-11-02 12:11:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-02 12:11:25,592 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:11:25,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:11:25,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 12:11:25,592 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:11:25,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:11:25,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1390575826, now seen corresponding path program 1 times [2021-11-02 12:11:25,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:11:25,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376279370] [2021-11-02 12:11:25,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:11:25,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:11:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:11:30,504 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:11:30,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:11:30,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376279370] [2021-11-02 12:11:30,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376279370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:11:30,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:11:30,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 12:11:30,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377838260] [2021-11-02 12:11:30,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:11:30,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:11:30,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:11:30,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:11:30,506 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:32,713 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:11:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:11:34,954 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-11-02 12:11:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 12:11:34,955 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-02 12:11:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:11:34,956 INFO L225 Difference]: With dead ends: 82 [2021-11-02 12:11:34,956 INFO L226 Difference]: Without dead ends: 74 [2021-11-02 12:11:34,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1423.52ms TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2021-11-02 12:11:34,956 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 186 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3203.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.52ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3582.74ms IncrementalHoareTripleChecker+Time [2021-11-02 12:11:34,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 0 Invalid, 414 Unknown, 0 Unchecked, 3.52ms Time], IncrementalHoareTripleChecker [20 Valid, 393 Invalid, 1 Unknown, 0 Unchecked, 3582.74ms Time] [2021-11-02 12:11:34,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-02 12:11:34,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2021-11-02 12:11:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 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:11:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2021-11-02 12:11:34,959 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 47 [2021-11-02 12:11:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:11:34,959 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2021-11-02 12:11:34,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2021-11-02 12:11:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-02 12:11:34,959 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:11:34,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:11:34,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-02 12:11:34,960 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:11:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:11:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash 15325775, now seen corresponding path program 1 times [2021-11-02 12:11:34,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:11:34,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478781238] [2021-11-02 12:11:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:11:34,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:11:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:11:35,718 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:11:35,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:11:35,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478781238] [2021-11-02 12:11:35,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478781238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:11:35,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:11:35,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 12:11:35,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731983246] [2021-11-02 12:11:35,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 12:11:35,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:11:35,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 12:11:35,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-02 12:11:35,720 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:38,170 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:11:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:11:39,921 INFO L93 Difference]: Finished difference Result 76 states and 75 transitions. [2021-11-02 12:11:39,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:11:39,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-02 12:11:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:11:39,922 INFO L225 Difference]: With dead ends: 76 [2021-11-02 12:11:39,922 INFO L226 Difference]: Without dead ends: 54 [2021-11-02 12:11:39,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1085.64ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-02 12:11:39,923 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 186 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3173.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.15ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3540.51ms IncrementalHoareTripleChecker+Time [2021-11-02 12:11:39,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 0 Invalid, 307 Unknown, 0 Unchecked, 2.15ms Time], IncrementalHoareTripleChecker [6 Valid, 300 Invalid, 1 Unknown, 0 Unchecked, 3540.51ms Time] [2021-11-02 12:11:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-02 12:11:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-02 12:11:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0) internal successors, (53), 53 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 53 transitions. [2021-11-02 12:11:39,925 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 53 transitions. Word has length 50 [2021-11-02 12:11:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:11:39,925 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 53 transitions. [2021-11-02 12:11:39,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 53 transitions. [2021-11-02 12:11:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 12:11:39,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:11:39,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:11:39,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-02 12:11:39,926 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:11:39,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:11:39,926 INFO L85 PathProgramCache]: Analyzing trace with hash -318774894, now seen corresponding path program 1 times [2021-11-02 12:11:39,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:11:39,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345341745] [2021-11-02 12:11:39,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:11:39,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:11:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 12:11:41,718 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 12:11:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 12:11:43,664 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 12:11:43,664 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-02 12:11:43,665 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-02 12:11:43,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-02 12:11:43,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-02 12:11:43,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-02 12:11:43,667 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-02 12:11:43,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 12:11:43,670 INFO L732 BasicCegarLoop]: Path program histogram: [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:11:43,671 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 12:11:43,698 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:11:43,698 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:11:43,701 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:11:43,702 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:11:43,702 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:11:43,702 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:11:43,704 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:11:43,704 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:11:43,709 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:11:43,709 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:11:43,709 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:11:43,709 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:11:43,710 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:11:43,710 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:11:43,710 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:11:43,710 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:11:43,710 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:11:43,711 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:11:43,711 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:11:43,711 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:11:43,711 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:11:43,711 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:11:43,711 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:11:43,711 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:11:43,712 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:11:43,712 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:11:43,714 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:11:43,714 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:11:43,714 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:11:43,714 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:11:43,714 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:11:43,714 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:11:43,715 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:11:43,715 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:11:43,716 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:11:43,716 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:11:43,716 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:11:43,716 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:11:43,716 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:11:43,716 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:11:43,717 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:11:43,717 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:11:43,717 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:11:43,717 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:11:43,718 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:11:43,718 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:11:43,718 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:11:43,718 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:11:43,718 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:11:43,718 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:11:43,719 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:11:43,719 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:11:43,719 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:11:43,719 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:11:43,719 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:11:43,719 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:11:43,720 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:11:43,720 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:11:43,720 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:11:43,720 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:11:43,720 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:11:43,721 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:11:43,721 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:11:43,721 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:11:43,721 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:11:43,721 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:11:43,722 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:11:43,722 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:11:43,722 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:11:43,722 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:11:43,722 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:11:43,723 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:11:43,724 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:11:43,724 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:11:43,724 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:11:43,724 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:11:43,724 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:11:43,724 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:11:43,725 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:11:43,725 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:11:43,725 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:11:43,725 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:11:43,725 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:11:43,726 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:11:43,726 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:11:43,726 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:11:43,726 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:11:43,726 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:11:43,727 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:11:43,727 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:11:43,727 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:11:43,727 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:11:43,727 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:11:43,727 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:11:43,728 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:11:43,728 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:11:43,728 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:11:43,728 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:11:43,728 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:11:43,729 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:11:43,729 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:11:43,729 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:11:43,729 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:11:43,729 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:11:43,729 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:11:43,730 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:11:43,730 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:11:43,730 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:11:43,730 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:11:43,730 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:11:43,730 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:11:43,731 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:11:43,731 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:11:43,731 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:11:43,731 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:11:43,731 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:11:43,732 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:11:43,732 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:11:43,732 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:11:43,732 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:11:43,732 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:11:43,732 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:11:43,733 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:11:43,733 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:11:43,733 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:11:43,733 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:11:43,733 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:11:43,733 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:11:43,734 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:11:43,734 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:11:43,734 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:11:43,734 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:11:43,739 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:11:43,739 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:11:43,739 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:11:43,740 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:11:43,740 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:11:43,740 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:11:43,740 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:11:43,741 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:11:43,741 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:11:43,741 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:11:43,741 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:11:43,741 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:11:43,742 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:11:43,742 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:11:43,742 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:11:43,742 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:11:43,743 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:11:43,743 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:11:43,743 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:11:43,743 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:11:43,743 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:11:43,743 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:11:43,744 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:11:43,744 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:11:43,744 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:11:43,744 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:11:43,744 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:11:43,744 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:11:43,745 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:11:43,745 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:11:43,745 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:11:43,745 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:11:43,745 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:11:43,745 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:11:43,746 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:11:43,746 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:11:43,746 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:11:43,746 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:11:43,746 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:11:43,747 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:11:43,747 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:11:43,747 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:11:43,747 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:11:43,747 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:11:43,747 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:11:43,748 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:11:43,748 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:11:43,748 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:11:43,748 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:11:43,748 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:11:43,748 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:11:43,749 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:11:43,749 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:11:43,749 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:11:43,749 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:11:43,749 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:11:43,750 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:11:43,750 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:11:43,750 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:11:43,750 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:11:43,750 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:11:43,750 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:11:43,751 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:11:43,751 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:11:43,751 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:11:43,751 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:11:43,751 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:11:43,751 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:11:43,752 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:11:43,752 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:11:43,752 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:11:43,752 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:11:43,752 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:11:43,753 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:11:43,753 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:11:43,753 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:11:43,753 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:11:43,753 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:11:43,754 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:11:43,754 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:11:43,754 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:11:43,754 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:11:43,754 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:11:43,754 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:11:43,755 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:11:43,755 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:11:43,755 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:11:43,755 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:11:43,755 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:11:43,755 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:11:43,756 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:11:43,756 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:11:43,756 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:11:43,757 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:11:43,757 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:11:43,757 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:11:43,757 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:11:43,757 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:11:43,758 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:11:43,758 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:11:43,758 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:11:43,758 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:11:43,759 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:11:43,759 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:11:43,759 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:11:43,759 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:11:43,759 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:11:43,759 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:11:43,760 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:11:43,760 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:11:43,760 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:11:43,760 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:11:43,760 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:11:43,761 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:11:43,761 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:11:43,761 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:11:43,761 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:11:43,761 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:11:43,762 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:11:43,762 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:11:43,762 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:11:43,762 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:11:43,763 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:11:43,764 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:11:43,764 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:11:43,764 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:11:43,764 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:11:43,764 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:11:43,765 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:11:43,765 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:11:43,765 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:11:43,765 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:11:43,765 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:11:43,765 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:11:43,766 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:11:43,766 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:11:43,766 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:11:43,766 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:11:43,766 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:11:43,766 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:11:43,767 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:11:43,767 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:11:43,767 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:11:43,767 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:11:43,768 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:11:43,768 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:11:43,768 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:11:43,768 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:11:43,768 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:11:43,768 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:11:43,769 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:11:43,769 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:11:43,769 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:11:43,769 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:11:43,769 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:11:43,769 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:11:43,770 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:11:43,770 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:11:43,770 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:11:43,770 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:11:43,770 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:11:43,771 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:11:43,771 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:11:43,771 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:11:43,771 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:11:43,771 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:11:43,772 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:11:43,772 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:11:43,772 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:11:43,772 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:11:43,772 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:11:43,772 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:11:43,773 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:11:43,773 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:11:43,773 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:11:43,773 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:11:43,773 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:11:43,773 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:11:43,774 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:11:43,774 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:11:43,774 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:11:43,774 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:11:43,780 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:11:43,780 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:11:43,781 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:11:43,781 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:11:43,782 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:11:43,782 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:11:43,782 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:11:43,782 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:11:43,783 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:11:43,783 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:11:43,784 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:11:43,784 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:11:43,784 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:11:43,784 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:11:43,784 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:11:43,784 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:11:43,785 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:11:43,785 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:11:43,785 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:11:43,785 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:11:43,785 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:11:43,785 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:11:43,786 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:11:43,786 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:11:43,787 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:11:43,787 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:11:43,787 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:11:43,787 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:11:43,787 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:11:43,788 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:11:43,790 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:11:43,790 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:11:43,791 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:11:43,792 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:11:43,792 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:11:43,792 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:11:43,792 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:11:43,792 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:11:43,793 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:11:43,793 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:11:43,794 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:11:43,794 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:11:43,794 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:11:43,794 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:11:43,794 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:11:43,794 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:11:43,795 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:11:43,795 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:11:43,797 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:11:43,797 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:11:43,799 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:11:43,800 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:11:43,800 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:11:43,800 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:11:43,800 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:11:43,800 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:11:43,801 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:11:43,801 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:11:43,801 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:11:43,801 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:11:43,801 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:11:43,801 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:11:43,802 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:11:43,802 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:11:43,802 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:11:43,802 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:11:43,803 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:11:43,804 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:11:43,804 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:11:43,804 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:11:43,804 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:11:43,804 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:11:43,805 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:11:43,805 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:11:43,805 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:11:43,805 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:11:43,805 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:11:43,805 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:11:43,806 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:11:43,806 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:11:43,806 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:11:43,806 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:11:43,807 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:11:43,807 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:11:43,807 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:11:43,807 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:11:43,808 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:11:43,808 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:11:43,808 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:11:43,808 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:11:43,808 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:11:43,809 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:11:43,809 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:11:43,809 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:11:43,809 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:11:43,809 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:11:43,810 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:11:43,810 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:11:43,810 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:11:43,810 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:11:43,810 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:11:43,810 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:11:43,811 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:11:43,811 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:11:43,811 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:11:43,811 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:11:43,812 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:11:43,812 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:11:43,812 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:11:43,812 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:11:43,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 12:11:43 BoogieIcfgContainer [2021-11-02 12:11:43,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 12:11:43,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 12:11:43,981 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 12:11:43,981 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 12:11:43,982 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:09:32" (3/4) ... [2021-11-02 12:11:43,984 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 12:11:43,984 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 12:11:43,984 INFO L158 Benchmark]: Toolchain (without parser) took 137696.14ms. Allocated memory was 123.7MB in the beginning and 992.0MB in the end (delta: 868.2MB). Free memory was 85.1MB in the beginning and 691.1MB in the end (delta: -606.0MB). Peak memory consumption was 262.6MB. Max. memory is 16.1GB. [2021-11-02 12:11:43,985 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 39.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 12:11:43,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1701.66ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 84.6MB in the beginning and 94.3MB in the end (delta: -9.7MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2021-11-02 12:11:43,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 268.99ms. Allocated memory is still 159.4MB. Free memory was 94.3MB in the beginning and 81.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-02 12:11:43,985 INFO L158 Benchmark]: Boogie Preprocessor took 120.65ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 74.5MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-02 12:11:43,985 INFO L158 Benchmark]: RCFGBuilder took 4518.52ms. Allocated memory was 159.4MB in the beginning and 476.1MB in the end (delta: 316.7MB). Free memory was 74.5MB in the beginning and 241.8MB in the end (delta: -167.3MB). Peak memory consumption was 257.3MB. Max. memory is 16.1GB. [2021-11-02 12:11:43,986 INFO L158 Benchmark]: TraceAbstraction took 131076.45ms. Allocated memory was 476.1MB in the beginning and 992.0MB in the end (delta: 515.9MB). Free memory was 241.8MB in the beginning and 692.1MB in the end (delta: -450.4MB). Peak memory consumption was 433.6MB. Max. memory is 16.1GB. [2021-11-02 12:11:43,986 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 992.0MB. Free memory was 692.1MB in the beginning and 691.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-02 12:11:43,987 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.16ms. Allocated memory is still 81.8MB. Free memory is still 39.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1701.66ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 84.6MB in the beginning and 94.3MB in the end (delta: -9.7MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 268.99ms. Allocated memory is still 159.4MB. Free memory was 94.3MB in the beginning and 81.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.65ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 74.5MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 4518.52ms. Allocated memory was 159.4MB in the beginning and 476.1MB in the end (delta: 316.7MB). Free memory was 74.5MB in the beginning and 241.8MB in the end (delta: -167.3MB). Peak memory consumption was 257.3MB. Max. memory is 16.1GB. * TraceAbstraction took 131076.45ms. Allocated memory was 476.1MB in the beginning and 992.0MB in the end (delta: 515.9MB). Free memory was 241.8MB in the beginning and 692.1MB in the end (delta: -450.4MB). Peak memory consumption was 433.6MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 992.0MB. Free memory was 692.1MB in the beginning and 691.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 - 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 - 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 8780. 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; [L7656-L7668] 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}; [L8779-L8927] 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", } , }; [L8930-L8933] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L8935-L8944] 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.") } , }; [L8946-L8949] 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])), }; [L8951-L8955] static _Bool s_common_library_initialized = 0 ; VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list=46, s_list={486:0}, s_tolower_table={457:0}, tl_last_error=0] [L8969] size_t lhs_len = __VERIFIER_nondet_ulong(); [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list=46, s_list={486:0}, s_tolower_table={457:0}, tl_last_error=0] [L261] return __VERIFIER_nondet_bool(); [L6900-L6902] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list=2, s_common_log_subject_list={394:0}, s_list=46, s_list={486:0}, s_tolower_table={457:0}, tl_last_error=0] [L6886] return malloc(size); [L6900-L6902] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list={486:0}, s_list=46, s_tolower_table={457:0}, tl_last_error=0] [L6900-L6902] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L8971] void *lhs = can_fail_malloc(lhs_len); [L8973] void *rhs; [L8974] size_t rhs_len = __VERIFIER_nondet_ulong(); [L261] return __VERIFIER_nondet_bool(); [L8975] COND FALSE !(nondet_bool()) [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list={486:0}, s_list=46, s_tolower_table={457:0}, tl_last_error=0] [L261] return __VERIFIER_nondet_bool(); [L6900-L6902] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list={486:0}, s_list=46, s_tolower_table={457:0}, tl_last_error=0] [L6886] return malloc(size); [L6900-L6902] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list=2, s_common_log_subject_list={394:0}, s_list=46, s_list={486:0}, s_tolower_table={457:0}, tl_last_error=0] [L6900-L6902] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L8980] rhs = can_fail_malloc(rhs_len) [L8984] struct store_byte_from_buffer old_byte_from_lhs; [L7135] COND TRUE size > 0 && array && storage [L263] return __VERIFIER_nondet_ulong(); [L7136] storage->index = nondet_size_t() [L7137] storage->index [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list={486:0}, s_list=46, s_tolower_table={457:0}, tl_last_error=0] [L7138] EXPR storage->index [L7138] EXPR array[storage->index] [L7138] storage->byte = array[storage->index] [L8986] struct store_byte_from_buffer old_byte_from_rhs; [L7135] COND TRUE size > 0 && array && storage [L263] return __VERIFIER_nondet_ulong(); [L7136] storage->index = nondet_size_t() [L7137] storage->index [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list=46, s_list={486:0}, s_tolower_table={457:0}, tl_last_error=0] [L7138] EXPR storage->index [L7138] EXPR array[storage->index] [L7138] storage->byte = array[storage->index] [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list=2, s_common_log_subject_list={394:0}, s_list={486:0}, s_list=46, s_tolower_table={457:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list=46, s_list={486:0}, s_tolower_table={457:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list={486:0}, s_list=46, s_tolower_table={457:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list=46, s_list={486:0}, s_tolower_table={457:0}, tl_last_error=0] [L7715] COND FALSE !(len_a != len_b) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list=2, s_common_log_subject_list={394:0}, s_list=46, s_list={486:0}, s_tolower_table={457:0}, tl_last_error=0] [L7721] COND FALSE !(len_a == 0) [L7727] return !memcmp(array_a, array_b, len_a); [L8994] COND TRUE aws_array_eq(lhs, lhs_len, rhs, rhs_len) [L223] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list=2, s_common_log_subject_list={394:0}, s_list={486:0}, s_list=46, s_tolower_table={457:0}, tl_last_error=0] [L8997] COND TRUE lhs_len > 0 && lhs [L223] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list={486:0}, s_list=46, s_tolower_table={457:0}, tl_last_error=0] [L7101-L7104] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) [L266] return __VERIFIER_nondet_ulong(); [L7106] size_t i = nondet_uint64_t(); [L211] COND FALSE !(!cond) VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list={486:0}, s_list=46, s_tolower_table={457:0}, tl_last_error=0] [L7110] a[i] [L7110] b[i] [L223] COND TRUE !cond VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list={486:0}, s_list=46, s_tolower_table={457:0}, tl_last_error=0] [L223] reach_error() VAL [errors={486:0}, s_can_fail_allocator_static={384:0}, s_common_library_initialized=0, s_common_log_subject_infos={394:0}, s_common_log_subject_list={394:0}, s_common_log_subject_list=2, s_list=46, s_list={486:0}, s_tolower_table={457: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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 130733.69ms, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 28.15ms, AutomataDifference: 92329.60ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 6.28ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 4476 SdHoareTripleChecker+Valid, 81287.95ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4476 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 74321.97ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6843 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11347 IncrementalHoareTripleChecker+Invalid, 11557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 0 mSDtfsCounter, 11347 mSolverCounterSat, 127.53ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 15204.90ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=14, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 151.76ms AutomataMinimizationTime, 21 MinimizatonAttempts, 595 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 223.00ms SsaConstructionTime, 26119.14ms SatisfiabilityAnalysisTime, 9567.62ms InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 5578 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:11:44,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_array_eq_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 c9f60659fbb0886b2c3c86084c4cc81dbedd027936fc1dda43226ecbc4710056 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 12:11:45,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 12:11:45,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 12:11:45,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 12:11:45,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 12:11:45,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 12:11:45,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 12:11:45,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 12:11:45,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 12:11:45,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 12:11:45,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 12:11:45,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 12:11:45,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 12:11:45,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 12:11:45,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 12:11:45,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 12:11:45,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 12:11:45,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 12:11:45,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 12:11:45,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 12:11:45,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 12:11:45,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 12:11:45,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 12:11:45,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 12:11:45,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 12:11:45,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 12:11:45,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 12:11:45,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 12:11:45,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 12:11:45,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 12:11:45,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 12:11:45,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 12:11:45,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 12:11:45,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 12:11:45,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 12:11:45,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 12:11:45,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 12:11:45,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 12:11:45,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 12:11:45,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 12:11:45,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 12:11:45,906 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:11:45,937 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 12:11:45,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 12:11:45,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 12:11:45,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 12:11:45,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 12:11:45,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 12:11:45,941 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 12:11:45,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 12:11:45,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 12:11:45,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 12:11:45,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 12:11:45,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 12:11:45,942 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 12:11:45,942 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 12:11:45,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 12:11:45,943 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 12:11:45,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 12:11:45,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 12:11:45,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 12:11:45,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 12:11:45,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:11:45,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 12:11:45,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 12:11:45,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 12:11:45,944 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 12:11:45,944 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 12:11:45,944 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 12:11:45,944 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 12:11:45,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 12:11:45,944 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 12:11:45,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 12:11:45,945 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 -> c9f60659fbb0886b2c3c86084c4cc81dbedd027936fc1dda43226ecbc4710056 [2021-11-02 12:11:46,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 12:11:46,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 12:11:46,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 12:11:46,219 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 12:11:46,220 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 12:11:46,221 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i [2021-11-02 12:11:46,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404fb7746/a785f9c3235b4db4b53418ef0a31523b/FLAG589d3ca01 [2021-11-02 12:11:46,841 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 12:11:46,842 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i [2021-11-02 12:11:46,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404fb7746/a785f9c3235b4db4b53418ef0a31523b/FLAG589d3ca01 [2021-11-02 12:11:46,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404fb7746/a785f9c3235b4db4b53418ef0a31523b [2021-11-02 12:11:46,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 12:11:47,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 12:11:47,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 12:11:47,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 12:11:47,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 12:11:47,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:11:46" (1/1) ... [2021-11-02 12:11:47,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9d07b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:47, skipping insertion in model container [2021-11-02 12:11:47,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:11:46" (1/1) ... [2021-11-02 12:11:47,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 12:11:47,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 12:11:47,363 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i[4486,4499] [2021-11-02 12:11:47,368 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_array_eq_harness.i[4546,4559] [2021-11-02 12:11:47,389 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:11:47,394 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:11:47,940 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:47,942 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:47,943 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:47,944 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:47,945 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:47,958 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:47,962 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:47,964 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:47,965 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,181 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:11:48,182 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:11:48,183 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:11:48,184 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:11:48,184 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:11:48,185 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:11:48,185 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:11:48,185 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:11:48,186 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:11:48,186 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:11:48,270 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:11:48,383 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,384 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:11:48,488 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 12:11:48,515 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_array_eq_harness.i[4486,4499] [2021-11-02 12:11:48,516 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_array_eq_harness.i[4546,4559] [2021-11-02 12:11:48,517 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:11:48,518 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:11:48,547 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,547 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,548 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,548 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,549 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,554 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,554 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,555 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,555 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,582 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:11:48,582 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:11:48,583 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:11:48,585 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:11:48,585 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:11:48,585 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:11:48,585 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:11:48,586 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:11:48,586 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:11:48,586 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:11:48,615 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:11:48,654 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,655 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:11:48,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:11:48,901 INFO L208 MainTranslator]: Completed translation [2021-11-02 12:11:48,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:48 WrapperNode [2021-11-02 12:11:48,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 12:11:48,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 12:11:48,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 12:11:48,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 12:11:48,906 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:11:48" (1/1) ... [2021-11-02 12:11:48,977 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:11:48" (1/1) ... [2021-11-02 12:11:49,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 12:11:49,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 12:11:49,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 12:11:49,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 12:11:49,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:48" (1/1) ... [2021-11-02 12:11:49,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:48" (1/1) ... [2021-11-02 12:11:49,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:48" (1/1) ... [2021-11-02 12:11:49,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:48" (1/1) ... [2021-11-02 12:11:49,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:48" (1/1) ... [2021-11-02 12:11:49,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:48" (1/1) ... [2021-11-02 12:11:49,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:48" (1/1) ... [2021-11-02 12:11:49,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 12:11:49,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 12:11:49,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 12:11:49,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 12:11:49,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:48" (1/1) ... [2021-11-02 12:11:49,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:11:49,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:11:49,131 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:11:49,159 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:11:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-02 12:11:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 12:11:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 12:11:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-02 12:11:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 12:11:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 12:11:49,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 12:11:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-02 12:11:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-02 12:11:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 12:11:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-02 12:11:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-02 12:11:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 12:11:55,147 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 12:11:55,148 INFO L299 CfgBuilder]: Removed 70 assume(true) statements. [2021-11-02 12:11:55,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:11:55 BoogieIcfgContainer [2021-11-02 12:11:55,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 12:11:55,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 12:11:55,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 12:11:55,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 12:11:55,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:11:46" (1/3) ... [2021-11-02 12:11:55,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a9728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:11:55, skipping insertion in model container [2021-11-02 12:11:55,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:11:48" (2/3) ... [2021-11-02 12:11:55,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a9728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:11:55, skipping insertion in model container [2021-11-02 12:11:55,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:11:55" (3/3) ... [2021-11-02 12:11:55,154 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_eq_harness.i [2021-11-02 12:11:55,158 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 12:11:55,158 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-02 12:11:55,190 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 12:11:55,194 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:11:55,197 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-02 12:11:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 70 states have (on average 1.5) internal successors, (105), 75 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:11:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-02 12:11:55,210 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:11:55,211 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] [2021-11-02 12:11:55,211 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:11:55,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:11:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1732530516, now seen corresponding path program 1 times [2021-11-02 12:11:55,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:11:55,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983074556] [2021-11-02 12:11:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:11:55,228 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:11:55,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:11:55,229 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:11:55,269 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:11:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:11:57,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-02 12:11:57,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:11:57,376 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:11:57,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:11:57,417 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:11:57,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:11:57,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983074556] [2021-11-02 12:11:57,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983074556] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:11:57,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:11:57,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 12:11:57,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216179165] [2021-11-02 12:11:57,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 12:11:57,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:11:57,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 12:11:57,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:11:57,461 INFO L87 Difference]: Start difference. First operand has 76 states, 70 states have (on average 1.5) internal successors, (105), 75 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) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:11:59,759 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:12:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:12:00,103 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2021-11-02 12:12:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 12:12:00,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-11-02 12:12:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:12:00,111 INFO L225 Difference]: With dead ends: 149 [2021-11-02 12:12:00,112 INFO L226 Difference]: Without dead ends: 70 [2021-11-02 12:12:00,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.11ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:12:00,120 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2520.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.21ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2614.82ms IncrementalHoareTripleChecker+Time [2021-11-02 12:12:00,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 89 Unknown, 0 Unchecked, 1.21ms Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 2614.82ms Time] [2021-11-02 12:12:00,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-02 12:12:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-11-02 12:12:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 69 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:12:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2021-11-02 12:12:00,148 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 27 [2021-11-02 12:12:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:12:00,152 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2021-11-02 12:12:00,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:12:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2021-11-02 12:12:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-02 12:12:00,153 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:12:00,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:12:00,188 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:12:00,376 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:12:00,376 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:12:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:12:00,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1816035494, now seen corresponding path program 1 times [2021-11-02 12:12:00,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:12:00,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672744627] [2021-11-02 12:12:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:12:00,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:12:00,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:12:00,382 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:12:00,384 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:12:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:12:02,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-02 12:12:02,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:12:03,196 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:12:03,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:12:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:12:03,617 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:12:03,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672744627] [2021-11-02 12:12:03,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672744627] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:12:03,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:12:03,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2021-11-02 12:12:03,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406187549] [2021-11-02 12:12:03,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:12:03,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:12:03,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:12:03,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:12:03,620 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:12:05,806 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:12:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:12:10,571 INFO L93 Difference]: Finished difference Result 491 states and 571 transitions. [2021-11-02 12:12:10,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 12:12:10,572 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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 27 [2021-11-02 12:12:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:12:10,576 INFO L225 Difference]: With dead ends: 491 [2021-11-02 12:12:10,576 INFO L226 Difference]: Without dead ends: 460 [2021-11-02 12:12:10,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1298.73ms TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2021-11-02 12:12:10,578 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 717 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5493.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 31.76ms SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5898.01ms IncrementalHoareTripleChecker+Time [2021-11-02 12:12:10,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 0 Invalid, 1205 Unknown, 0 Unchecked, 31.76ms Time], IncrementalHoareTripleChecker [38 Valid, 1166 Invalid, 1 Unknown, 0 Unchecked, 5898.01ms Time] [2021-11-02 12:12:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-11-02 12:12:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 150. [2021-11-02 12:12:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.193103448275862) internal successors, (173), 149 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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:12:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2021-11-02 12:12:10,607 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 27 [2021-11-02 12:12:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:12:10,608 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2021-11-02 12:12:10,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:12:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2021-11-02 12:12:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-02 12:12:10,610 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:12:10,610 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] [2021-11-02 12:12:10,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-02 12:12:10,826 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:12:10,827 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:12:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:12:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash 515997540, now seen corresponding path program 1 times [2021-11-02 12:12:10,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:12:10,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802851888] [2021-11-02 12:12:10,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:12:10,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:12:10,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:12:10,832 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:12:10,833 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:12:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:12:12,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 1590 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 12:12:12,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:12:13,173 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:12:13,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:12:13,327 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:12:13,328 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:12:13,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802851888] [2021-11-02 12:12:13,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802851888] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:12:13,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:12:13,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-02 12:12:13,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604932142] [2021-11-02 12:12:13,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:12:13,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:12:13,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:12:13,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:12:13,330 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:12:15,536 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:12:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:12:16,830 INFO L93 Difference]: Finished difference Result 192 states and 226 transitions. [2021-11-02 12:12:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:12:16,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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 28 [2021-11-02 12:12:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:12:16,832 INFO L225 Difference]: With dead ends: 192 [2021-11-02 12:12:16,832 INFO L226 Difference]: Without dead ends: 167 [2021-11-02 12:12:16,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 91.77ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:12:16,833 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3207.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.30ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3417.45ms IncrementalHoareTripleChecker+Time [2021-11-02 12:12:16,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 337 Unknown, 0 Unchecked, 4.30ms Time], IncrementalHoareTripleChecker [8 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 3417.45ms Time] [2021-11-02 12:12:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-02 12:12:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 131. [2021-11-02 12:12:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.2142857142857142) internal successors, (153), 130 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:12:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2021-11-02 12:12:16,853 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 28 [2021-11-02 12:12:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:12:16,853 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2021-11-02 12:12:16,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:12:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2021-11-02 12:12:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-02 12:12:16,855 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:12:16,855 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] [2021-11-02 12:12:16,890 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:12:17,081 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:12:17,082 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:12:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:12:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1532986451, now seen corresponding path program 1 times [2021-11-02 12:12:17,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:12:17,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27466303] [2021-11-02 12:12:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:12:17,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:12:17,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:12:17,087 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:12:17,088 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:12:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:12:19,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 12:12:19,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:12:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:12:20,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:12:20,863 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:12:20,864 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:12:20,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27466303] [2021-11-02 12:12:20,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27466303] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:12:20,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:12:20,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 8] imperfect sequences [] total 19 [2021-11-02 12:12:20,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417638161] [2021-11-02 12:12:20,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-02 12:12:20,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:12:20,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-02 12:12:20,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-11-02 12:12:20,865 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:12:23,070 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:12:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:12:31,225 INFO L93 Difference]: Finished difference Result 347 states and 398 transitions. [2021-11-02 12:12:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-02 12:12:31,226 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-02 12:12:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:12:31,227 INFO L225 Difference]: With dead ends: 347 [2021-11-02 12:12:31,227 INFO L226 Difference]: Without dead ends: 325 [2021-11-02 12:12:31,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 4109.81ms TimeCoverageRelationStatistics Valid=589, Invalid=1763, Unknown=0, NotChecked=0, Total=2352 [2021-11-02 12:12:31,229 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1106 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6533.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.16ms SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7028.33ms IncrementalHoareTripleChecker+Time [2021-11-02 12:12:31,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1106 Valid, 0 Invalid, 1447 Unknown, 0 Unchecked, 27.16ms Time], IncrementalHoareTripleChecker [69 Valid, 1377 Invalid, 1 Unknown, 0 Unchecked, 7028.33ms Time] [2021-11-02 12:12:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-11-02 12:12:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 149. [2021-11-02 12:12:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.2083333333333333) internal successors, (174), 148 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:12:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2021-11-02 12:12:31,251 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 33 [2021-11-02 12:12:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:12:31,252 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2021-11-02 12:12:31,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:12:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2021-11-02 12:12:31,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-02 12:12:31,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:12:31,257 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] [2021-11-02 12:12:31,292 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:12:31,472 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:12:31,473 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:12:31,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:12:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash -358833571, now seen corresponding path program 1 times [2021-11-02 12:12:31,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:12:31,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056647265] [2021-11-02 12:12:31,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:12:31,479 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:12:31,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:12:31,480 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:12:31,482 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:12:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:12:33,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-02 12:12:33,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:12:34,860 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:12:34,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:12:35,663 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:12:35,663 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:12:35,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056647265] [2021-11-02 12:12:35,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056647265] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:12:35,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:12:35,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 17 [2021-11-02 12:12:35,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917865229] [2021-11-02 12:12:35,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 12:12:35,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:12:35,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 12:12:35,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:12:35,665 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:12:37,866 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:12:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:12:44,287 INFO L93 Difference]: Finished difference Result 500 states and 578 transitions. [2021-11-02 12:12:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 12:12:44,289 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 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 33 [2021-11-02 12:12:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:12:44,291 INFO L225 Difference]: With dead ends: 500 [2021-11-02 12:12:44,291 INFO L226 Difference]: Without dead ends: 485 [2021-11-02 12:12:44,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2034.78ms TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2021-11-02 12:12:44,292 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 763 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6948.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.44ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7457.05ms IncrementalHoareTripleChecker+Time [2021-11-02 12:12:44,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 0 Invalid, 1918 Unknown, 0 Unchecked, 15.44ms Time], IncrementalHoareTripleChecker [39 Valid, 1878 Invalid, 1 Unknown, 0 Unchecked, 7457.05ms Time] [2021-11-02 12:12:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-11-02 12:12:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 174. [2021-11-02 12:12:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.1893491124260356) internal successors, (201), 173 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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:12:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2021-11-02 12:12:44,309 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 33 [2021-11-02 12:12:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:12:44,311 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2021-11-02 12:12:44,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:12:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2021-11-02 12:12:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-02 12:12:44,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:12:44,313 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:12:44,348 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:12:44,540 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:12:44,540 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:12:44,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:12:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1155426652, now seen corresponding path program 1 times [2021-11-02 12:12:44,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:12:44,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58940972] [2021-11-02 12:12:44,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:12:44,544 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:12:44,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:12:44,546 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:12:44,546 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:12:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:12:46,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 1619 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 12:12:46,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:12:46,616 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:12:46,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:12:46,719 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:12:46,719 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:12:46,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58940972] [2021-11-02 12:12:46,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58940972] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:12:46,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:12:46,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-02 12:12:46,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108269259] [2021-11-02 12:12:46,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:12:46,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:12:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:12:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:12:46,721 INFO L87 Difference]: Start difference. First operand 174 states and 201 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:12:48,944 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:12:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:12:50,195 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2021-11-02 12:12:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:12:50,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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:12:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:12:50,197 INFO L225 Difference]: With dead ends: 225 [2021-11-02 12:12:50,197 INFO L226 Difference]: Without dead ends: 213 [2021-11-02 12:12:50,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 87.47ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:12:50,198 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3271.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.53ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3427.53ms IncrementalHoareTripleChecker+Time [2021-11-02 12:12:50,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 358 Unknown, 0 Unchecked, 2.53ms Time], IncrementalHoareTripleChecker [2 Valid, 355 Invalid, 1 Unknown, 0 Unchecked, 3427.53ms Time] [2021-11-02 12:12:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-02 12:12:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 182. [2021-11-02 12:12:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 177 states have (on average 1.1807909604519775) internal successors, (209), 181 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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:12:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2021-11-02 12:12:50,210 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 34 [2021-11-02 12:12:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:12:50,210 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2021-11-02 12:12:50,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:12:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2021-11-02 12:12:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-02 12:12:50,211 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:12:50,211 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:12:50,243 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:12:50,416 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:12:50,416 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:12:50,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:12:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash 346080026, now seen corresponding path program 1 times [2021-11-02 12:12:50,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:12:50,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991067287] [2021-11-02 12:12:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:12:50,421 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:12:50,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:12:50,427 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:12:50,473 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:12:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:12:52,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 1619 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-02 12:12:52,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:12:53,465 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:12:53,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:12:54,472 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:12:54,472 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:12:54,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991067287] [2021-11-02 12:12:54,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991067287] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:12:54,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:12:54,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 12] imperfect sequences [] total 22 [2021-11-02 12:12:54,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939624361] [2021-11-02 12:12:54,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-02 12:12:54,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:12:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-02 12:12:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2021-11-02 12:12:54,473 INFO L87 Difference]: Start difference. First operand 182 states and 209 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:12:56,664 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:13:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:13:06,558 INFO L93 Difference]: Finished difference Result 447 states and 493 transitions. [2021-11-02 12:13:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-02 12:13:06,559 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 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:13:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:13:06,560 INFO L225 Difference]: With dead ends: 447 [2021-11-02 12:13:06,560 INFO L226 Difference]: Without dead ends: 432 [2021-11-02 12:13:06,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 5940.58ms TimeCoverageRelationStatistics Valid=856, Invalid=2566, Unknown=0, NotChecked=0, Total=3422 [2021-11-02 12:13:06,562 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1447 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6684.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.65ms SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7164.20ms IncrementalHoareTripleChecker+Time [2021-11-02 12:13:06,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1447 Valid, 0 Invalid, 1409 Unknown, 0 Unchecked, 16.65ms Time], IncrementalHoareTripleChecker [58 Valid, 1350 Invalid, 1 Unknown, 0 Unchecked, 7164.20ms Time] [2021-11-02 12:13:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-11-02 12:13:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 195. [2021-11-02 12:13:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.168421052631579) internal successors, (222), 194 states have internal predecessors, (222), 0 states have call successors, (0), 0 states 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:13:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2021-11-02 12:13:06,570 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 34 [2021-11-02 12:13:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:13:06,570 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2021-11-02 12:13:06,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:13:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2021-11-02 12:13:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-02 12:13:06,571 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:13:06,571 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:13:06,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-02 12:13:06,791 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:13:06,791 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:13:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:13:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1814533261, now seen corresponding path program 1 times [2021-11-02 12:13:06,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:13:06,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895067885] [2021-11-02 12:13:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:13:06,796 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:13:06,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:13:06,797 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:13:06,797 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:13:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:13:08,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-02 12:13:08,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:13:10,004 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:13:10,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:13:10,851 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:13:10,852 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:13:10,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895067885] [2021-11-02 12:13:10,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895067885] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:13:10,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:13:10,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 17 [2021-11-02 12:13:10,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731305519] [2021-11-02 12:13:10,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 12:13:10,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:13:10,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 12:13:10,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:13:10,853 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:13:13,060 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:13:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:13:19,259 INFO L93 Difference]: Finished difference Result 329 states and 376 transitions. [2021-11-02 12:13:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-02 12:13:19,259 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-02 12:13:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:13:19,260 INFO L225 Difference]: With dead ends: 329 [2021-11-02 12:13:19,260 INFO L226 Difference]: Without dead ends: 302 [2021-11-02 12:13:19,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1918.81ms TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2021-11-02 12:13:19,261 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 309 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6890.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.96ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7389.65ms IncrementalHoareTripleChecker+Time [2021-11-02 12:13:19,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 0 Invalid, 1610 Unknown, 0 Unchecked, 10.96ms Time], IncrementalHoareTripleChecker [37 Valid, 1572 Invalid, 1 Unknown, 0 Unchecked, 7389.65ms Time] [2021-11-02 12:13:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-11-02 12:13:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 170. [2021-11-02 12:13:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.1757575757575758) internal successors, (194), 169 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:13:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2021-11-02 12:13:19,266 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 34 [2021-11-02 12:13:19,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:13:19,266 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2021-11-02 12:13:19,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:13:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2021-11-02 12:13:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:13:19,281 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:13:19,281 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:13:19,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-02 12:13:19,485 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:13:19,485 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:13:19,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:13:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash -849869248, now seen corresponding path program 1 times [2021-11-02 12:13:19,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:13:19,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902290936] [2021-11-02 12:13:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:13:19,489 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:13:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:13:19,491 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:13:19,492 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:13:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:13:21,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-02 12:13:21,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:13:22,868 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:13:22,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:13:23,904 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:13:23,904 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:13:23,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902290936] [2021-11-02 12:13:23,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902290936] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:13:23,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:13:23,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 10] imperfect sequences [] total 23 [2021-11-02 12:13:23,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214329989] [2021-11-02 12:13:23,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-02 12:13:23,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:13:23,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-02 12:13:23,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-11-02 12:13:23,905 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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:13:26,104 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:13:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:13:37,209 INFO L93 Difference]: Finished difference Result 353 states and 394 transitions. [2021-11-02 12:13:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-02 12:13:37,210 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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:13:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:13:37,211 INFO L225 Difference]: With dead ends: 353 [2021-11-02 12:13:37,211 INFO L226 Difference]: Without dead ends: 297 [2021-11-02 12:13:37,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 5383.30ms TimeCoverageRelationStatistics Valid=565, Invalid=1985, Unknown=0, NotChecked=0, Total=2550 [2021-11-02 12:13:37,213 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1016 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8766.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.57ms SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9380.46ms IncrementalHoareTripleChecker+Time [2021-11-02 12:13:37,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1016 Valid, 0 Invalid, 2281 Unknown, 0 Unchecked, 16.57ms Time], IncrementalHoareTripleChecker [107 Valid, 2173 Invalid, 1 Unknown, 0 Unchecked, 9380.46ms Time] [2021-11-02 12:13:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-11-02 12:13:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 176. [2021-11-02 12:13:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.1754385964912282) internal successors, (201), 175 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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:13:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2021-11-02 12:13:37,218 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 36 [2021-11-02 12:13:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:13:37,218 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2021-11-02 12:13:37,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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:13:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2021-11-02 12:13:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:13:37,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:13:37,219 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:13:37,256 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:13:37,419 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:13:37,420 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:13:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:13:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash 214022886, now seen corresponding path program 1 times [2021-11-02 12:13:37,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:13:37,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789134662] [2021-11-02 12:13:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:13:37,424 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:13:37,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:13:37,425 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:13:37,427 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:13:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:13:39,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-02 12:13:39,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:13:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:13:40,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:13:41,495 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:13:41,495 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:13:41,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789134662] [2021-11-02 12:13:41,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789134662] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:13:41,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:13:41,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 9] imperfect sequences [] total 21 [2021-11-02 12:13:41,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714714075] [2021-11-02 12:13:41,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-02 12:13:41,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:13:41,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-02 12:13:41,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2021-11-02 12:13:41,497 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:13:43,720 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:13:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:13:53,100 INFO L93 Difference]: Finished difference Result 301 states and 335 transitions. [2021-11-02 12:13:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-02 12:13:53,101 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-02 12:13:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:13:53,102 INFO L225 Difference]: With dead ends: 301 [2021-11-02 12:13:53,102 INFO L226 Difference]: Without dead ends: 277 [2021-11-02 12:13:53,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 5117.00ms TimeCoverageRelationStatistics Valid=596, Invalid=1954, Unknown=0, NotChecked=0, Total=2550 [2021-11-02 12:13:53,103 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 759 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 82 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7179.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.24ms SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7665.09ms IncrementalHoareTripleChecker+Time [2021-11-02 12:13:53,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 0 Invalid, 1642 Unknown, 0 Unchecked, 12.24ms Time], IncrementalHoareTripleChecker [82 Valid, 1559 Invalid, 1 Unknown, 0 Unchecked, 7665.09ms Time] [2021-11-02 12:13:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-02 12:13:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 154. [2021-11-02 12:13:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.174496644295302) internal successors, (175), 153 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:13:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2021-11-02 12:13:53,108 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 36 [2021-11-02 12:13:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:13:53,108 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2021-11-02 12:13:53,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:13:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2021-11-02 12:13:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:13:53,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:13:53,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:13:53,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-02 12:13:53,309 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:13:53,309 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:13:53,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:13:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2113766872, now seen corresponding path program 1 times [2021-11-02 12:13:53,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:13:53,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951417690] [2021-11-02 12:13:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:13:53,313 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:13:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:13:53,314 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:13:53,316 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:13:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:13:55,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-02 12:13:55,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:13:57,051 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:13:57,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:13:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:13:59,629 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:13:59,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951417690] [2021-11-02 12:13:59,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951417690] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:13:59,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:13:59,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19, 17] imperfect sequences [] total 33 [2021-11-02 12:13:59,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27904133] [2021-11-02 12:13:59,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-02 12:13:59,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:13:59,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-02 12:13:59,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2021-11-02 12:13:59,630 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:14:01,835 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:14:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:14:25,612 INFO L93 Difference]: Finished difference Result 449 states and 494 transitions. [2021-11-02 12:14:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-02 12:14:25,613 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-02 12:14:25,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:14:25,614 INFO L225 Difference]: With dead ends: 449 [2021-11-02 12:14:25,614 INFO L226 Difference]: Without dead ends: 422 [2021-11-02 12:14:25,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 12549.85ms TimeCoverageRelationStatistics Valid=1177, Invalid=5303, Unknown=0, NotChecked=0, Total=6480 [2021-11-02 12:14:25,616 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1772 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 3882 mSolverCounterSat, 138 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14921.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 33.86ms SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 3882 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16021.24ms IncrementalHoareTripleChecker+Time [2021-11-02 12:14:25,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1772 Valid, 0 Invalid, 4021 Unknown, 0 Unchecked, 33.86ms Time], IncrementalHoareTripleChecker [138 Valid, 3882 Invalid, 1 Unknown, 0 Unchecked, 16021.24ms Time] [2021-11-02 12:14:25,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-11-02 12:14:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 210. [2021-11-02 12:14:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.175609756097561) internal successors, (241), 209 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:14:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 241 transitions. [2021-11-02 12:14:25,634 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 241 transitions. Word has length 36 [2021-11-02 12:14:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:14:25,634 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 241 transitions. [2021-11-02 12:14:25,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:14:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 241 transitions. [2021-11-02 12:14:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:14:25,635 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:14:25,636 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:14:25,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-02 12:14:25,844 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:14:25,844 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:14:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:14:25,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1837401266, now seen corresponding path program 1 times [2021-11-02 12:14:25,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:14:25,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629912015] [2021-11-02 12:14:25,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:14:25,850 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:14:25,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:14:25,851 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:14:25,853 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:14:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:14:27,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-02 12:14:27,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:14:30,023 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:14:30,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:14:32,756 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:14:32,757 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:14:32,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629912015] [2021-11-02 12:14:32,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629912015] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:14:32,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:14:32,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19, 19] imperfect sequences [] total 32 [2021-11-02 12:14:32,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230288694] [2021-11-02 12:14:32,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-02 12:14:32,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:14:32,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-02 12:14:32,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2021-11-02 12:14:32,759 INFO L87 Difference]: Start difference. First operand 210 states and 241 transitions. Second operand has 32 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:14:34,958 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:14:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:14:48,328 INFO L93 Difference]: Finished difference Result 436 states and 475 transitions. [2021-11-02 12:14:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-02 12:14:48,329 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-02 12:14:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:14:48,330 INFO L225 Difference]: With dead ends: 436 [2021-11-02 12:14:48,330 INFO L226 Difference]: Without dead ends: 421 [2021-11-02 12:14:48,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 7497.56ms TimeCoverageRelationStatistics Valid=672, Invalid=2868, Unknown=0, NotChecked=0, Total=3540 [2021-11-02 12:14:48,331 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 903 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 105 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10514.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.34ms SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11275.59ms IncrementalHoareTripleChecker+Time [2021-11-02 12:14:48,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [903 Valid, 0 Invalid, 2900 Unknown, 0 Unchecked, 19.34ms Time], IncrementalHoareTripleChecker [105 Valid, 2794 Invalid, 1 Unknown, 0 Unchecked, 11275.59ms Time] [2021-11-02 12:14:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-11-02 12:14:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 210. [2021-11-02 12:14:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.175609756097561) internal successors, (241), 209 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:14:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 241 transitions. [2021-11-02 12:14:48,339 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 241 transitions. Word has length 36 [2021-11-02 12:14:48,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:14:48,339 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 241 transitions. [2021-11-02 12:14:48,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:14:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 241 transitions. [2021-11-02 12:14:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 12:14:48,339 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:14:48,339 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] [2021-11-02 12:14:48,372 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:14:48,559 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:14:48,560 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:14:48,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:14:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1155735666, now seen corresponding path program 1 times [2021-11-02 12:14:48,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:14:48,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382108421] [2021-11-02 12:14:48,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:14:48,564 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:14:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:14:48,565 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:14:48,570 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:14:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:14:50,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 1613 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-02 12:14:50,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:14:52,701 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:14:52,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:14:54,747 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:14:54,747 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:14:54,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382108421] [2021-11-02 12:14:54,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382108421] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:14:54,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:14:54,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19, 17] imperfect sequences [] total 33 [2021-11-02 12:14:54,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050261284] [2021-11-02 12:14:54,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-02 12:14:54,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:14:54,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-02 12:14:54,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2021-11-02 12:14:54,749 INFO L87 Difference]: Start difference. First operand 210 states and 241 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:14:56,940 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:15:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:15:11,989 INFO L93 Difference]: Finished difference Result 289 states and 317 transitions. [2021-11-02 12:15:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-02 12:15:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-02 12:15:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:15:11,991 INFO L225 Difference]: With dead ends: 289 [2021-11-02 12:15:11,991 INFO L226 Difference]: Without dead ends: 269 [2021-11-02 12:15:11,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 9255.35ms TimeCoverageRelationStatistics Valid=931, Invalid=4181, Unknown=0, NotChecked=0, Total=5112 [2021-11-02 12:15:11,992 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1226 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 124 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9872.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.12ms SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10532.37ms IncrementalHoareTripleChecker+Time [2021-11-02 12:15:11,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1226 Valid, 0 Invalid, 2724 Unknown, 0 Unchecked, 19.12ms Time], IncrementalHoareTripleChecker [124 Valid, 2599 Invalid, 1 Unknown, 0 Unchecked, 10532.37ms Time] [2021-11-02 12:15:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-02 12:15:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 205. [2021-11-02 12:15:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.17) internal successors, (234), 204 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:15:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 234 transitions. [2021-11-02 12:15:11,999 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 234 transitions. Word has length 37 [2021-11-02 12:15:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:15:11,999 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 234 transitions. [2021-11-02 12:15:11,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:15:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 234 transitions. [2021-11-02 12:15:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 12:15:11,999 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:15:11,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:15:12,037 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:15:12,200 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:15:12,200 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:15:12,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:15:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1071392324, now seen corresponding path program 1 times [2021-11-02 12:15:12,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:15:12,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984356590] [2021-11-02 12:15:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:15:12,208 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:15:12,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:15:12,210 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:15:12,210 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:15:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:15:14,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 1613 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-02 12:15:14,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:15:16,317 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:15:16,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:15:18,713 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:15:18,713 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:15:18,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984356590] [2021-11-02 12:15:18,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984356590] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:15:18,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:15:18,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19, 19] imperfect sequences [] total 32 [2021-11-02 12:15:18,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614819354] [2021-11-02 12:15:18,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-02 12:15:18,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:15:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-02 12:15:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2021-11-02 12:15:18,715 INFO L87 Difference]: Start difference. First operand 205 states and 234 transitions. Second operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:15:20,920 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:15:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:15:31,845 INFO L93 Difference]: Finished difference Result 268 states and 296 transitions. [2021-11-02 12:15:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-02 12:15:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 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 37 [2021-11-02 12:15:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:15:31,846 INFO L225 Difference]: With dead ends: 268 [2021-11-02 12:15:31,847 INFO L226 Difference]: Without dead ends: 252 [2021-11-02 12:15:31,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 7414.86ms TimeCoverageRelationStatistics Valid=632, Invalid=2560, Unknown=0, NotChecked=0, Total=3192 [2021-11-02 12:15:31,848 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 682 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 102 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8069.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.93ms SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8631.41ms IncrementalHoareTripleChecker+Time [2021-11-02 12:15:31,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [682 Valid, 0 Invalid, 2045 Unknown, 0 Unchecked, 12.93ms Time], IncrementalHoareTripleChecker [102 Valid, 1942 Invalid, 1 Unknown, 0 Unchecked, 8631.41ms Time] [2021-11-02 12:15:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-11-02 12:15:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 192. [2021-11-02 12:15:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.1764705882352942) internal successors, (220), 191 states have internal predecessors, (220), 0 states have call successors, (0), 0 states 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:15:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 220 transitions. [2021-11-02 12:15:31,854 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 220 transitions. Word has length 37 [2021-11-02 12:15:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:15:31,854 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 220 transitions. [2021-11-02 12:15:31,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:15:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 220 transitions. [2021-11-02 12:15:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 12:15:31,854 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:15:31,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:15:31,897 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:15:32,060 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:15:32,061 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:15:32,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:15:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash -761417087, now seen corresponding path program 1 times [2021-11-02 12:15:32,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:15:32,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726391639] [2021-11-02 12:15:32,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:15:32,064 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:15:32,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:15:32,072 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:15:32,077 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:15:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:15:34,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-02 12:15:34,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:15:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:15:35,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:15:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:15:35,342 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:15:35,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726391639] [2021-11-02 12:15:35,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726391639] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:15:35,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:15:35,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 5] imperfect sequences [] total 13 [2021-11-02 12:15:35,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147382809] [2021-11-02 12:15:35,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:15:35,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:15:35,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:15:35,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:15:35,344 INFO L87 Difference]: Start difference. First operand 192 states and 220 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:15:37,551 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:15:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:15:41,643 INFO L93 Difference]: Finished difference Result 320 states and 356 transitions. [2021-11-02 12:15:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-02 12:15:41,644 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-02 12:15:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:15:41,645 INFO L225 Difference]: With dead ends: 320 [2021-11-02 12:15:41,645 INFO L226 Difference]: Without dead ends: 269 [2021-11-02 12:15:41,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1687.06ms TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2021-11-02 12:15:41,646 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 604 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4758.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.02ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5066.77ms IncrementalHoareTripleChecker+Time [2021-11-02 12:15:41,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [604 Valid, 0 Invalid, 780 Unknown, 0 Unchecked, 7.02ms Time], IncrementalHoareTripleChecker [9 Valid, 770 Invalid, 1 Unknown, 0 Unchecked, 5066.77ms Time] [2021-11-02 12:15:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-02 12:15:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 201. [2021-11-02 12:15:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.1581632653061225) internal successors, (227), 200 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:15:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2021-11-02 12:15:41,653 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 39 [2021-11-02 12:15:41,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:15:41,653 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2021-11-02 12:15:41,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:15:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2021-11-02 12:15:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 12:15:41,654 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:15:41,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:15:41,691 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:15:41,865 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:15:41,865 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:15:41,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:15:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1013590275, now seen corresponding path program 1 times [2021-11-02 12:15:41,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:15:41,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718168365] [2021-11-02 12:15:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:15:41,869 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:15:41,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:15:41,870 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:15:41,871 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:15:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:15:44,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-02 12:15:44,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:15:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:15:44,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:15:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:15:45,132 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:15:45,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718168365] [2021-11-02 12:15:45,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718168365] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:15:45,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:15:45,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2021-11-02 12:15:45,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236417189] [2021-11-02 12:15:45,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 12:15:45,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:15:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 12:15:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:15:45,134 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:15:47,346 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:15:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:15:50,655 INFO L93 Difference]: Finished difference Result 264 states and 292 transitions. [2021-11-02 12:15:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 12:15:50,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-02 12:15:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:15:50,656 INFO L225 Difference]: With dead ends: 264 [2021-11-02 12:15:50,656 INFO L226 Difference]: Without dead ends: 262 [2021-11-02 12:15:50,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 862.64ms TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2021-11-02 12:15:50,657 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 458 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4563.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.95ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4858.56ms IncrementalHoareTripleChecker+Time [2021-11-02 12:15:50,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 0 Invalid, 719 Unknown, 0 Unchecked, 5.95ms Time], IncrementalHoareTripleChecker [22 Valid, 696 Invalid, 1 Unknown, 0 Unchecked, 4858.56ms Time] [2021-11-02 12:15:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-02 12:15:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 201. [2021-11-02 12:15:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.153061224489796) internal successors, (226), 200 states have internal predecessors, (226), 0 states have call successors, (0), 0 states 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:15:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 226 transitions. [2021-11-02 12:15:50,663 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 226 transitions. Word has length 39 [2021-11-02 12:15:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:15:50,664 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 226 transitions. [2021-11-02 12:15:50,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:15:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 226 transitions. [2021-11-02 12:15:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 12:15:50,664 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:15:50,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:15:50,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-11-02 12:15:50,868 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:15:50,868 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 12:15:50,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:15:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1059303570, now seen corresponding path program 1 times [2021-11-02 12:15:50,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:15:50,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911887494] [2021-11-02 12:15:50,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:15:50,872 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:15:50,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:15:50,875 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:15:50,908 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:18:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:18:11,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-02 12:18:11,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:18:11,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-02 12:18:12,154 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-02 12:18:12,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-11-02 12:18:12,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:18:12,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-11-02 12:18:17,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:18:17,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:18:17,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:18:17,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2021-11-02 12:18:17,447 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-02 12:18:17,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2021-11-02 12:18:17,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:18:17,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:18:17,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:18:34,965 WARN L210 SmtUtils]: Spent 16.97s on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2021-11-02 12:18:34,966 INFO L354 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2021-11-02 12:18:34,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 108 [2021-11-02 12:19:50,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:19:50,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:19:50,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:19:51,496 INFO L354 Elim1Store]: treesize reduction 368, result has 13.2 percent of original size [2021-11-02 12:19:51,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 189 treesize of output 163 [2021-11-02 12:20:05,674 INFO L354 Elim1Store]: treesize reduction 483, result has 3.6 percent of original size [2021-11-02 12:20:05,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 153 treesize of output 89 [2021-11-02 12:20:05,866 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:20:05,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:20:25,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_save_byte_from_array_~storage.offset (_ BitVec 64)) (|ULTIMATE.start_nondet_size_t_#res| (_ BitVec 64)) (ULTIMATE.start_save_byte_from_array_~array.offset (_ BitVec 64))) (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base (let ((.cse3 ((_ extract 63 32) |ULTIMATE.start_nondet_size_t_#res|))) (let ((.cse2 (store (store (select |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset ((_ extract 31 0) |ULTIMATE.start_nondet_size_t_#res|)) (bvadd ULTIMATE.start_save_byte_from_array_~storage.offset (_ bv4 64)) .cse3))) (store .cse2 (bvadd (_ bv8 64) ULTIMATE.start_save_byte_from_array_~storage.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base .cse2) c_ULTIMATE.start_save_byte_from_array_~array.base) (bvadd (concat .cse3 (select .cse2 ULTIMATE.start_save_byte_from_array_~storage.offset)) ULTIMATE.start_save_byte_from_array_~array.offset)))))))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.offset|)))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_ULTIMATE.start_aws_array_eq_harness_~lhs~0.base) (bvadd (concat (select .cse0 (bvadd |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.offset| (_ bv4 64))) (select .cse0 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.offset|)) c_ULTIMATE.start_aws_array_eq_harness_~lhs~0.offset)))))))) is different from false [2021-11-02 12:20:27,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_save_byte_from_array_~storage.offset (_ BitVec 64)) (|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20| (_ BitVec 64)) (|ULTIMATE.start_nondet_size_t_#res| (_ BitVec 64)) (ULTIMATE.start_save_byte_from_array_~array.offset (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20|)))) (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20|)) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20| (let ((.cse3 ((_ extract 63 32) |ULTIMATE.start_nondet_size_t_#res|))) (let ((.cse2 (store (store (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20|) ULTIMATE.start_save_byte_from_array_~storage.offset ((_ extract 31 0) |ULTIMATE.start_nondet_size_t_#res|)) (bvadd ULTIMATE.start_save_byte_from_array_~storage.offset (_ bv4 64)) .cse3))) (store .cse2 (bvadd (_ bv8 64) ULTIMATE.start_save_byte_from_array_~storage.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20| .cse2) c_ULTIMATE.start_aws_array_eq_harness_~rhs~0.base) (bvadd (concat .cse3 (select .cse2 ULTIMATE.start_save_byte_from_array_~storage.offset)) ULTIMATE.start_save_byte_from_array_~array.offset)))))))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_ULTIMATE.start_aws_array_eq_harness_~lhs~0.base) (bvadd (concat (select .cse1 (bvadd |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.offset| (_ bv4 64))) (select .cse1 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.offset|)) c_ULTIMATE.start_aws_array_eq_harness_~lhs~0.offset)))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.offset|))))))))) is different from false [2021-11-02 12:20:29,551 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_save_byte_from_array_~array.offset_40 (_ BitVec 64)) (|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20| (_ BitVec 64)) (v_ULTIMATE.start_save_byte_from_array_~storage.offset_42 (_ BitVec 64)) (|ULTIMATE.start_nondet_size_t_#res| (_ BitVec 64))) (or (let ((.cse1 (let ((.cse2 (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base (let ((.cse5 (select |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base))) (store .cse5 (bvadd (_ bv8 64) c_ULTIMATE.start_save_byte_from_array_~storage.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~array.base) (bvadd (concat (select .cse5 (bvadd c_ULTIMATE.start_save_byte_from_array_~storage.offset (_ bv4 64))) (select .cse5 c_ULTIMATE.start_save_byte_from_array_~storage.offset)) c_ULTIMATE.start_save_byte_from_array_~array.offset))))))))) (store .cse2 |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20| (let ((.cse4 ((_ extract 63 32) |ULTIMATE.start_nondet_size_t_#res|))) (let ((.cse3 (store (store (select .cse2 |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20|) v_ULTIMATE.start_save_byte_from_array_~storage.offset_42 ((_ extract 31 0) |ULTIMATE.start_nondet_size_t_#res|)) (bvadd v_ULTIMATE.start_save_byte_from_array_~storage.offset_42 (_ bv4 64)) .cse4))) (store .cse3 (bvadd (_ bv8 64) v_ULTIMATE.start_save_byte_from_array_~storage.offset_42) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store .cse2 |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20| .cse3) c_ULTIMATE.start_aws_array_eq_harness_~rhs~0.base) (bvadd v_ULTIMATE.start_save_byte_from_array_~array.offset_40 (concat .cse4 (select .cse3 v_ULTIMATE.start_save_byte_from_array_~storage.offset_42))))))))))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.offset|)))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_ULTIMATE.start_aws_array_eq_harness_~lhs~0.base) (bvadd c_ULTIMATE.start_aws_array_eq_harness_~lhs~0.offset (concat (select .cse0 (bvadd |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.offset| (_ bv4 64))) (select .cse0 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0.offset|))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20|)))) (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0.base_20|)))) is different from false