./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc --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 4e0b4bb78430cd3ff87fa852dcd49e649016647ef60f492a14a048040c1b0a8a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:04:52,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:04:52,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:04:52,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:04:52,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:04:52,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:04:52,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:04:52,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:04:52,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:04:52,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:04:52,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:04:52,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:04:52,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:04:52,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:04:52,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:04:52,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:04:52,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:04:52,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:04:52,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:04:52,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:04:52,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:04:52,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:04:52,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:04:52,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:04:52,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:04:52,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:04:52,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:04:52,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:04:52,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:04:52,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:04:52,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:04:52,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:04:52,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:04:52,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:04:52,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:04:52,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:04:52,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:04:52,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:04:52,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:04:52,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:04:52,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:04:52,895 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 21:04:52,941 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:04:52,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:04:52,946 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:04:52,946 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:04:52,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:04:52,948 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:04:52,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:04:52,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:04:52,949 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:04:52,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:04:52,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:04:52,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:04:52,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:04:52,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:04:52,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:04:52,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:04:52,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:04:52,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:04:52,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:04:52,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:04:52,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:04:52,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:52,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:04:52,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:04:52,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:04:52,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:04:52,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:04:52,955 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:04:52,956 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:04:52,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:04:52,958 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc 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 -> 4e0b4bb78430cd3ff87fa852dcd49e649016647ef60f492a14a048040c1b0a8a [2022-11-02 21:04:53,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:04:53,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:04:53,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:04:53,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:04:53,336 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:04:53,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i [2022-11-02 21:04:53,420 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/data/13dd78706/c19aba47f2964ce6936fa020aba85579/FLAG1bd8ee253 [2022-11-02 21:04:54,420 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:04:54,423 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i [2022-11-02 21:04:54,486 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/data/13dd78706/c19aba47f2964ce6936fa020aba85579/FLAG1bd8ee253 [2022-11-02 21:04:54,906 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/data/13dd78706/c19aba47f2964ce6936fa020aba85579 [2022-11-02 21:04:54,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:04:54,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:04:54,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:54,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:04:54,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:04:54,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:54" (1/1) ... [2022-11-02 21:04:54,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bba1dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:54, skipping insertion in model container [2022-11-02 21:04:54,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:54" (1/1) ... [2022-11-02 21:04:54,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:04:55,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:04:55,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i[152066,152079] [2022-11-02 21:04:56,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:56,641 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:04:56,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i[152066,152079] [2022-11-02 21:04:57,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:57,352 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:04:57,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57 WrapperNode [2022-11-02 21:04:57,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:57,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:57,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:04:57,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:04:57,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,525 INFO L138 Inliner]: procedures = 141, calls = 724, calls flagged for inlining = 69, calls inlined = 55, statements flattened = 1676 [2022-11-02 21:04:57,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:57,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:04:57,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:04:57,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:04:57,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,720 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:04:57,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:04:57,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:04:57,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:04:57,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (1/1) ... [2022-11-02 21:04:57,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:57,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:57,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:04:57,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:04:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 21:04:57,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 21:04:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:04:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_write_cmdreg [2022-11-02 21:04:57,899 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_write_cmdreg [2022-11-02 21:04:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-11-02 21:04:57,900 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-11-02 21:04:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-02 21:04:57,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-02 21:04:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-02 21:04:57,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-02 21:04:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 21:04:57,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 21:04:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:04:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure set_reset_mode [2022-11-02 21:04:57,901 INFO L138 BoogieDeclarations]: Found implementation of procedure set_reset_mode [2022-11-02 21:04:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 21:04:57,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 21:04:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 21:04:57,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 21:04:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-02 21:04:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-02 21:04:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 21:04:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 21:04:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_is_absent [2022-11-02 21:04:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_is_absent [2022-11-02 21:04:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-02 21:04:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-02 21:04:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:04:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-02 21:04:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-02 21:04:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-11-02 21:04:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-11-02 21:04:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:04:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-11-02 21:04:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-11-02 21:04:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:04:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:04:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-11-02 21:04:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-11-02 21:04:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:04:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:04:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:04:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-02 21:04:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-02 21:04:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2022-11-02 21:04:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2022-11-02 21:04:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:04:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:04:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-02 21:04:57,909 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-02 21:04:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-02 21:04:57,909 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-02 21:04:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-11-02 21:04:57,910 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-11-02 21:04:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:04:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_start [2022-11-02 21:04:57,912 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_start [2022-11-02 21:04:57,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 21:04:57,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 21:04:57,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:04:57,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:04:57,913 INFO L130 BoogieDeclarations]: Found specification of procedure can_change_mtu [2022-11-02 21:04:57,914 INFO L138 BoogieDeclarations]: Found implementation of procedure can_change_mtu [2022-11-02 21:04:58,481 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:04:58,483 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:04:59,689 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 21:05:00,471 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:05:00,485 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:05:00,486 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 21:05:00,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:00 BoogieIcfgContainer [2022-11-02 21:05:00,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:05:00,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:05:00,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:05:00,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:05:00,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:04:54" (1/3) ... [2022-11-02 21:05:00,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb19189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:00, skipping insertion in model container [2022-11-02 21:05:00,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:57" (2/3) ... [2022-11-02 21:05:00,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb19189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:00, skipping insertion in model container [2022-11-02 21:05:00,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:00" (3/3) ... [2022-11-02 21:05:00,506 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i [2022-11-02 21:05:00,527 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:05:00,528 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:05:00,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:05:00,608 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@dcb1696, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:05:00,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:05:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 371 states have (on average 1.3557951482479784) internal successors, (503), 382 states have internal predecessors, (503), 113 states have call successors, (113), 26 states have call predecessors, (113), 25 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2022-11-02 21:05:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 21:05:00,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:00,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:00,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:00,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash 191472402, now seen corresponding path program 1 times [2022-11-02 21:05:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:00,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487776409] [2022-11-02 21:05:00,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:00,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:01,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487776409] [2022-11-02 21:05:01,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487776409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:01,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:01,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:05:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255106746] [2022-11-02 21:05:01,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:01,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:05:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:01,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:05:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:05:01,459 INFO L87 Difference]: Start difference. First operand has 511 states, 371 states have (on average 1.3557951482479784) internal successors, (503), 382 states have internal predecessors, (503), 113 states have call successors, (113), 26 states have call predecessors, (113), 25 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:05:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:03,839 INFO L93 Difference]: Finished difference Result 1593 states and 2306 transitions. [2022-11-02 21:05:03,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:05:03,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-02 21:05:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:03,884 INFO L225 Difference]: With dead ends: 1593 [2022-11-02 21:05:03,890 INFO L226 Difference]: Without dead ends: 1069 [2022-11-02 21:05:03,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:03,913 INFO L413 NwaCegarLoop]: 777 mSDtfsCounter, 859 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:03,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1528 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-02 21:05:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2022-11-02 21:05:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 973. [2022-11-02 21:05:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 713 states have (on average 1.329593267882188) internal successors, (948), 721 states have internal predecessors, (948), 212 states have call successors, (212), 48 states have call predecessors, (212), 47 states have return successors, (211), 209 states have call predecessors, (211), 211 states have call successors, (211) [2022-11-02 21:05:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1371 transitions. [2022-11-02 21:05:04,067 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1371 transitions. Word has length 22 [2022-11-02 21:05:04,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:04,075 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1371 transitions. [2022-11-02 21:05:04,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:05:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1371 transitions. [2022-11-02 21:05:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 21:05:04,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:04,086 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:05:04,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:05:04,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash 824111555, now seen corresponding path program 1 times [2022-11-02 21:05:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:04,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415454789] [2022-11-02 21:05:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:04,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:04,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:04,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:04,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415454789] [2022-11-02 21:05:04,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415454789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:04,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:04,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:05:04,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819625826] [2022-11-02 21:05:04,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:04,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:05:04,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:04,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:05:04,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:04,444 INFO L87 Difference]: Start difference. First operand 973 states and 1371 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:05:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:06,387 INFO L93 Difference]: Finished difference Result 2035 states and 2876 transitions. [2022-11-02 21:05:06,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:05:06,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-02 21:05:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:06,400 INFO L225 Difference]: With dead ends: 2035 [2022-11-02 21:05:06,401 INFO L226 Difference]: Without dead ends: 1068 [2022-11-02 21:05:06,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:06,415 INFO L413 NwaCegarLoop]: 874 mSDtfsCounter, 937 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:06,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1786 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 21:05:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-11-02 21:05:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 972. [2022-11-02 21:05:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 712 states have (on average 1.3258426966292134) internal successors, (944), 720 states have internal predecessors, (944), 212 states have call successors, (212), 48 states have call predecessors, (212), 47 states have return successors, (211), 209 states have call predecessors, (211), 211 states have call successors, (211) [2022-11-02 21:05:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1367 transitions. [2022-11-02 21:05:06,525 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1367 transitions. Word has length 25 [2022-11-02 21:05:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:06,525 INFO L495 AbstractCegarLoop]: Abstraction has 972 states and 1367 transitions. [2022-11-02 21:05:06,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:05:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1367 transitions. [2022-11-02 21:05:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:05:06,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:06,536 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:06,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:05:06,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:06,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash 395295294, now seen corresponding path program 1 times [2022-11-02 21:05:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:06,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825373733] [2022-11-02 21:05:06,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:06,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:06,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:05:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:05:06,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:06,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825373733] [2022-11-02 21:05:06,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825373733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:06,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:06,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:06,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308454538] [2022-11-02 21:05:06,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:06,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:06,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:06,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:06,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:06,940 INFO L87 Difference]: Start difference. First operand 972 states and 1367 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:05:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:09,495 INFO L93 Difference]: Finished difference Result 2116 states and 3022 transitions. [2022-11-02 21:05:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:09,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-02 21:05:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:09,510 INFO L225 Difference]: With dead ends: 2116 [2022-11-02 21:05:09,511 INFO L226 Difference]: Without dead ends: 2109 [2022-11-02 21:05:09,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:05:09,524 INFO L413 NwaCegarLoop]: 811 mSDtfsCounter, 837 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:09,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 2553 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:05:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2022-11-02 21:05:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1927. [2022-11-02 21:05:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1408 states have (on average 1.3274147727272727) internal successors, (1869), 1426 states have internal predecessors, (1869), 422 states have call successors, (422), 95 states have call predecessors, (422), 96 states have return successors, (447), 417 states have call predecessors, (447), 421 states have call successors, (447) [2022-11-02 21:05:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2738 transitions. [2022-11-02 21:05:09,713 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2738 transitions. Word has length 39 [2022-11-02 21:05:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:09,716 INFO L495 AbstractCegarLoop]: Abstraction has 1927 states and 2738 transitions. [2022-11-02 21:05:09,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:05:09,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2738 transitions. [2022-11-02 21:05:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 21:05:09,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:09,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:09,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:05:09,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash 865162911, now seen corresponding path program 1 times [2022-11-02 21:05:09,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:09,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258813237] [2022-11-02 21:05:09,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:09,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:09,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:05:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:09,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:05:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:09,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:09,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:05:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:05:09,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:09,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258813237] [2022-11-02 21:05:09,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258813237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:09,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:09,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:05:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487393393] [2022-11-02 21:05:09,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:09,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:05:09,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:09,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:05:09,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:09,953 INFO L87 Difference]: Start difference. First operand 1927 states and 2738 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:05:12,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:12,848 INFO L93 Difference]: Finished difference Result 4756 states and 6804 transitions. [2022-11-02 21:05:12,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:05:12,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2022-11-02 21:05:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:12,872 INFO L225 Difference]: With dead ends: 4756 [2022-11-02 21:05:12,872 INFO L226 Difference]: Without dead ends: 2835 [2022-11-02 21:05:12,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:05:12,884 INFO L413 NwaCegarLoop]: 691 mSDtfsCounter, 1014 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:12,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 1627 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:05:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-11-02 21:05:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2337. [2022-11-02 21:05:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 1727 states have (on average 1.3184713375796178) internal successors, (2277), 1749 states have internal predecessors, (2277), 472 states have call successors, (472), 122 states have call predecessors, (472), 137 states have return successors, (532), 479 states have call predecessors, (532), 471 states have call successors, (532) [2022-11-02 21:05:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3281 transitions. [2022-11-02 21:05:13,074 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3281 transitions. Word has length 75 [2022-11-02 21:05:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:13,074 INFO L495 AbstractCegarLoop]: Abstraction has 2337 states and 3281 transitions. [2022-11-02 21:05:13,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:05:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3281 transitions. [2022-11-02 21:05:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 21:05:13,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:13,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:13,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:05:13,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:13,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:13,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1950464579, now seen corresponding path program 2 times [2022-11-02 21:05:13,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:13,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706432029] [2022-11-02 21:05:13,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:13,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:13,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:05:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:13,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:05:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:13,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:05:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:05:13,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:13,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706432029] [2022-11-02 21:05:13,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706432029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:13,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:13,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:05:13,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822386551] [2022-11-02 21:05:13,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:13,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:05:13,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:13,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:05:13,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:13,450 INFO L87 Difference]: Start difference. First operand 2337 states and 3281 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 21:05:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:16,837 INFO L93 Difference]: Finished difference Result 5332 states and 7628 transitions. [2022-11-02 21:05:16,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:05:16,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 75 [2022-11-02 21:05:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:16,861 INFO L225 Difference]: With dead ends: 5332 [2022-11-02 21:05:16,861 INFO L226 Difference]: Without dead ends: 3649 [2022-11-02 21:05:16,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:05:16,872 INFO L413 NwaCegarLoop]: 1018 mSDtfsCounter, 772 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:16,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 2252 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 21:05:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2022-11-02 21:05:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3008. [2022-11-02 21:05:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 2234 states have (on average 1.3196060877350044) internal successors, (2948), 2262 states have internal predecessors, (2948), 595 states have call successors, (595), 158 states have call predecessors, (595), 178 states have return successors, (673), 605 states have call predecessors, (673), 594 states have call successors, (673) [2022-11-02 21:05:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4216 transitions. [2022-11-02 21:05:17,113 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4216 transitions. Word has length 75 [2022-11-02 21:05:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:17,115 INFO L495 AbstractCegarLoop]: Abstraction has 3008 states and 4216 transitions. [2022-11-02 21:05:17,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 21:05:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4216 transitions. [2022-11-02 21:05:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-02 21:05:17,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:17,122 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:17,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:05:17,123 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:17,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:17,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1867198755, now seen corresponding path program 1 times [2022-11-02 21:05:17,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:17,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517231954] [2022-11-02 21:05:17,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:17,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:05:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:05:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 21:05:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 21:05:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:17,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517231954] [2022-11-02 21:05:17,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517231954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:17,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:17,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:05:17,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267510592] [2022-11-02 21:05:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:17,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:05:17,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:17,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:05:17,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:17,392 INFO L87 Difference]: Start difference. First operand 3008 states and 4216 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:05:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:20,789 INFO L93 Difference]: Finished difference Result 6829 states and 9736 transitions. [2022-11-02 21:05:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:05:20,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2022-11-02 21:05:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:20,821 INFO L225 Difference]: With dead ends: 6829 [2022-11-02 21:05:20,822 INFO L226 Difference]: Without dead ends: 4475 [2022-11-02 21:05:20,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:05:20,837 INFO L413 NwaCegarLoop]: 1018 mSDtfsCounter, 882 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:20,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 2253 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 21:05:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2022-11-02 21:05:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 3691. [2022-11-02 21:05:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 2749 states have (on average 1.3193888686795199) internal successors, (3627), 2783 states have internal predecessors, (3627), 718 states have call successors, (718), 198 states have call predecessors, (718), 223 states have return successors, (814), 731 states have call predecessors, (814), 717 states have call successors, (814) [2022-11-02 21:05:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 5159 transitions. [2022-11-02 21:05:21,158 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 5159 transitions. Word has length 88 [2022-11-02 21:05:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:21,161 INFO L495 AbstractCegarLoop]: Abstraction has 3691 states and 5159 transitions. [2022-11-02 21:05:21,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:05:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 5159 transitions. [2022-11-02 21:05:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 21:05:21,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:21,177 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:21,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:05:21,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash -845511377, now seen corresponding path program 1 times [2022-11-02 21:05:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:21,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126763832] [2022-11-02 21:05:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:05:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 21:05:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 21:05:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:05:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 21:05:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:05:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 21:05:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:21,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126763832] [2022-11-02 21:05:21,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126763832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:21,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:21,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:21,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780133486] [2022-11-02 21:05:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:21,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:21,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:21,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:21,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:21,492 INFO L87 Difference]: Start difference. First operand 3691 states and 5159 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 21:05:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:24,207 INFO L93 Difference]: Finished difference Result 8242 states and 11825 transitions. [2022-11-02 21:05:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2022-11-02 21:05:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:24,237 INFO L225 Difference]: With dead ends: 8242 [2022-11-02 21:05:24,238 INFO L226 Difference]: Without dead ends: 4564 [2022-11-02 21:05:24,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:05:24,269 INFO L413 NwaCegarLoop]: 673 mSDtfsCounter, 364 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:24,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1997 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:05:24,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2022-11-02 21:05:24,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 3701. [2022-11-02 21:05:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 2759 states have (on average 1.3182312432040595) internal successors, (3637), 2793 states have internal predecessors, (3637), 718 states have call successors, (718), 198 states have call predecessors, (718), 223 states have return successors, (814), 731 states have call predecessors, (814), 717 states have call successors, (814) [2022-11-02 21:05:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 5169 transitions. [2022-11-02 21:05:24,556 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 5169 transitions. Word has length 127 [2022-11-02 21:05:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:24,557 INFO L495 AbstractCegarLoop]: Abstraction has 3701 states and 5169 transitions. [2022-11-02 21:05:24,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 21:05:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 5169 transitions. [2022-11-02 21:05:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-02 21:05:24,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:24,570 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:24,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:05:24,571 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash -310397959, now seen corresponding path program 1 times [2022-11-02 21:05:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:24,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518622221] [2022-11-02 21:05:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:05:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:05:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:05:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:05:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:05:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:05:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:05:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:05:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:05:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:05:25,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:25,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518622221] [2022-11-02 21:05:25,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518622221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:25,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:25,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:05:25,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517989065] [2022-11-02 21:05:25,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:25,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:05:25,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:25,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:05:25,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:25,112 INFO L87 Difference]: Start difference. First operand 3701 states and 5169 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-02 21:05:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:29,734 INFO L93 Difference]: Finished difference Result 12319 states and 17817 transitions. [2022-11-02 21:05:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:05:29,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 130 [2022-11-02 21:05:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:29,794 INFO L225 Difference]: With dead ends: 12319 [2022-11-02 21:05:29,794 INFO L226 Difference]: Without dead ends: 8631 [2022-11-02 21:05:29,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:05:29,829 INFO L413 NwaCegarLoop]: 751 mSDtfsCounter, 1626 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 961 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 961 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:29,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 2197 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [961 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-02 21:05:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8631 states. [2022-11-02 21:05:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8631 to 6737. [2022-11-02 21:05:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6737 states, 5022 states have (on average 1.3136200716845878) internal successors, (6597), 5084 states have internal predecessors, (6597), 1310 states have call successors, (1310), 358 states have call predecessors, (1310), 404 states have return successors, (1485), 1334 states have call predecessors, (1485), 1309 states have call successors, (1485) [2022-11-02 21:05:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6737 states to 6737 states and 9392 transitions. [2022-11-02 21:05:30,580 INFO L78 Accepts]: Start accepts. Automaton has 6737 states and 9392 transitions. Word has length 130 [2022-11-02 21:05:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:30,581 INFO L495 AbstractCegarLoop]: Abstraction has 6737 states and 9392 transitions. [2022-11-02 21:05:30,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-02 21:05:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 6737 states and 9392 transitions. [2022-11-02 21:05:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:05:30,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:30,599 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:30,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:05:30,599 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:30,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash 394590841, now seen corresponding path program 1 times [2022-11-02 21:05:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:30,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822545427] [2022-11-02 21:05:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:30,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:05:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 21:05:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 21:05:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:05:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 21:05:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 21:05:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 21:05:30,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:30,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822545427] [2022-11-02 21:05:30,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822545427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:30,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:30,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:30,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176753955] [2022-11-02 21:05:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:30,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:30,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:30,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:30,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:30,882 INFO L87 Difference]: Start difference. First operand 6737 states and 9392 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-02 21:05:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:33,303 INFO L93 Difference]: Finished difference Result 11834 states and 16924 transitions. [2022-11-02 21:05:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:05:33,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 128 [2022-11-02 21:05:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:33,342 INFO L225 Difference]: With dead ends: 11834 [2022-11-02 21:05:33,342 INFO L226 Difference]: Without dead ends: 8156 [2022-11-02 21:05:33,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:05:33,368 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 570 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:33,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1656 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 21:05:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8156 states. [2022-11-02 21:05:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8156 to 6755. [2022-11-02 21:05:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6755 states, 5040 states have (on average 1.3125) internal successors, (6615), 5102 states have internal predecessors, (6615), 1310 states have call successors, (1310), 358 states have call predecessors, (1310), 404 states have return successors, (1485), 1334 states have call predecessors, (1485), 1309 states have call successors, (1485) [2022-11-02 21:05:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6755 states to 6755 states and 9410 transitions. [2022-11-02 21:05:34,011 INFO L78 Accepts]: Start accepts. Automaton has 6755 states and 9410 transitions. Word has length 128 [2022-11-02 21:05:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:34,013 INFO L495 AbstractCegarLoop]: Abstraction has 6755 states and 9410 transitions. [2022-11-02 21:05:34,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-02 21:05:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 6755 states and 9410 transitions. [2022-11-02 21:05:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-02 21:05:34,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:34,027 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:34,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:05:34,027 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:34,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 74024474, now seen corresponding path program 1 times [2022-11-02 21:05:34,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:34,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841397812] [2022-11-02 21:05:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:05:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 21:05:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 21:05:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:05:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 21:05:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 21:05:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 21:05:34,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:34,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841397812] [2022-11-02 21:05:34,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841397812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:34,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:34,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:05:34,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927648401] [2022-11-02 21:05:34,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:34,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:05:34,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:34,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:05:34,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:05:34,719 INFO L87 Difference]: Start difference. First operand 6755 states and 9410 transitions. Second operand has 10 states, 9 states have (on average 9.444444444444445) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 21:05:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:38,103 INFO L93 Difference]: Finished difference Result 10712 states and 15154 transitions. [2022-11-02 21:05:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:38,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.444444444444445) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 130 [2022-11-02 21:05:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:38,107 INFO L225 Difference]: With dead ends: 10712 [2022-11-02 21:05:38,107 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 21:05:38,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:05:38,146 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1227 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 828 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 828 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:38,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2158 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [828 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-02 21:05:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 21:05:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 21:05:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 21:05:38,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2022-11-02 21:05:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:38,153 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 21:05:38,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.444444444444445) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 21:05:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 21:05:38,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 21:05:38,156 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 21:05:38,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:05:38,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 21:06:48,231 INFO L895 garLoopResultBuilder]: At program point ldv_skb_free_intENTRY(lines 6870 6876) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,232 INFO L899 garLoopResultBuilder]: For program point ldv_skb_free_intFINAL(lines 6870 6876) no Hoare annotation was computed. [2022-11-02 21:06:48,232 INFO L899 garLoopResultBuilder]: For program point ldv_skb_free_intEXIT(lines 6870 6876) no Hoare annotation was computed. [2022-11-02 21:06:48,232 INFO L899 garLoopResultBuilder]: For program point L6873-1(line 6873) no Hoare annotation was computed. [2022-11-02 21:06:48,232 INFO L895 garLoopResultBuilder]: At program point L6873(line 6873) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,232 INFO L899 garLoopResultBuilder]: For program point __const_udelayFINAL(lines 6920 6922) no Hoare annotation was computed. [2022-11-02 21:06:48,232 INFO L899 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 6920 6922) no Hoare annotation was computed. [2022-11-02 21:06:48,232 INFO L902 garLoopResultBuilder]: At program point __const_udelayENTRY(lines 6920 6922) the Hoare annotation is: true [2022-11-02 21:06:48,233 INFO L895 garLoopResultBuilder]: At program point L5598(line 5598) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,233 INFO L895 garLoopResultBuilder]: At program point L5600(lines 5582 5607) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,233 INFO L899 garLoopResultBuilder]: For program point L5596-1(line 5596) no Hoare annotation was computed. [2022-11-02 21:06:48,233 INFO L899 garLoopResultBuilder]: For program point set_reset_modeFINAL(lines 5575 5608) no Hoare annotation was computed. [2022-11-02 21:06:48,234 INFO L895 garLoopResultBuilder]: At program point L5597(line 5597) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,234 INFO L899 garLoopResultBuilder]: For program point L5598-1(line 5598) no Hoare annotation was computed. [2022-11-02 21:06:48,234 INFO L895 garLoopResultBuilder]: At program point L5596(line 5596) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,234 INFO L899 garLoopResultBuilder]: For program point L5597-1(line 5597) no Hoare annotation was computed. [2022-11-02 21:06:48,235 INFO L899 garLoopResultBuilder]: For program point set_reset_modeEXIT(lines 5575 5608) no Hoare annotation was computed. [2022-11-02 21:06:48,235 INFO L895 garLoopResultBuilder]: At program point L5587(line 5587) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,235 INFO L899 garLoopResultBuilder]: For program point L5587-1(line 5587) no Hoare annotation was computed. [2022-11-02 21:06:48,235 INFO L895 garLoopResultBuilder]: At program point L5583(line 5583) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,235 INFO L899 garLoopResultBuilder]: For program point L5583-1(line 5583) no Hoare annotation was computed. [2022-11-02 21:06:48,236 INFO L895 garLoopResultBuilder]: At program point L5585(line 5585) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,236 INFO L899 garLoopResultBuilder]: For program point L5585-1(line 5585) no Hoare annotation was computed. [2022-11-02 21:06:48,236 INFO L895 garLoopResultBuilder]: At program point set_reset_modeENTRY(lines 5575 5608) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,236 INFO L895 garLoopResultBuilder]: At program point L5602(lines 5582 5607) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,237 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 5293 5299) no Hoare annotation was computed. [2022-11-02 21:06:48,237 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 5293 5299) the Hoare annotation is: true [2022-11-02 21:06:48,237 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5297) no Hoare annotation was computed. [2022-11-02 21:06:48,237 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 5293 5299) no Hoare annotation was computed. [2022-11-02 21:06:48,238 INFO L899 garLoopResultBuilder]: For program point L6014(lines 6014 6017) no Hoare annotation was computed. [2022-11-02 21:06:48,238 INFO L895 garLoopResultBuilder]: At program point L6113(line 6113) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,238 INFO L899 garLoopResultBuilder]: For program point L6113-1(line 6113) no Hoare annotation was computed. [2022-11-02 21:06:48,238 INFO L899 garLoopResultBuilder]: For program point L6146-2(lines 6065 6166) no Hoare annotation was computed. [2022-11-02 21:06:48,239 INFO L895 garLoopResultBuilder]: At program point L5882(lines 5813 5884) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,239 INFO L899 garLoopResultBuilder]: For program point L6014-2(lines 6014 6017) no Hoare annotation was computed. [2022-11-02 21:06:48,239 INFO L895 garLoopResultBuilder]: At program point ldv_irq_1ENTRY(lines 6349 6374) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~LDV_IN_INTERRUPT~0)| ~LDV_IN_INTERRUPT~0) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,239 INFO L899 garLoopResultBuilder]: For program point L6031(lines 6031 6037) no Hoare annotation was computed. [2022-11-02 21:06:48,240 INFO L899 garLoopResultBuilder]: For program point L5965(lines 5965 5979) no Hoare annotation was computed. [2022-11-02 21:06:48,240 INFO L899 garLoopResultBuilder]: For program point L6031-2(lines 6031 6037) no Hoare annotation was computed. [2022-11-02 21:06:48,240 INFO L895 garLoopResultBuilder]: At program point L6147(line 6147) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-02 21:06:48,240 INFO L899 garLoopResultBuilder]: For program point L6114(lines 6114 6121) no Hoare annotation was computed. [2022-11-02 21:06:48,240 INFO L899 garLoopResultBuilder]: For program point L6147-1(line 6147) no Hoare annotation was computed. [2022-11-02 21:06:48,241 INFO L899 garLoopResultBuilder]: For program point L6131(lines 6131 6134) no Hoare annotation was computed. [2022-11-02 21:06:48,241 INFO L899 garLoopResultBuilder]: For program point L5966(line 5966) no Hoare annotation was computed. [2022-11-02 21:06:48,241 INFO L895 garLoopResultBuilder]: At program point L5834(line 5834) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,241 INFO L895 garLoopResultBuilder]: At program point L5933(line 5933) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,242 INFO L895 garLoopResultBuilder]: At program point L6957(lines 6956 6958) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,242 INFO L899 garLoopResultBuilder]: For program point L5834-1(line 5834) no Hoare annotation was computed. [2022-11-02 21:06:48,242 INFO L895 garLoopResultBuilder]: At program point L6115(line 6115) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,242 INFO L895 garLoopResultBuilder]: At program point L6082(line 6082) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,242 INFO L899 garLoopResultBuilder]: For program point L6115-1(line 6115) no Hoare annotation was computed. [2022-11-02 21:06:48,243 INFO L899 garLoopResultBuilder]: For program point L6082-1(line 6082) no Hoare annotation was computed. [2022-11-02 21:06:48,243 INFO L895 garLoopResultBuilder]: At program point L6941-2(lines 6940 6942) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,243 INFO L899 garLoopResultBuilder]: For program point L6941-1(line 6941) no Hoare annotation was computed. [2022-11-02 21:06:48,243 INFO L899 garLoopResultBuilder]: For program point L5917(lines 5917 5935) no Hoare annotation was computed. [2022-11-02 21:06:48,244 INFO L895 garLoopResultBuilder]: At program point L6941(line 6941) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,244 INFO L899 garLoopResultBuilder]: For program point L5917-1(lines 5907 6047) no Hoare annotation was computed. [2022-11-02 21:06:48,244 INFO L895 garLoopResultBuilder]: At program point L6165(lines 6049 6167) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-02 21:06:48,244 INFO L899 garLoopResultBuilder]: For program point L6033-2(line 6033) no Hoare annotation was computed. [2022-11-02 21:06:48,244 INFO L899 garLoopResultBuilder]: For program point L6033(line 6033) no Hoare annotation was computed. [2022-11-02 21:06:48,244 INFO L899 garLoopResultBuilder]: For program point L5868-1(line 5868) no Hoare annotation was computed. [2022-11-02 21:06:48,245 INFO L895 garLoopResultBuilder]: At program point L5868(line 5868) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,245 INFO L899 garLoopResultBuilder]: For program point L6083(lines 6083 6090) no Hoare annotation was computed. [2022-11-02 21:06:48,245 INFO L899 garLoopResultBuilder]: For program point L6116(lines 6116 6119) no Hoare annotation was computed. [2022-11-02 21:06:48,245 INFO L899 garLoopResultBuilder]: For program point L6083-2(lines 6065 6166) no Hoare annotation was computed. [2022-11-02 21:06:48,246 INFO L895 garLoopResultBuilder]: At program point L6067(line 6067) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,246 INFO L899 garLoopResultBuilder]: For program point L6100-1(line 6100) no Hoare annotation was computed. [2022-11-02 21:06:48,246 INFO L899 garLoopResultBuilder]: For program point L6067-1(line 6067) no Hoare annotation was computed. [2022-11-02 21:06:48,246 INFO L895 garLoopResultBuilder]: At program point L6100(line 6100) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,246 INFO L899 garLoopResultBuilder]: For program point L6150(lines 6150 6164) no Hoare annotation was computed. [2022-11-02 21:06:48,247 INFO L899 garLoopResultBuilder]: For program point L6084-1(line 6084) no Hoare annotation was computed. [2022-11-02 21:06:48,247 INFO L895 garLoopResultBuilder]: At program point L6018(line 6018) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,247 INFO L895 garLoopResultBuilder]: At program point L6084(line 6084) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,247 INFO L899 garLoopResultBuilder]: For program point L6018-1(line 6018) no Hoare annotation was computed. [2022-11-02 21:06:48,247 INFO L895 garLoopResultBuilder]: At program point L5853(line 5853) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,248 INFO L899 garLoopResultBuilder]: For program point L5853-1(line 5853) no Hoare annotation was computed. [2022-11-02 21:06:48,248 INFO L895 garLoopResultBuilder]: At program point L5870(lines 5862 5875) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,248 INFO L899 garLoopResultBuilder]: For program point L5969(line 5969) no Hoare annotation was computed. [2022-11-02 21:06:48,248 INFO L899 garLoopResultBuilder]: For program point L5936(lines 5907 6047) no Hoare annotation was computed. [2022-11-02 21:06:48,248 INFO L899 garLoopResultBuilder]: For program point L6085(lines 6085 6088) no Hoare annotation was computed. [2022-11-02 21:06:48,249 INFO L895 garLoopResultBuilder]: At program point L6944-2(lines 6943 6945) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,249 INFO L899 garLoopResultBuilder]: For program point L6366(line 6366) no Hoare annotation was computed. [2022-11-02 21:06:48,249 INFO L899 garLoopResultBuilder]: For program point L6944-1(line 6944) no Hoare annotation was computed. [2022-11-02 21:06:48,249 INFO L895 garLoopResultBuilder]: At program point L5854(line 5854) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,249 INFO L895 garLoopResultBuilder]: At program point L6944(line 6944) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,250 INFO L899 garLoopResultBuilder]: For program point L5953(lines 5953 5957) no Hoare annotation was computed. [2022-11-02 21:06:48,250 INFO L899 garLoopResultBuilder]: For program point L5854-1(line 5854) no Hoare annotation was computed. [2022-11-02 21:06:48,250 INFO L899 garLoopResultBuilder]: For program point L6036-2(line 6036) no Hoare annotation was computed. [2022-11-02 21:06:48,250 INFO L899 garLoopResultBuilder]: For program point L6036(line 6036) no Hoare annotation was computed. [2022-11-02 21:06:48,250 INFO L899 garLoopResultBuilder]: For program point L5871(lines 5871 5874) no Hoare annotation was computed. [2022-11-02 21:06:48,251 INFO L899 garLoopResultBuilder]: For program point L5838(lines 5838 5841) no Hoare annotation was computed. [2022-11-02 21:06:48,251 INFO L895 garLoopResultBuilder]: At program point L6961(lines 6960 6962) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,251 INFO L899 garLoopResultBuilder]: For program point L5987(lines 5907 6047) no Hoare annotation was computed. [2022-11-02 21:06:48,251 INFO L895 garLoopResultBuilder]: At program point L6367(line 6367) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) [2022-11-02 21:06:48,251 INFO L895 garLoopResultBuilder]: At program point L5872(lines 5862 5875) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,252 INFO L899 garLoopResultBuilder]: For program point L6665-1(line 6665) no Hoare annotation was computed. [2022-11-02 21:06:48,252 INFO L895 garLoopResultBuilder]: At program point L6665(line 6665) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,252 INFO L899 garLoopResultBuilder]: For program point L6071(lines 6071 6074) no Hoare annotation was computed. [2022-11-02 21:06:48,252 INFO L899 garLoopResultBuilder]: For program point L6071-2(lines 6071 6074) no Hoare annotation was computed. [2022-11-02 21:06:48,252 INFO L899 garLoopResultBuilder]: For program point L5972(line 5972) no Hoare annotation was computed. [2022-11-02 21:06:48,253 INFO L895 garLoopResultBuilder]: At program point L6666(lines 6661 6668) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,253 INFO L895 garLoopResultBuilder]: At program point L6138(lines 6065 6166) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-02 21:06:48,253 INFO L899 garLoopResultBuilder]: For program point L6072-1(line 6072) no Hoare annotation was computed. [2022-11-02 21:06:48,253 INFO L899 garLoopResultBuilder]: For program point ldv_irq_1FINAL(lines 6349 6374) no Hoare annotation was computed. [2022-11-02 21:06:48,253 INFO L895 garLoopResultBuilder]: At program point L6105(line 6105) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,254 INFO L895 garLoopResultBuilder]: At program point L6072(line 6072) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,254 INFO L899 garLoopResultBuilder]: For program point L6006-1(lines 6006 6024) no Hoare annotation was computed. [2022-11-02 21:06:48,254 INFO L895 garLoopResultBuilder]: At program point L6122(lines 6109 6127) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,254 INFO L899 garLoopResultBuilder]: For program point L5924-1(line 5924) no Hoare annotation was computed. [2022-11-02 21:06:48,255 INFO L895 garLoopResultBuilder]: At program point L5924(line 5924) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,255 INFO L895 garLoopResultBuilder]: At program point L6139(line 6139) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-02 21:06:48,255 INFO L899 garLoopResultBuilder]: For program point L6139-1(line 6139) no Hoare annotation was computed. [2022-11-02 21:06:48,255 INFO L899 garLoopResultBuilder]: For program point L6354(lines 6354 6371) no Hoare annotation was computed. [2022-11-02 21:06:48,255 INFO L899 garLoopResultBuilder]: For program point L5908-1(line 5908) no Hoare annotation was computed. [2022-11-02 21:06:48,256 INFO L895 garLoopResultBuilder]: At program point L5842(line 5842) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,256 INFO L895 garLoopResultBuilder]: At program point L5908(line 5908) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,256 INFO L899 garLoopResultBuilder]: For program point L5842-1(line 5842) no Hoare annotation was computed. [2022-11-02 21:06:48,256 INFO L895 garLoopResultBuilder]: At program point L6354-1(lines 6354 6371) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~LDV_IN_INTERRUPT~0)| ~LDV_IN_INTERRUPT~0) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,256 INFO L899 garLoopResultBuilder]: For program point L5859(line 5859) no Hoare annotation was computed. [2022-11-02 21:06:48,257 INFO L899 garLoopResultBuilder]: For program point L5925-2(lines 5925 5928) no Hoare annotation was computed. [2022-11-02 21:06:48,257 INFO L899 garLoopResultBuilder]: For program point L5925(lines 5925 5928) no Hoare annotation was computed. [2022-11-02 21:06:48,257 INFO L899 garLoopResultBuilder]: For program point L5859-2(line 5859) no Hoare annotation was computed. [2022-11-02 21:06:48,257 INFO L899 garLoopResultBuilder]: For program point L6140(lines 6140 6143) no Hoare annotation was computed. [2022-11-02 21:06:48,257 INFO L899 garLoopResultBuilder]: For program point L5975(line 5975) no Hoare annotation was computed. [2022-11-02 21:06:48,258 INFO L899 garLoopResultBuilder]: For program point L5843(lines 5843 5856) no Hoare annotation was computed. [2022-11-02 21:06:48,258 INFO L899 garLoopResultBuilder]: For program point L5843-2(lines 5843 5856) no Hoare annotation was computed. [2022-11-02 21:06:48,258 INFO L899 garLoopResultBuilder]: For program point L6091-1(lines 6065 6166) no Hoare annotation was computed. [2022-11-02 21:06:48,258 INFO L895 garLoopResultBuilder]: At program point L6157(line 6157) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= ~last_index~0 0)) [2022-11-02 21:06:48,258 INFO L895 garLoopResultBuilder]: At program point L6124(lines 6109 6127) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,259 INFO L899 garLoopResultBuilder]: For program point L6157-1(line 6157) no Hoare annotation was computed. [2022-11-02 21:06:48,259 INFO L895 garLoopResultBuilder]: At program point L6950(lines 6949 6951) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,259 INFO L899 garLoopResultBuilder]: For program point L6025-2(lines 6025 6041) no Hoare annotation was computed. [2022-11-02 21:06:48,259 INFO L899 garLoopResultBuilder]: For program point L6025(lines 6025 6041) no Hoare annotation was computed. [2022-11-02 21:06:48,259 INFO L899 garLoopResultBuilder]: For program point L5860-2(lines 5860 5875) no Hoare annotation was computed. [2022-11-02 21:06:48,260 INFO L899 garLoopResultBuilder]: For program point L5860(lines 5860 5875) no Hoare annotation was computed. [2022-11-02 21:06:48,260 INFO L895 garLoopResultBuilder]: At program point L6075(line 6075) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-02 21:06:48,260 INFO L899 garLoopResultBuilder]: For program point L6075-1(line 6075) no Hoare annotation was computed. [2022-11-02 21:06:48,260 INFO L895 garLoopResultBuilder]: At program point L6141(lines 6065 6166) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,261 INFO L895 garLoopResultBuilder]: At program point L5943(line 5943) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,261 INFO L899 garLoopResultBuilder]: For program point L5943-1(line 5943) no Hoare annotation was computed. [2022-11-02 21:06:48,261 INFO L895 garLoopResultBuilder]: At program point L5877(line 5877) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,261 INFO L899 garLoopResultBuilder]: For program point L6356(lines 6356 6368) no Hoare annotation was computed. [2022-11-02 21:06:48,261 INFO L899 garLoopResultBuilder]: For program point L5877-1(line 5877) no Hoare annotation was computed. [2022-11-02 21:06:48,261 INFO L899 garLoopResultBuilder]: For program point L6158(lines 6158 6162) no Hoare annotation was computed. [2022-11-02 21:06:48,262 INFO L895 garLoopResultBuilder]: At program point L6026(line 6026) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,262 INFO L899 garLoopResultBuilder]: For program point L6026-1(line 6026) no Hoare annotation was computed. [2022-11-02 21:06:48,262 INFO L899 garLoopResultBuilder]: For program point L5960(lines 5907 6047) no Hoare annotation was computed. [2022-11-02 21:06:48,262 INFO L899 garLoopResultBuilder]: For program point L6076(lines 6076 6079) no Hoare annotation was computed. [2022-11-02 21:06:48,262 INFO L899 garLoopResultBuilder]: For program point L6109-1(lines 6065 6166) no Hoare annotation was computed. [2022-11-02 21:06:48,263 INFO L899 garLoopResultBuilder]: For program point L5944-2(lines 5936 5958) no Hoare annotation was computed. [2022-11-02 21:06:48,263 INFO L899 garLoopResultBuilder]: For program point L5944(lines 5944 5947) no Hoare annotation was computed. [2022-11-02 21:06:48,263 INFO L895 garLoopResultBuilder]: At program point L5845(line 5845) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,263 INFO L899 garLoopResultBuilder]: For program point L6357(line 6357) no Hoare annotation was computed. [2022-11-02 21:06:48,263 INFO L899 garLoopResultBuilder]: For program point L5845-1(line 5845) no Hoare annotation was computed. [2022-11-02 21:06:48,264 INFO L895 garLoopResultBuilder]: At program point L5994(line 5994) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,264 INFO L899 garLoopResultBuilder]: For program point L5994-1(line 5994) no Hoare annotation was computed. [2022-11-02 21:06:48,264 INFO L899 garLoopResultBuilder]: For program point L6358(lines 6358 6364) no Hoare annotation was computed. [2022-11-02 21:06:48,264 INFO L895 garLoopResultBuilder]: At program point L5846(line 5846) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,265 INFO L899 garLoopResultBuilder]: For program point L5846-1(line 5846) no Hoare annotation was computed. [2022-11-02 21:06:48,265 INFO L899 garLoopResultBuilder]: For program point L5995(lines 5995 5998) no Hoare annotation was computed. [2022-11-02 21:06:48,265 INFO L899 garLoopResultBuilder]: For program point L6028-1(line 6028) no Hoare annotation was computed. [2022-11-02 21:06:48,265 INFO L895 garLoopResultBuilder]: At program point L6028(line 6028) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,265 INFO L899 garLoopResultBuilder]: For program point L5995-2(lines 5987 6004) no Hoare annotation was computed. [2022-11-02 21:06:48,266 INFO L895 garLoopResultBuilder]: At program point L6144(lines 6065 6166) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-02 21:06:48,266 INFO L895 garLoopResultBuilder]: At program point L5847(line 5847) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,266 INFO L899 garLoopResultBuilder]: For program point L5847-1(line 5847) no Hoare annotation was computed. [2022-11-02 21:06:48,266 INFO L899 garLoopResultBuilder]: For program point L5913(lines 5913 5916) no Hoare annotation was computed. [2022-11-02 21:06:48,266 INFO L899 garLoopResultBuilder]: For program point L6095(lines 6065 6166) no Hoare annotation was computed. [2022-11-02 21:06:48,267 INFO L899 garLoopResultBuilder]: For program point L6673-1(line 6673) no Hoare annotation was computed. [2022-11-02 21:06:48,267 INFO L895 garLoopResultBuilder]: At program point L6673(line 6673) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,267 INFO L895 garLoopResultBuilder]: At program point L5963(line 5963) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,267 INFO L899 garLoopResultBuilder]: For program point L5963-1(line 5963) no Hoare annotation was computed. [2022-11-02 21:06:48,267 INFO L899 garLoopResultBuilder]: For program point ldv_irq_1EXIT(lines 6349 6374) no Hoare annotation was computed. [2022-11-02 21:06:48,268 INFO L895 garLoopResultBuilder]: At program point L6046(lines 5885 6048) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,268 INFO L895 garLoopResultBuilder]: At program point L6013(line 6013) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,268 INFO L895 garLoopResultBuilder]: At program point L5980(lines 5960 5985) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,268 INFO L899 garLoopResultBuilder]: For program point L6013-1(line 6013) no Hoare annotation was computed. [2022-11-02 21:06:48,268 INFO L899 garLoopResultBuilder]: For program point L5848-1(line 5848) no Hoare annotation was computed. [2022-11-02 21:06:48,269 INFO L895 garLoopResultBuilder]: At program point L5881(line 5881) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,269 INFO L895 garLoopResultBuilder]: At program point L5848(line 5848) the Hoare annotation is: (or (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= ~last_index~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,269 INFO L899 garLoopResultBuilder]: For program point L5881-1(line 5881) no Hoare annotation was computed. [2022-11-02 21:06:48,269 INFO L895 garLoopResultBuilder]: At program point L6674(lines 6669 6676) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,270 INFO L895 garLoopResultBuilder]: At program point L6096-2(lines 6096 6104) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (not (= |ldv_irq_1_sja1000_interrupt_~isrc~0#1| (* 256 (div |ldv_irq_1_sja1000_interrupt_~isrc~0#1| 256)))) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,270 INFO L899 garLoopResultBuilder]: For program point L6096(lines 6096 6104) no Hoare annotation was computed. [2022-11-02 21:06:48,270 INFO L899 garLoopResultBuilder]: For program point L6129-1(lines 6129 6136) no Hoare annotation was computed. [2022-11-02 21:06:48,270 INFO L899 garLoopResultBuilder]: For program point L6146(lines 6146 6149) no Hoare annotation was computed. [2022-11-02 21:06:48,270 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,270 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,271 INFO L895 garLoopResultBuilder]: At program point L6976(lines 6975 6977) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,271 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,271 INFO L895 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,271 INFO L895 garLoopResultBuilder]: At program point L6266(lines 6262 6268) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,272 INFO L895 garLoopResultBuilder]: At program point L6314(line 6314) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,272 INFO L902 garLoopResultBuilder]: At program point L7018(lines 7017 7019) the Hoare annotation is: true [2022-11-02 21:06:48,272 INFO L902 garLoopResultBuilder]: At program point L6316(lines 6311 6318) the Hoare annotation is: true [2022-11-02 21:06:48,272 INFO L899 garLoopResultBuilder]: For program point L6314-1(line 6314) no Hoare annotation was computed. [2022-11-02 21:06:48,272 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5300 5306) no Hoare annotation was computed. [2022-11-02 21:06:48,272 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5300 5306) the Hoare annotation is: true [2022-11-02 21:06:48,273 INFO L902 garLoopResultBuilder]: At program point L6938(lines 6937 6939) the Hoare annotation is: true [2022-11-02 21:06:48,273 INFO L902 garLoopResultBuilder]: At program point L6935(lines 6934 6936) the Hoare annotation is: true [2022-11-02 21:06:48,273 INFO L899 garLoopResultBuilder]: For program point sja1000_write_cmdregEXIT(lines 5534 5546) no Hoare annotation was computed. [2022-11-02 21:06:48,273 INFO L902 garLoopResultBuilder]: At program point sja1000_write_cmdregENTRY(lines 5534 5546) the Hoare annotation is: true [2022-11-02 21:06:48,273 INFO L902 garLoopResultBuilder]: At program point L5542(line 5542) the Hoare annotation is: true [2022-11-02 21:06:48,274 INFO L899 garLoopResultBuilder]: For program point sja1000_write_cmdregFINAL(lines 5534 5546) no Hoare annotation was computed. [2022-11-02 21:06:48,274 INFO L902 garLoopResultBuilder]: At program point L5224(lines 5220 5226) the Hoare annotation is: true [2022-11-02 21:06:48,274 INFO L902 garLoopResultBuilder]: At program point L5539(line 5539) the Hoare annotation is: true [2022-11-02 21:06:48,274 INFO L899 garLoopResultBuilder]: For program point L5539-1(line 5539) no Hoare annotation was computed. [2022-11-02 21:06:48,274 INFO L902 garLoopResultBuilder]: At program point L5541(line 5541) the Hoare annotation is: true [2022-11-02 21:06:48,275 INFO L899 garLoopResultBuilder]: For program point L5542-1(line 5542) no Hoare annotation was computed. [2022-11-02 21:06:48,275 INFO L899 garLoopResultBuilder]: For program point L5541-1(line 5541) no Hoare annotation was computed. [2022-11-02 21:06:48,275 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 5307 5312) no Hoare annotation was computed. [2022-11-02 21:06:48,275 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 5307 5312) the Hoare annotation is: true [2022-11-02 21:06:48,275 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 5307 5312) no Hoare annotation was computed. [2022-11-02 21:06:48,276 INFO L899 garLoopResultBuilder]: For program point netdev_privFINAL(lines 5371 5376) no Hoare annotation was computed. [2022-11-02 21:06:48,276 INFO L902 garLoopResultBuilder]: At program point netdev_privENTRY(lines 5371 5376) the Hoare annotation is: true [2022-11-02 21:06:48,276 INFO L899 garLoopResultBuilder]: For program point netdev_privEXIT(lines 5371 5376) no Hoare annotation was computed. [2022-11-02 21:06:48,276 INFO L899 garLoopResultBuilder]: For program point L6749-3(lines 6746 6775) no Hoare annotation was computed. [2022-11-02 21:06:48,276 INFO L895 garLoopResultBuilder]: At program point L6749-2(lines 6749 6760) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 ldv_set_remove_~i~5) (= 0 (+ ldv_set_remove_~deleted_index~0 1)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,277 INFO L899 garLoopResultBuilder]: For program point L6764-1(lines 6764 6767) no Hoare annotation was computed. [2022-11-02 21:06:48,277 INFO L899 garLoopResultBuilder]: For program point L6764(lines 6764 6767) no Hoare annotation was computed. [2022-11-02 21:06:48,277 INFO L899 garLoopResultBuilder]: For program point L6754(lines 6754 6758) no Hoare annotation was computed. [2022-11-02 21:06:48,277 INFO L899 garLoopResultBuilder]: For program point L6750(lines 6750 6753) no Hoare annotation was computed. [2022-11-02 21:06:48,277 INFO L895 garLoopResultBuilder]: At program point ldv_set_removeENTRY(lines 6742 6776) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,278 INFO L899 garLoopResultBuilder]: For program point L6750-1(lines 6750 6753) no Hoare annotation was computed. [2022-11-02 21:06:48,278 INFO L899 garLoopResultBuilder]: For program point L6763-3(lines 6763 6770) no Hoare annotation was computed. [2022-11-02 21:06:48,278 INFO L899 garLoopResultBuilder]: For program point L6761-1(lines 6742 6776) no Hoare annotation was computed. [2022-11-02 21:06:48,278 INFO L895 garLoopResultBuilder]: At program point L6763-2(lines 6763 6770) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-02 21:06:48,278 INFO L899 garLoopResultBuilder]: For program point ldv_set_removeEXIT(lines 6742 6776) no Hoare annotation was computed. [2022-11-02 21:06:48,279 INFO L899 garLoopResultBuilder]: For program point netdev_get_tx_queueEXIT(lines 5364 5370) no Hoare annotation was computed. [2022-11-02 21:06:48,279 INFO L902 garLoopResultBuilder]: At program point netdev_get_tx_queueENTRY(lines 5364 5370) the Hoare annotation is: true [2022-11-02 21:06:48,279 INFO L899 garLoopResultBuilder]: For program point netdev_get_tx_queueFINAL(lines 5364 5370) no Hoare annotation was computed. [2022-11-02 21:06:48,279 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~TO~~u8~0EXIT(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,279 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~int~TO~~u8~0ENTRY(line -1) the Hoare annotation is: true [2022-11-02 21:06:48,280 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~TO~~u8~0FINAL(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,280 INFO L899 garLoopResultBuilder]: For program point close_candevEXIT(lines 6969 6971) no Hoare annotation was computed. [2022-11-02 21:06:48,280 INFO L902 garLoopResultBuilder]: At program point close_candevENTRY(lines 6969 6971) the Hoare annotation is: true [2022-11-02 21:06:48,280 INFO L899 garLoopResultBuilder]: For program point close_candevFINAL(lines 6969 6971) no Hoare annotation was computed. [2022-11-02 21:06:48,280 INFO L899 garLoopResultBuilder]: For program point L5410-1(line 5410) no Hoare annotation was computed. [2022-11-02 21:06:48,280 INFO L899 garLoopResultBuilder]: For program point netif_wake_queueEXIT(lines 5406 5414) no Hoare annotation was computed. [2022-11-02 21:06:48,281 INFO L899 garLoopResultBuilder]: For program point L5399(lines 5399 5402) no Hoare annotation was computed. [2022-11-02 21:06:48,281 INFO L902 garLoopResultBuilder]: At program point L5399-2(lines 5394 5405) the Hoare annotation is: true [2022-11-02 21:06:48,281 INFO L902 garLoopResultBuilder]: At program point netif_wake_queueENTRY(lines 5406 5414) the Hoare annotation is: true [2022-11-02 21:06:48,281 INFO L902 garLoopResultBuilder]: At program point L5198(lines 5192 5200) the Hoare annotation is: true [2022-11-02 21:06:48,281 INFO L902 garLoopResultBuilder]: At program point L6928(lines 6927 6929) the Hoare annotation is: true [2022-11-02 21:06:48,282 INFO L902 garLoopResultBuilder]: At program point L5410(line 5410) the Hoare annotation is: true [2022-11-02 21:06:48,282 INFO L899 garLoopResultBuilder]: For program point netif_wake_queueFINAL(lines 5406 5414) no Hoare annotation was computed. [2022-11-02 21:06:48,282 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5240 5242) the Hoare annotation is: true [2022-11-02 21:06:48,282 INFO L899 garLoopResultBuilder]: For program point L5241-2(lines 5240 5242) no Hoare annotation was computed. [2022-11-02 21:06:48,282 INFO L899 garLoopResultBuilder]: For program point L5241(line 5241) no Hoare annotation was computed. [2022-11-02 21:06:48,283 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5240 5242) no Hoare annotation was computed. [2022-11-02 21:06:48,283 INFO L895 garLoopResultBuilder]: At program point ldv_skb_freeENTRY(lines 6863 6869) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,283 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeFINAL(lines 6863 6869) no Hoare annotation was computed. [2022-11-02 21:06:48,283 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeEXIT(lines 6863 6869) no Hoare annotation was computed. [2022-11-02 21:06:48,283 INFO L895 garLoopResultBuilder]: At program point L6866(line 6866) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-02 21:06:48,284 INFO L902 garLoopResultBuilder]: At program point L5663(line 5663) the Hoare annotation is: true [2022-11-02 21:06:48,284 INFO L899 garLoopResultBuilder]: For program point L5663-1(line 5663) no Hoare annotation was computed. [2022-11-02 21:06:48,284 INFO L902 garLoopResultBuilder]: At program point L5634-2(lines 5634 5638) the Hoare annotation is: true [2022-11-02 21:06:48,284 INFO L895 garLoopResultBuilder]: At program point L5659(line 5659) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~ldv_state_variable_2~0 2)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,284 INFO L899 garLoopResultBuilder]: For program point L5626(lines 5626 5630) no Hoare annotation was computed. [2022-11-02 21:06:48,285 INFO L899 garLoopResultBuilder]: For program point L5639(line 5639) no Hoare annotation was computed. [2022-11-02 21:06:48,285 INFO L902 garLoopResultBuilder]: At program point L5635(line 5635) the Hoare annotation is: true [2022-11-02 21:06:48,285 INFO L899 garLoopResultBuilder]: For program point L5635-1(line 5635) no Hoare annotation was computed. [2022-11-02 21:06:48,285 INFO L899 garLoopResultBuilder]: For program point L5664-1(line 5664) no Hoare annotation was computed. [2022-11-02 21:06:48,285 INFO L902 garLoopResultBuilder]: At program point L5664(line 5664) the Hoare annotation is: true [2022-11-02 21:06:48,286 INFO L902 garLoopResultBuilder]: At program point L5627(line 5627) the Hoare annotation is: true [2022-11-02 21:06:48,286 INFO L899 garLoopResultBuilder]: For program point L5627-1(line 5627) no Hoare annotation was computed. [2022-11-02 21:06:48,286 INFO L899 garLoopResultBuilder]: For program point L5656-1(line 5656) no Hoare annotation was computed. [2022-11-02 21:06:48,286 INFO L895 garLoopResultBuilder]: At program point L5656(line 5656) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~ldv_state_variable_2~0 2)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,287 INFO L902 garLoopResultBuilder]: At program point L5619(line 5619) the Hoare annotation is: true [2022-11-02 21:06:48,287 INFO L899 garLoopResultBuilder]: For program point L5619-1(line 5619) no Hoare annotation was computed. [2022-11-02 21:06:48,287 INFO L899 garLoopResultBuilder]: For program point sja1000_startFINAL(lines 5651 5668) no Hoare annotation was computed. [2022-11-02 21:06:48,287 INFO L902 garLoopResultBuilder]: At program point L5648(lines 5609 5650) the Hoare annotation is: true [2022-11-02 21:06:48,287 INFO L902 garLoopResultBuilder]: At program point L5644(lines 5616 5649) the Hoare annotation is: true [2022-11-02 21:06:48,287 INFO L899 garLoopResultBuilder]: For program point L5640-1(line 5640) no Hoare annotation was computed. [2022-11-02 21:06:48,288 INFO L902 garLoopResultBuilder]: At program point L5640(line 5640) the Hoare annotation is: true [2022-11-02 21:06:48,288 INFO L899 garLoopResultBuilder]: For program point sja1000_startEXIT(lines 5651 5668) no Hoare annotation was computed. [2022-11-02 21:06:48,288 INFO L895 garLoopResultBuilder]: At program point sja1000_startENTRY(lines 5651 5668) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~ldv_state_variable_2~0 2)) (not (= ~last_index~0 0))) [2022-11-02 21:06:48,288 INFO L902 garLoopResultBuilder]: At program point L5637(line 5637) the Hoare annotation is: true [2022-11-02 21:06:48,288 INFO L899 garLoopResultBuilder]: For program point L5637-1(line 5637) no Hoare annotation was computed. [2022-11-02 21:06:48,289 INFO L902 garLoopResultBuilder]: At program point L5662(line 5662) the Hoare annotation is: true [2022-11-02 21:06:48,289 INFO L899 garLoopResultBuilder]: For program point L5658(lines 5658 5661) no Hoare annotation was computed. [2022-11-02 21:06:48,289 INFO L899 garLoopResultBuilder]: For program point L5662-1(line 5662) no Hoare annotation was computed. [2022-11-02 21:06:48,289 INFO L902 garLoopResultBuilder]: At program point L5629(line 5629) the Hoare annotation is: true [2022-11-02 21:06:48,289 INFO L899 garLoopResultBuilder]: For program point L5629-1(line 5629) no Hoare annotation was computed. [2022-11-02 21:06:48,290 INFO L899 garLoopResultBuilder]: For program point L5658-1(lines 5658 5661) no Hoare annotation was computed. [2022-11-02 21:06:48,290 INFO L902 garLoopResultBuilder]: At program point L5617(line 5617) the Hoare annotation is: true [2022-11-02 21:06:48,290 INFO L899 garLoopResultBuilder]: For program point L5617-1(line 5617) no Hoare annotation was computed. [2022-11-02 21:06:48,290 INFO L902 garLoopResultBuilder]: At program point L5642(lines 5616 5649) the Hoare annotation is: true [2022-11-02 21:06:48,290 INFO L899 garLoopResultBuilder]: For program point L5634(lines 5634 5638) no Hoare annotation was computed. [2022-11-02 21:06:48,290 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,291 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-11-02 21:06:48,291 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,291 INFO L902 garLoopResultBuilder]: At program point L5551(line 5551) the Hoare annotation is: true [2022-11-02 21:06:48,291 INFO L899 garLoopResultBuilder]: For program point L5551-1(line 5551) no Hoare annotation was computed. [2022-11-02 21:06:48,291 INFO L899 garLoopResultBuilder]: For program point sja1000_is_absentFINAL(lines 5547 5554) no Hoare annotation was computed. [2022-11-02 21:06:48,292 INFO L899 garLoopResultBuilder]: For program point sja1000_is_absentEXIT(lines 5547 5554) no Hoare annotation was computed. [2022-11-02 21:06:48,292 INFO L902 garLoopResultBuilder]: At program point sja1000_is_absentENTRY(lines 5547 5554) the Hoare annotation is: true [2022-11-02 21:06:48,292 INFO L899 garLoopResultBuilder]: For program point netif_stop_queueEXIT(lines 5437 5445) no Hoare annotation was computed. [2022-11-02 21:06:48,292 INFO L902 garLoopResultBuilder]: At program point L5182(lines 5178 5184) the Hoare annotation is: true [2022-11-02 21:06:48,292 INFO L902 garLoopResultBuilder]: At program point L5441(line 5441) the Hoare annotation is: true [2022-11-02 21:06:48,292 INFO L899 garLoopResultBuilder]: For program point L5441-1(line 5441) no Hoare annotation was computed. [2022-11-02 21:06:48,293 INFO L902 garLoopResultBuilder]: At program point L5434(lines 5415 5436) the Hoare annotation is: true [2022-11-02 21:06:48,293 INFO L899 garLoopResultBuilder]: For program point L5427(line 5427) no Hoare annotation was computed. [2022-11-02 21:06:48,293 INFO L902 garLoopResultBuilder]: At program point netif_stop_queueENTRY(lines 5437 5445) the Hoare annotation is: true [2022-11-02 21:06:48,293 INFO L899 garLoopResultBuilder]: For program point L5428(lines 5428 5432) no Hoare annotation was computed. [2022-11-02 21:06:48,293 INFO L899 garLoopResultBuilder]: For program point L5423(lines 5423 5426) no Hoare annotation was computed. [2022-11-02 21:06:48,293 INFO L902 garLoopResultBuilder]: At program point L5422(line 5422) the Hoare annotation is: true [2022-11-02 21:06:48,294 INFO L899 garLoopResultBuilder]: For program point L5422-1(line 5422) no Hoare annotation was computed. [2022-11-02 21:06:48,294 INFO L902 garLoopResultBuilder]: At program point L5423-2(lines 5423 5426) the Hoare annotation is: true [2022-11-02 21:06:48,294 INFO L902 garLoopResultBuilder]: At program point L7021(lines 7020 7022) the Hoare annotation is: true [2022-11-02 21:06:48,294 INFO L899 garLoopResultBuilder]: For program point netif_stop_queueFINAL(lines 5437 5445) no Hoare annotation was computed. [2022-11-02 21:06:48,294 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 5243 5259) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-02 21:06:48,295 INFO L902 garLoopResultBuilder]: At program point L5255(line 5255) the Hoare annotation is: true [2022-11-02 21:06:48,295 INFO L899 garLoopResultBuilder]: For program point L5255-1(line 5255) no Hoare annotation was computed. [2022-11-02 21:06:48,295 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5243 5259) no Hoare annotation was computed. [2022-11-02 21:06:48,295 INFO L899 garLoopResultBuilder]: For program point L5250(lines 5250 5257) no Hoare annotation was computed. [2022-11-02 21:06:48,295 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5243 5259) no Hoare annotation was computed. [2022-11-02 21:06:48,296 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,296 INFO L899 garLoopResultBuilder]: For program point L5272-1(line 5272) no Hoare annotation was computed. [2022-11-02 21:06:48,296 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 5260 5276) no Hoare annotation was computed. [2022-11-02 21:06:48,296 INFO L902 garLoopResultBuilder]: At program point L5272(line 5272) the Hoare annotation is: true [2022-11-02 21:06:48,296 INFO L899 garLoopResultBuilder]: For program point L5267(lines 5267 5274) no Hoare annotation was computed. [2022-11-02 21:06:48,297 INFO L895 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 5260 5276) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_retval_0~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) (.cse2 (not (= ~last_index~0 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_2~0 1)) .cse2) (or .cse0 .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_irq_1_2~0 0))))) [2022-11-02 21:06:48,297 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 5260 5276) no Hoare annotation was computed. [2022-11-02 21:06:48,297 INFO L895 garLoopResultBuilder]: At program point L5783(line 5783) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,297 INFO L899 garLoopResultBuilder]: For program point L5783-1(line 5783) no Hoare annotation was computed. [2022-11-02 21:06:48,297 INFO L899 garLoopResultBuilder]: For program point L6510(lines 6510 6538) no Hoare annotation was computed. [2022-11-02 21:06:48,297 INFO L899 garLoopResultBuilder]: For program point L6543(line 6543) no Hoare annotation was computed. [2022-11-02 21:06:48,298 INFO L899 garLoopResultBuilder]: For program point L5486(lines 5486 5489) no Hoare annotation was computed. [2022-11-02 21:06:48,298 INFO L899 garLoopResultBuilder]: For program point L6576(line 6576) no Hoare annotation was computed. [2022-11-02 21:06:48,298 INFO L899 garLoopResultBuilder]: For program point L6609(line 6609) no Hoare annotation was computed. [2022-11-02 21:06:48,298 INFO L899 garLoopResultBuilder]: For program point L6378(lines 6378 6384) no Hoare annotation was computed. [2022-11-02 21:06:48,298 INFO L895 garLoopResultBuilder]: At program point L5354(lines 5347 5356) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,299 INFO L895 garLoopResultBuilder]: At program point L6213(line 6213) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,299 INFO L895 garLoopResultBuilder]: At program point L5189(lines 5185 5191) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,299 INFO L895 garLoopResultBuilder]: At program point L6213-1(line 6213) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,299 INFO L899 garLoopResultBuilder]: For program point L5784-1(line 5784) no Hoare annotation was computed. [2022-11-02 21:06:48,299 INFO L895 garLoopResultBuilder]: At program point L5784(line 5784) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,300 INFO L902 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: true [2022-11-02 21:06:48,300 INFO L899 garLoopResultBuilder]: For program point L6511(line 6511) no Hoare annotation was computed. [2022-11-02 21:06:48,300 INFO L899 garLoopResultBuilder]: For program point L6544(lines 6544 6607) no Hoare annotation was computed. [2022-11-02 21:06:48,300 INFO L899 garLoopResultBuilder]: For program point L6577(lines 6577 6581) no Hoare annotation was computed. [2022-11-02 21:06:48,300 INFO L899 garLoopResultBuilder]: For program point L6412(lines 6412 6415) no Hoare annotation was computed. [2022-11-02 21:06:48,300 INFO L899 garLoopResultBuilder]: For program point L6214(line 6214) no Hoare annotation was computed. [2022-11-02 21:06:48,301 INFO L895 garLoopResultBuilder]: At program point L5785(line 5785) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,301 INFO L899 garLoopResultBuilder]: For program point L5785-1(line 5785) no Hoare annotation was computed. [2022-11-02 21:06:48,301 INFO L899 garLoopResultBuilder]: For program point L6512(lines 6512 6517) no Hoare annotation was computed. [2022-11-02 21:06:48,301 INFO L895 garLoopResultBuilder]: At program point L5389(line 5389) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,301 INFO L899 garLoopResultBuilder]: For program point L5389-1(line 5389) no Hoare annotation was computed. [2022-11-02 21:06:48,301 INFO L899 garLoopResultBuilder]: For program point L6215(lines 6215 6218) no Hoare annotation was computed. [2022-11-02 21:06:48,302 INFO L895 garLoopResultBuilder]: At program point L6182(line 6182) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,302 INFO L895 garLoopResultBuilder]: At program point L6215-2(lines 6215 6218) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,302 INFO L899 garLoopResultBuilder]: For program point L6182-1(line 6182) no Hoare annotation was computed. [2022-11-02 21:06:48,302 INFO L899 garLoopResultBuilder]: For program point L6546(lines 6546 6604) no Hoare annotation was computed. [2022-11-02 21:06:48,302 INFO L895 garLoopResultBuilder]: At program point L6612(lines 6488 6617) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_2~0 0)) (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1))) [2022-11-02 21:06:48,303 INFO L899 garLoopResultBuilder]: For program point L6547(line 6547) no Hoare annotation was computed. [2022-11-02 21:06:48,303 INFO L895 garLoopResultBuilder]: At program point L5391(lines 5385 5393) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,303 INFO L899 garLoopResultBuilder]: For program point L6448-1(line 6448) no Hoare annotation was computed. [2022-11-02 21:06:48,303 INFO L895 garLoopResultBuilder]: At program point L6448(line 6448) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,303 INFO L899 garLoopResultBuilder]: For program point L6184-1(line 6184) no Hoare annotation was computed. [2022-11-02 21:06:48,304 INFO L895 garLoopResultBuilder]: At program point L6184(line 6184) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,304 INFO L899 garLoopResultBuilder]: For program point L5788-1(line 5788) no Hoare annotation was computed. [2022-11-02 21:06:48,304 INFO L895 garLoopResultBuilder]: At program point L5788(line 5788) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,304 INFO L895 garLoopResultBuilder]: At program point L6713(lines 6708 6715) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_irq_1_2~0 0)) [2022-11-02 21:06:48,304 INFO L899 garLoopResultBuilder]: For program point L6548(lines 6548 6552) no Hoare annotation was computed. [2022-11-02 21:06:48,304 INFO L895 garLoopResultBuilder]: At program point L6416(lines 6409 6418) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,305 INFO L895 garLoopResultBuilder]: At program point L5789(line 5789) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,305 INFO L899 garLoopResultBuilder]: For program point L5789-1(line 5789) no Hoare annotation was computed. [2022-11-02 21:06:48,305 INFO L895 garLoopResultBuilder]: At program point L6450(lines 6444 6452) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,305 INFO L899 garLoopResultBuilder]: For program point L5492-1(lines 5480 5506) no Hoare annotation was computed. [2022-11-02 21:06:48,305 INFO L899 garLoopResultBuilder]: For program point L5492(lines 5492 5506) no Hoare annotation was computed. [2022-11-02 21:06:48,306 INFO L895 garLoopResultBuilder]: At program point L6219(line 6219) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,306 INFO L899 garLoopResultBuilder]: For program point L6186(lines 6186 6189) no Hoare annotation was computed. [2022-11-02 21:06:48,306 INFO L895 garLoopResultBuilder]: At program point L6979(lines 6978 6980) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,306 INFO L895 garLoopResultBuilder]: At program point L5790(line 5790) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,306 INFO L899 garLoopResultBuilder]: For program point L6913(lines 6913 6916) no Hoare annotation was computed. [2022-11-02 21:06:48,307 INFO L899 garLoopResultBuilder]: For program point L5790-1(line 5790) no Hoare annotation was computed. [2022-11-02 21:06:48,307 INFO L899 garLoopResultBuilder]: For program point L6583(line 6583) no Hoare annotation was computed. [2022-11-02 21:06:48,307 INFO L902 garLoopResultBuilder]: At program point L6616(lines 6479 6618) the Hoare annotation is: true [2022-11-02 21:06:48,307 INFO L895 garLoopResultBuilder]: At program point L5493(line 5493) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,307 INFO L899 garLoopResultBuilder]: For program point L5493-1(line 5493) no Hoare annotation was computed. [2022-11-02 21:06:48,307 INFO L899 garLoopResultBuilder]: For program point L6385(lines 6385 6391) no Hoare annotation was computed. [2022-11-02 21:06:48,308 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-11-02 21:06:48,308 INFO L899 garLoopResultBuilder]: For program point L5494(lines 5494 5503) no Hoare annotation was computed. [2022-11-02 21:06:48,308 INFO L899 garLoopResultBuilder]: For program point L6584(lines 6584 6592) no Hoare annotation was computed. [2022-11-02 21:06:48,308 INFO L895 garLoopResultBuilder]: At program point L6221(lines 6206 6223) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,308 INFO L902 garLoopResultBuilder]: At program point L6915-1(lines 6908 6919) the Hoare annotation is: true [2022-11-02 21:06:48,308 INFO L895 garLoopResultBuilder]: At program point L6915(line 6915) the Hoare annotation is: false [2022-11-02 21:06:48,309 INFO L899 garLoopResultBuilder]: For program point L6519(line 6519) no Hoare annotation was computed. [2022-11-02 21:06:48,309 INFO L895 garLoopResultBuilder]: At program point L7015(lines 7014 7016) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,309 INFO L899 garLoopResultBuilder]: For program point L6586(lines 6586 6590) no Hoare annotation was computed. [2022-11-02 21:06:48,309 INFO L899 garLoopResultBuilder]: For program point L6520(lines 6520 6534) no Hoare annotation was computed. [2022-11-02 21:06:48,309 INFO L899 garLoopResultBuilder]: For program point L6190(lines 6190 6199) no Hoare annotation was computed. [2022-11-02 21:06:48,310 INFO L895 garLoopResultBuilder]: At program point L6190-2(lines 6190 6199) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,310 INFO L895 garLoopResultBuilder]: At program point L6983(lines 6982 6984) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,310 INFO L899 garLoopResultBuilder]: For program point L6554(line 6554) no Hoare annotation was computed. [2022-11-02 21:06:48,310 INFO L895 garLoopResultBuilder]: At program point L5497(lines 5497 5498) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,310 INFO L899 garLoopResultBuilder]: For program point L5497-1(lines 5497 5498) no Hoare annotation was computed. [2022-11-02 21:06:48,311 INFO L895 garLoopResultBuilder]: At program point L5762(line 5762) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,311 INFO L899 garLoopResultBuilder]: For program point L5762-1(line 5762) no Hoare annotation was computed. [2022-11-02 21:06:48,311 INFO L899 garLoopResultBuilder]: For program point L6522(lines 6522 6527) no Hoare annotation was computed. [2022-11-02 21:06:48,311 INFO L899 garLoopResultBuilder]: For program point L6555(lines 6555 6559) no Hoare annotation was computed. [2022-11-02 21:06:48,311 INFO L899 garLoopResultBuilder]: For program point L6522-2(lines 6520 6533) no Hoare annotation was computed. [2022-11-02 21:06:48,311 INFO L899 garLoopResultBuilder]: For program point L6456(lines 6456 6460) no Hoare annotation was computed. [2022-11-02 21:06:48,311 INFO L899 garLoopResultBuilder]: For program point L6555-2(lines 6546 6604) no Hoare annotation was computed. [2022-11-02 21:06:48,312 INFO L899 garLoopResultBuilder]: For program point L5499(lines 5499 5502) no Hoare annotation was computed. [2022-11-02 21:06:48,312 INFO L899 garLoopResultBuilder]: For program point L6556-1(line 6556) no Hoare annotation was computed. [2022-11-02 21:06:48,312 INFO L895 garLoopResultBuilder]: At program point L6556(line 6556) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,312 INFO L899 garLoopResultBuilder]: For program point L6424(lines 6424 6439) no Hoare annotation was computed. [2022-11-02 21:06:48,312 INFO L899 garLoopResultBuilder]: For program point L6193(lines 6193 6197) no Hoare annotation was computed. [2022-11-02 21:06:48,313 INFO L895 garLoopResultBuilder]: At program point L5797(line 5797) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,313 INFO L899 garLoopResultBuilder]: For program point L5797-1(line 5797) no Hoare annotation was computed. [2022-11-02 21:06:48,313 INFO L899 garLoopResultBuilder]: For program point L6689-2(lines 6689 6692) no Hoare annotation was computed. [2022-11-02 21:06:48,313 INFO L899 garLoopResultBuilder]: For program point L6689(lines 6689 6692) no Hoare annotation was computed. [2022-11-02 21:06:48,313 INFO L899 garLoopResultBuilder]: For program point L6491-1(line 6491) no Hoare annotation was computed. [2022-11-02 21:06:48,313 INFO L895 garLoopResultBuilder]: At program point L6491(line 6491) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_irq_1_2~0 0)) [2022-11-02 21:06:48,314 INFO L899 garLoopResultBuilder]: For program point L6392(lines 6392 6398) no Hoare annotation was computed. [2022-11-02 21:06:48,314 INFO L899 garLoopResultBuilder]: For program point L6425(line 6425) no Hoare annotation was computed. [2022-11-02 21:06:48,314 INFO L895 garLoopResultBuilder]: At program point L6194(line 6194) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,314 INFO L899 garLoopResultBuilder]: For program point L6194-1(line 6194) no Hoare annotation was computed. [2022-11-02 21:06:48,314 INFO L895 garLoopResultBuilder]: At program point L6987(lines 6986 6988) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,315 INFO L895 garLoopResultBuilder]: At program point L6657-1(lines 6654 6660) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,315 INFO L895 garLoopResultBuilder]: At program point L6657(line 6657) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,315 INFO L895 garLoopResultBuilder]: At program point L6426(line 6426) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_2~0 0)) (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1))) [2022-11-02 21:06:48,315 INFO L899 garLoopResultBuilder]: For program point L6426-1(line 6426) no Hoare annotation was computed. [2022-11-02 21:06:48,315 INFO L895 garLoopResultBuilder]: At program point L5799(lines 5761 5811) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,315 INFO L899 garLoopResultBuilder]: For program point L5766(lines 5766 5769) no Hoare annotation was computed. [2022-11-02 21:06:48,316 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,316 INFO L899 garLoopResultBuilder]: For program point L6428(line 6428) no Hoare annotation was computed. [2022-11-02 21:06:48,316 INFO L899 garLoopResultBuilder]: For program point L6461(lines 6461 6465) no Hoare annotation was computed. [2022-11-02 21:06:48,316 INFO L895 garLoopResultBuilder]: At program point L5801(lines 5761 5811) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,316 INFO L899 garLoopResultBuilder]: For program point L6594(line 6594) no Hoare annotation was computed. [2022-11-02 21:06:48,317 INFO L895 garLoopResultBuilder]: At program point L6693(lines 6677 6695) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,317 INFO L899 garLoopResultBuilder]: For program point L6561-1(line 6561) no Hoare annotation was computed. [2022-11-02 21:06:48,317 INFO L895 garLoopResultBuilder]: At program point L6561(line 6561) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,317 INFO L899 garLoopResultBuilder]: For program point L6429-1(line 6429) no Hoare annotation was computed. [2022-11-02 21:06:48,317 INFO L895 garLoopResultBuilder]: At program point L6429(line 6429) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_2~0 0)) (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1))) [2022-11-02 21:06:48,318 INFO L899 garLoopResultBuilder]: For program point L6595(lines 6595 6600) no Hoare annotation was computed. [2022-11-02 21:06:48,318 INFO L895 garLoopResultBuilder]: At program point L5505(lines 5478 5512) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,318 INFO L895 garLoopResultBuilder]: At program point L5770(line 5770) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,318 INFO L895 garLoopResultBuilder]: At program point L6860(lines 6856 6862) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_irq_1_2~0 0)) [2022-11-02 21:06:48,318 INFO L899 garLoopResultBuilder]: For program point L5770-1(line 5770) no Hoare annotation was computed. [2022-11-02 21:06:48,319 INFO L895 garLoopResultBuilder]: At program point L6530(lines 6488 6617) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,319 INFO L899 garLoopResultBuilder]: For program point L6431(line 6431) no Hoare annotation was computed. [2022-11-02 21:06:48,319 INFO L895 garLoopResultBuilder]: At program point L6332(lines 6328 6334) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,319 INFO L895 garLoopResultBuilder]: At program point L6200(line 6200) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,319 INFO L899 garLoopResultBuilder]: For program point L6432-1(line 6432) no Hoare annotation was computed. [2022-11-02 21:06:48,319 INFO L899 garLoopResultBuilder]: For program point L6399(lines 6399 6405) no Hoare annotation was computed. [2022-11-02 21:06:48,320 INFO L895 garLoopResultBuilder]: At program point L6432(line 6432) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_2~0 0)) (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1))) [2022-11-02 21:06:48,320 INFO L899 garLoopResultBuilder]: For program point L6201(line 6201) no Hoare annotation was computed. [2022-11-02 21:06:48,320 INFO L899 garLoopResultBuilder]: For program point L5805(lines 5805 5809) no Hoare annotation was computed. [2022-11-02 21:06:48,320 INFO L899 garLoopResultBuilder]: For program point L6466(lines 6466 6470) no Hoare annotation was computed. [2022-11-02 21:06:48,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,321 INFO L895 garLoopResultBuilder]: At program point L5806(line 5806) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,321 INFO L899 garLoopResultBuilder]: For program point L6566(line 6566) no Hoare annotation was computed. [2022-11-02 21:06:48,321 INFO L899 garLoopResultBuilder]: For program point L6434(line 6434) no Hoare annotation was computed. [2022-11-02 21:06:48,321 INFO L899 garLoopResultBuilder]: For program point L6500(lines 6500 6611) no Hoare annotation was computed. [2022-11-02 21:06:48,321 INFO L895 garLoopResultBuilder]: At program point L6203(lines 6176 6205) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,322 INFO L899 garLoopResultBuilder]: For program point L5774(lines 5774 5777) no Hoare annotation was computed. [2022-11-02 21:06:48,322 INFO L899 garLoopResultBuilder]: For program point L5774-2(lines 5761 5811) no Hoare annotation was computed. [2022-11-02 21:06:48,322 INFO L899 garLoopResultBuilder]: For program point L6567(lines 6567 6574) no Hoare annotation was computed. [2022-11-02 21:06:48,322 INFO L899 garLoopResultBuilder]: For program point L6435-1(line 6435) no Hoare annotation was computed. [2022-11-02 21:06:48,322 INFO L895 garLoopResultBuilder]: At program point L6435(line 6435) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_2~0 0)) (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1))) [2022-11-02 21:06:48,322 INFO L899 garLoopResultBuilder]: For program point L6501(line 6501) no Hoare annotation was computed. [2022-11-02 21:06:48,323 INFO L899 garLoopResultBuilder]: For program point L5808-1(lines 5805 5809) no Hoare annotation was computed. [2022-11-02 21:06:48,323 INFO L895 garLoopResultBuilder]: At program point L5808(line 5808) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,323 INFO L899 garLoopResultBuilder]: For program point L6502(lines 6502 6505) no Hoare annotation was computed. [2022-11-02 21:06:48,323 INFO L895 garLoopResultBuilder]: At program point L5511(lines 5471 5513) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,323 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,323 INFO L899 garLoopResultBuilder]: For program point L6602(line 6602) no Hoare annotation was computed. [2022-11-02 21:06:48,324 INFO L895 garLoopResultBuilder]: At program point L6701(lines 6696 6703) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,324 INFO L899 garLoopResultBuilder]: For program point L6536(line 6536) no Hoare annotation was computed. [2022-11-02 21:06:48,324 INFO L899 garLoopResultBuilder]: For program point L6569(lines 6569 6572) no Hoare annotation was computed. [2022-11-02 21:06:48,324 INFO L899 garLoopResultBuilder]: For program point L6437(line 6437) no Hoare annotation was computed. [2022-11-02 21:06:48,324 INFO L895 garLoopResultBuilder]: At program point L5810(lines 5749 5812) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,324 INFO L895 garLoopResultBuilder]: At program point L6801(lines 6798 6803) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0)) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,325 INFO L902 garLoopResultBuilder]: At program point L6603(line 6603) the Hoare annotation is: true [2022-11-02 21:06:48,325 INFO L902 garLoopResultBuilder]: At program point L6438(line 6438) the Hoare annotation is: true [2022-11-02 21:06:48,325 INFO L899 garLoopResultBuilder]: For program point L6471(lines 6471 6475) no Hoare annotation was computed. [2022-11-02 21:06:48,325 INFO L902 garLoopResultBuilder]: At program point L6537(line 6537) the Hoare annotation is: true [2022-11-02 21:06:48,325 INFO L899 garLoopResultBuilder]: For program point L5480(lines 5480 5506) no Hoare annotation was computed. [2022-11-02 21:06:48,325 INFO L895 garLoopResultBuilder]: At program point L6339(lines 6335 6341) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,326 INFO L895 garLoopResultBuilder]: At program point L6967(lines 6966 6968) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,326 INFO L899 garLoopResultBuilder]: For program point L5778-1(lines 5778 5791) no Hoare annotation was computed. [2022-11-02 21:06:48,326 INFO L895 garLoopResultBuilder]: At program point L6406(lines 6375 6408) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,326 INFO L895 garLoopResultBuilder]: At program point L5382(lines 5378 5384) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,326 INFO L895 garLoopResultBuilder]: At program point L5481(line 5481) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,327 INFO L899 garLoopResultBuilder]: For program point L5481-1(line 5481) no Hoare annotation was computed. [2022-11-02 21:06:48,327 INFO L899 garLoopResultBuilder]: For program point L5482(lines 5482 5490) no Hoare annotation was computed. [2022-11-02 21:06:48,327 INFO L895 garLoopResultBuilder]: At program point L6440(lines 6419 6443) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_2~0 0)) (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1))) [2022-11-02 21:06:48,327 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 21:06:48,327 INFO L899 garLoopResultBuilder]: For program point L6507(line 6507) no Hoare annotation was computed. [2022-11-02 21:06:48,328 INFO L895 garLoopResultBuilder]: At program point L7003(lines 7002 7004) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-02 21:06:48,328 INFO L895 garLoopResultBuilder]: At program point L5781(line 5781) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,328 INFO L899 garLoopResultBuilder]: For program point L5781-1(line 5781) no Hoare annotation was computed. [2022-11-02 21:06:48,328 INFO L899 garLoopResultBuilder]: For program point L6508(lines 6508 6541) no Hoare annotation was computed. [2022-11-02 21:06:48,328 INFO L895 garLoopResultBuilder]: At program point L6211(line 6211) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,328 INFO L899 garLoopResultBuilder]: For program point L6211-1(line 6211) no Hoare annotation was computed. [2022-11-02 21:06:48,329 INFO L895 garLoopResultBuilder]: At program point L5782(line 5782) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,329 INFO L899 garLoopResultBuilder]: For program point L5782-1(line 5782) no Hoare annotation was computed. [2022-11-02 21:06:48,329 INFO L895 garLoopResultBuilder]: At program point L6476(lines 6453 6478) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,329 INFO L895 garLoopResultBuilder]: At program point L5485(line 5485) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-02 21:06:48,329 INFO L899 garLoopResultBuilder]: For program point L5485-1(line 5485) no Hoare annotation was computed. [2022-11-02 21:06:48,329 INFO L902 garLoopResultBuilder]: At program point spinlock_checkENTRY(lines 5214 5219) the Hoare annotation is: true [2022-11-02 21:06:48,330 INFO L899 garLoopResultBuilder]: For program point spinlock_checkEXIT(lines 5214 5219) no Hoare annotation was computed. [2022-11-02 21:06:48,330 INFO L899 garLoopResultBuilder]: For program point spinlock_checkFINAL(lines 5214 5219) no Hoare annotation was computed. [2022-11-02 21:06:48,330 INFO L899 garLoopResultBuilder]: For program point can_change_mtuFINAL(lines 6953 6955) no Hoare annotation was computed. [2022-11-02 21:06:48,330 INFO L902 garLoopResultBuilder]: At program point can_change_mtuENTRY(lines 6953 6955) the Hoare annotation is: true [2022-11-02 21:06:48,330 INFO L899 garLoopResultBuilder]: For program point can_change_mtuEXIT(lines 6953 6955) no Hoare annotation was computed. [2022-11-02 21:06:48,331 INFO L899 garLoopResultBuilder]: For program point can_led_eventFINAL(lines 6963 6965) no Hoare annotation was computed. [2022-11-02 21:06:48,331 INFO L902 garLoopResultBuilder]: At program point can_led_eventENTRY(lines 6963 6965) the Hoare annotation is: true [2022-11-02 21:06:48,331 INFO L899 garLoopResultBuilder]: For program point can_led_eventEXIT(lines 6963 6965) no Hoare annotation was computed. [2022-11-02 21:06:48,334 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:48,337 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:06:48,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,384 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,386 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,386 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,386 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,387 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,387 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,387 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,387 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,399 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,399 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,413 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,413 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,413 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,414 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,414 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,414 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,414 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,423 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,423 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,424 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,424 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:06:48 BoogieIcfgContainer [2022-11-02 21:06:48,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:06:48,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:06:48,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:06:48,426 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:06:48,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:00" (3/4) ... [2022-11-02 21:06:48,433 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 21:06:48,440 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free_int [2022-11-02 21:06:48,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2022-11-02 21:06:48,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure set_reset_mode [2022-11-02 21:06:48,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-02 21:06:48,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_irq_1 [2022-11-02 21:06:48,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:06:48,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-02 21:06:48,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_write_cmdreg [2022-11-02 21:06:48,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2022-11-02 21:06:48,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure netdev_priv [2022-11-02 21:06:48,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_set_remove [2022-11-02 21:06:48,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure netdev_get_tx_queue [2022-11-02 21:06:48,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-02 21:06:48,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure close_candev [2022-11-02 21:06:48,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_wake_queue [2022-11-02 21:06:48,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-02 21:06:48,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free [2022-11-02 21:06:48,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_start [2022-11-02 21:06:48,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-02 21:06:48,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_is_absent [2022-11-02 21:06:48,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_stop_queue [2022-11-02 21:06:48,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-02 21:06:48,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-11-02 21:06:48,445 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2022-11-02 21:06:48,445 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_change_mtu [2022-11-02 21:06:48,445 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_led_event [2022-11-02 21:06:48,484 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 152 nodes and edges [2022-11-02 21:06:48,487 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2022-11-02 21:06:48,490 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-02 21:06:48,493 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-02 21:06:48,496 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 21:06:48,499 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 21:06:48,547 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_state_variable_2 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,547 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_2 == 0) || ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) [2022-11-02 21:06:48,547 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,548 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) [2022-11-02 21:06:48,548 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) [2022-11-02 21:06:48,548 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && !(\result == 0)) && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,549 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) [2022-11-02 21:06:48,552 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) [2022-11-02 21:06:48,553 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,553 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_2 == 0) || ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) [2022-11-02 21:06:48,553 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || ((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(LDV_IN_INTERRUPT) == LDV_IN_INTERRUPT) && \old(last_index) == last_index) [2022-11-02 21:06:48,554 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) [2022-11-02 21:06:48,554 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) [2022-11-02 21:06:48,554 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-02 21:06:48,554 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-02 21:06:48,554 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) [2022-11-02 21:06:48,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) [2022-11-02 21:06:48,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) [2022-11-02 21:06:48,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) [2022-11-02 21:06:48,556 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_state_variable_0 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,557 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,557 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-02 21:06:48,557 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) [2022-11-02 21:06:48,558 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,559 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,559 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,559 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) [2022-11-02 21:06:48,560 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,560 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,560 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,560 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) [2022-11-02 21:06:48,561 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,561 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,561 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) [2022-11-02 21:06:48,561 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) [2022-11-02 21:06:48,562 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_state_variable_2 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,562 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) [2022-11-02 21:06:48,562 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 <= i) && 0 == deleted_index + 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(last_index) == last_index) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) [2022-11-02 21:06:48,563 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,563 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,563 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,564 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) [2022-11-02 21:06:48,564 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) [2022-11-02 21:06:48,564 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(ldv_retval_0 == 0) || !(\old(last_index) == 0) [2022-11-02 21:06:48,565 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,565 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,565 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) [2022-11-02 21:06:48,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-02 21:06:48,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,567 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,567 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,568 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,568 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,568 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-02 21:06:48,795 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:06:48,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:06:48,796 INFO L158 Benchmark]: Toolchain (without parser) took 113885.77ms. Allocated memory was 96.5MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 55.5MB in the beginning and 1.0GB in the end (delta: -956.6MB). Peak memory consumption was 593.5MB. Max. memory is 16.1GB. [2022-11-02 21:06:48,797 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 96.5MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:06:48,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2441.85ms. Allocated memory was 96.5MB in the beginning and 153.1MB in the end (delta: 56.6MB). Free memory was 55.2MB in the beginning and 64.8MB in the end (delta: -9.5MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2022-11-02 21:06:48,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 170.99ms. Allocated memory is still 153.1MB. Free memory was 64.8MB in the beginning and 95.5MB in the end (delta: -30.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 21:06:48,798 INFO L158 Benchmark]: Boogie Preprocessor took 263.95ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 81.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 21:06:48,799 INFO L158 Benchmark]: RCFGBuilder took 2697.98ms. Allocated memory was 153.1MB in the beginning and 213.9MB in the end (delta: 60.8MB). Free memory was 81.9MB in the beginning and 105.6MB in the end (delta: -23.8MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2022-11-02 21:06:48,800 INFO L158 Benchmark]: TraceAbstraction took 107931.16ms. Allocated memory was 213.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 104.6MB in the beginning and 1.0GB in the end (delta: -936.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-02 21:06:48,801 INFO L158 Benchmark]: Witness Printer took 370.04ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-02 21:06:48,804 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.40ms. Allocated memory is still 96.5MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2441.85ms. Allocated memory was 96.5MB in the beginning and 153.1MB in the end (delta: 56.6MB). Free memory was 55.2MB in the beginning and 64.8MB in the end (delta: -9.5MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 170.99ms. Allocated memory is still 153.1MB. Free memory was 64.8MB in the beginning and 95.5MB in the end (delta: -30.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 263.95ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 81.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2697.98ms. Allocated memory was 153.1MB in the beginning and 213.9MB in the end (delta: 60.8MB). Free memory was 81.9MB in the beginning and 105.6MB in the end (delta: -23.8MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * TraceAbstraction took 107931.16ms. Allocated memory was 213.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 104.6MB in the beginning and 1.0GB in the end (delta: -936.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 370.04ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 5297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 512 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 107.8s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 70.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9822 SdHoareTripleChecker+Valid, 25.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9088 mSDsluCounter, 20007 SdHoareTripleChecker+Invalid, 21.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12204 mSDsCounter, 5169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11960 IncrementalHoareTripleChecker+Invalid, 17129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5169 mSolverCounterUnsat, 7803 mSDtfsCounter, 11960 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6755occurred in iteration=9, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 6455 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 212 LocationsWithAnnotation, 27847 PreInvPairs, 31276 NumberOfFragments, 2658 HoareAnnotationTreeSize, 27847 FomulaSimplifications, 301056 FormulaSimplificationTreeSizeReduction, 47.8s HoareSimplificationTime, 212 FomulaSimplificationsInter, 1128100 FormulaSimplificationTreeSizeReductionInter, 21.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 839 NumberOfCodeBlocks, 839 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 1632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 277/277 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5960]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) - InvariantResult [Line: 5378]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 5415]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6763]: Loop Invariant Derived loop invariant: !(ldv_retval_0 == 0) || !(\old(last_index) == 0) - InvariantResult [Line: 6654]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6940]: Loop Invariant Derived loop invariant: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) - InvariantResult [Line: 6065]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 5192]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6960]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) - InvariantResult [Line: 6262]: Loop Invariant [2022-11-02 21:06:48,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) - InvariantResult [Line: 5813]: Loop Invariant Derived loop invariant: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) - InvariantResult [Line: 6065]: Loop Invariant Derived loop invariant: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) - InvariantResult [Line: 6065]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6444]: Loop Invariant Derived loop invariant: ((ldv_state_variable_2 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 7017]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6856]: Loop Invariant Derived loop invariant: ((ldv_state_variable_2 == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_2 == 0 - InvariantResult [Line: 6708]: Loop Invariant Derived loop invariant: ((ldv_state_variable_2 == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_2 == 0 - InvariantResult [Line: 6798]: Loop Invariant Derived loop invariant: ((\result == 0 && !(\result == 0)) && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6982]: Loop Invariant Derived loop invariant: ((ldv_state_variable_2 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 7014]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 5862]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) - InvariantResult [Line: 5862]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) - InvariantResult [Line: 6049]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 5885]: Loop Invariant Derived loop invariant: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) - InvariantResult [Line: 6966]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 7020]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5761]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6669]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) - InvariantResult [Line: 6453]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5385]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 5178]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6934]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7002]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6109]: Loop Invariant Derived loop invariant: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) - InvariantResult [Line: 6949]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) - InvariantResult [Line: 5749]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5471]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5347]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6927]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6975]: Loop Invariant [2022-11-02 21:06:48,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) - InvariantResult [Line: 6206]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5616]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5609]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5185]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6479]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5394]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6978]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6375]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6661]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) - InvariantResult [Line: 5300]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6328]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) - InvariantResult [Line: 6109]: Loop Invariant Derived loop invariant: ((!(isrc == 256 * (isrc / 256)) && last_index == 0) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) - InvariantResult [Line: 6677]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6488]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5478]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5616]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6311]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6176]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 5582]: Loop Invariant [2022-11-02 21:06:48,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) - InvariantResult [Line: 6335]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5761]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6956]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || (!(isrc == 256 * (isrc / 256)) && \old(last_index) == last_index) - InvariantResult [Line: 5582]: Loop Invariant [2022-11-02 21:06:48,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) - InvariantResult [Line: 6986]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6354]: Loop Invariant [2022-11-02 21:06:48,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || ((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(LDV_IN_INTERRUPT) == LDV_IN_INTERRUPT) && \old(last_index) == last_index) - InvariantResult [Line: 6419]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_2 == 0) || ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) - InvariantResult [Line: 6488]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_2 == 0) || ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) - InvariantResult [Line: 5220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6696]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6937]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6409]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6749]: Loop Invariant [2022-11-02 21:06:48,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 21:06:48,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 21:06:48,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 <= i) && 0 == deleted_index + 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(last_index) == last_index) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) - InvariantResult [Line: 6908]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-02 21:06:48,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c50032-192c-41e0-bc66-b06b695c7bed/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE