./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/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_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 12:42:59,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:42:59,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:42:59,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:42:59,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:42:59,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:42:59,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:42:59,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:42:59,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:42:59,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:42:59,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:42:59,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:42:59,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:42:59,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:42:59,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:42:59,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:42:59,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:42:59,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:42:59,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:42:59,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:42:59,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:42:59,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:42:59,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:42:59,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:42:59,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:42:59,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:42:59,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:42:59,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:42:59,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:42:59,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:42:59,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:42:59,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:42:59,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:42:59,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:42:59,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:42:59,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:42:59,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:42:59,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:42:59,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:42:59,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:42:59,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:42:59,817 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:42:59,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:42:59,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:42:59,859 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:42:59,859 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:42:59,860 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:42:59,860 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:42:59,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:42:59,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:42:59,862 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:42:59,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:42:59,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:42:59,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:42:59,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:42:59,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:42:59,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:42:59,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:42:59,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:42:59,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:42:59,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:42:59,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:42:59,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:42:59,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:42:59,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:42:59,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:42:59,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:42:59,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:42:59,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:42:59,869 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:42:59,869 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:42:59,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:42:59,870 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_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/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_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8 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-16 12:43:00,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:43:00,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:43:00,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:43:00,201 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:43:00,202 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:43:00,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/../../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-16 12:43:00,273 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/data/588c182eb/dca9e4a6b71f4181b2288917a380fea2/FLAGddff56a07 [2022-11-16 12:43:01,117 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:43:01,117 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/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-16 12:43:01,164 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/data/588c182eb/dca9e4a6b71f4181b2288917a380fea2/FLAGddff56a07 [2022-11-16 12:43:01,606 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/data/588c182eb/dca9e4a6b71f4181b2288917a380fea2 [2022-11-16 12:43:01,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:43:01,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:43:01,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:43:01,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:43:01,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:43:01,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:01" (1/1) ... [2022-11-16 12:43:01,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50624c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:01, skipping insertion in model container [2022-11-16 12:43:01,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:01" (1/1) ... [2022-11-16 12:43:01,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:43:01,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:43:02,494 WARN L229 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_ddc713f8-c039-4b0d-bb50-0f2e294dae14/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-16 12:43:03,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:43:03,162 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:43:03,295 WARN L229 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_ddc713f8-c039-4b0d-bb50-0f2e294dae14/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-16 12:43:03,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:43:03,769 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:43:03,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03 WrapperNode [2022-11-16 12:43:03,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:43:03,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:43:03,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:43:03,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:43:03,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:03,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:03,953 INFO L138 Inliner]: procedures = 141, calls = 780, calls flagged for inlining = 69, calls inlined = 55, statements flattened = 1741 [2022-11-16 12:43:03,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:43:03,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:43:03,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:43:03,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:43:03,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:03,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:03,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:03,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:04,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:04,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:04,075 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:04,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:04,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:43:04,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:43:04,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:43:04,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:43:04,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (1/1) ... [2022-11-16 12:43:04,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:43:04,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:04,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:43:04,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:43:04,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-16 12:43:04,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-16 12:43:04,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:43:04,224 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_write_cmdreg [2022-11-16 12:43:04,224 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_write_cmdreg [2022-11-16 12:43:04,224 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-11-16 12:43:04,224 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-11-16 12:43:04,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-16 12:43:04,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-16 12:43:04,225 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-16 12:43:04,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-16 12:43:04,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 12:43:04,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 12:43:04,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:43:04,226 INFO L130 BoogieDeclarations]: Found specification of procedure set_reset_mode [2022-11-16 12:43:04,226 INFO L138 BoogieDeclarations]: Found implementation of procedure set_reset_mode [2022-11-16 12:43:04,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-16 12:43:04,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-16 12:43:04,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-16 12:43:04,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-16 12:43:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-16 12:43:04,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-16 12:43:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 12:43:04,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 12:43:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_is_absent [2022-11-16 12:43:04,228 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_is_absent [2022-11-16 12:43:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-16 12:43:04,228 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-16 12:43:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:43:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-16 12:43:04,229 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-16 12:43:04,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-11-16 12:43:04,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-11-16 12:43:04,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:43:04,229 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-11-16 12:43:04,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-11-16 12:43:04,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:43:04,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:43:04,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-11-16 12:43:04,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-11-16 12:43:04,230 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-16 12:43:04,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-16 12:43:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:43:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-16 12:43:04,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-16 12:43:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2022-11-16 12:43:04,231 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2022-11-16 12:43:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:43:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:43:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-16 12:43:04,232 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-16 12:43:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-16 12:43:04,232 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-16 12:43:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-11-16 12:43:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-11-16 12:43:04,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:43:04,233 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_start [2022-11-16 12:43:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_start [2022-11-16 12:43:04,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-16 12:43:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-16 12:43:04,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:43:04,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:43:04,234 INFO L130 BoogieDeclarations]: Found specification of procedure can_change_mtu [2022-11-16 12:43:04,234 INFO L138 BoogieDeclarations]: Found implementation of procedure can_change_mtu [2022-11-16 12:43:04,704 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:43:04,707 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:43:05,529 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-16 12:43:06,322 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:43:06,341 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:43:06,342 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 12:43:06,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:06 BoogieIcfgContainer [2022-11-16 12:43:06,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:43:06,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:43:06,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:43:06,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:43:06,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:43:01" (1/3) ... [2022-11-16 12:43:06,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55aa898b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:43:06, skipping insertion in model container [2022-11-16 12:43:06,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:03" (2/3) ... [2022-11-16 12:43:06,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55aa898b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:43:06, skipping insertion in model container [2022-11-16 12:43:06,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:06" (3/3) ... [2022-11-16 12:43:06,357 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-16 12:43:06,376 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:43:06,376 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:43:06,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:43:06,486 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;@69f25aa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:43:06,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:43:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 371 states have (on average 1.3638814016172507) internal successors, (506), 382 states have internal predecessors, (506), 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-16 12:43:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:43:06,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:06,504 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-16 12:43:06,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash 689378182, now seen corresponding path program 1 times [2022-11-16 12:43:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:06,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576687853] [2022-11-16 12:43:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:07,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:07,144 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-16 12:43:07,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:07,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576687853] [2022-11-16 12:43:07,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576687853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:07,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:07,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:43:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287074177] [2022-11-16 12:43:07,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:07,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:43:07,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:07,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:43:07,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:43:07,197 INFO L87 Difference]: Start difference. First operand has 511 states, 371 states have (on average 1.3638814016172507) internal successors, (506), 382 states have internal predecessors, (506), 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-16 12:43:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:09,484 INFO L93 Difference]: Finished difference Result 1593 states and 2315 transitions. [2022-11-16 12:43:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:43:09,487 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-16 12:43:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:09,519 INFO L225 Difference]: With dead ends: 1593 [2022-11-16 12:43:09,519 INFO L226 Difference]: Without dead ends: 1069 [2022-11-16 12:43:09,535 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-16 12:43:09,546 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 873 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:09,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1384 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-16 12:43:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2022-11-16 12:43:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 973. [2022-11-16 12:43:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 713 states have (on average 1.332398316970547) internal successors, (950), 721 states have internal predecessors, (950), 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-16 12:43:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1373 transitions. [2022-11-16 12:43:09,794 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1373 transitions. Word has length 22 [2022-11-16 12:43:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:09,800 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1373 transitions. [2022-11-16 12:43:09,800 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-16 12:43:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1373 transitions. [2022-11-16 12:43:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:43:09,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:09,804 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-16 12:43:09,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:43:09,805 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:09,806 INFO L85 PathProgramCache]: Analyzing trace with hash -881467453, now seen corresponding path program 1 times [2022-11-16 12:43:09,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:09,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815636305] [2022-11-16 12:43:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:10,012 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-16 12:43:10,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:10,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815636305] [2022-11-16 12:43:10,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815636305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:10,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:10,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:43:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41336894] [2022-11-16 12:43:10,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:10,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:43:10,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:10,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:43:10,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:43:10,019 INFO L87 Difference]: Start difference. First operand 973 states and 1373 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-16 12:43:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:11,686 INFO L93 Difference]: Finished difference Result 2035 states and 2880 transitions. [2022-11-16 12:43:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:43:11,687 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-16 12:43:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:11,697 INFO L225 Difference]: With dead ends: 2035 [2022-11-16 12:43:11,697 INFO L226 Difference]: Without dead ends: 1068 [2022-11-16 12:43:11,702 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-16 12:43:11,703 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 945 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:11,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1647 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-16 12:43:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-11-16 12:43:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 972. [2022-11-16 12:43:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 712 states have (on average 1.3286516853932584) internal successors, (946), 720 states have internal predecessors, (946), 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-16 12:43:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1369 transitions. [2022-11-16 12:43:11,783 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1369 transitions. Word has length 25 [2022-11-16 12:43:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:11,783 INFO L495 AbstractCegarLoop]: Abstraction has 972 states and 1369 transitions. [2022-11-16 12:43:11,784 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-16 12:43:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1369 transitions. [2022-11-16 12:43:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 12:43:11,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:11,788 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-16 12:43:11,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:43:11,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:11,789 INFO L85 PathProgramCache]: Analyzing trace with hash 120933822, now seen corresponding path program 1 times [2022-11-16 12:43:11,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:11,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957418317] [2022-11-16 12:43:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:11,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:12,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-16 12:43:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:12,094 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-16 12:43:12,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:12,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957418317] [2022-11-16 12:43:12,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957418317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:12,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:12,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:43:12,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155670362] [2022-11-16 12:43:12,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:12,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:43:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:12,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:43:12,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:43:12,098 INFO L87 Difference]: Start difference. First operand 972 states and 1369 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-16 12:43:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:14,500 INFO L93 Difference]: Finished difference Result 2116 states and 3026 transitions. [2022-11-16 12:43:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:43:14,501 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-16 12:43:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:14,514 INFO L225 Difference]: With dead ends: 2116 [2022-11-16 12:43:14,515 INFO L226 Difference]: Without dead ends: 2109 [2022-11-16 12:43:14,517 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-16 12:43:14,527 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 853 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:14,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 2402 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-16 12:43:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2022-11-16 12:43:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1927. [2022-11-16 12:43:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1408 states have (on average 1.3302556818181819) internal successors, (1873), 1426 states have internal predecessors, (1873), 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-16 12:43:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2742 transitions. [2022-11-16 12:43:14,677 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2742 transitions. Word has length 39 [2022-11-16 12:43:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:14,678 INFO L495 AbstractCegarLoop]: Abstraction has 1927 states and 2742 transitions. [2022-11-16 12:43:14,678 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-16 12:43:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2742 transitions. [2022-11-16 12:43:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 12:43:14,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:14,685 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-16 12:43:14,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:43:14,686 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1929035325, now seen corresponding path program 1 times [2022-11-16 12:43:14,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:14,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236511632] [2022-11-16 12:43:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:14,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:14,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-16 12:43:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:14,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:43:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:43:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:15,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:15,018 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-16 12:43:15,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:15,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236511632] [2022-11-16 12:43:15,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236511632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:15,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:15,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:43:15,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139827914] [2022-11-16 12:43:15,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:15,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:43:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:15,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:43:15,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:43:15,022 INFO L87 Difference]: Start difference. First operand 1927 states and 2742 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-16 12:43:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:18,250 INFO L93 Difference]: Finished difference Result 6036 states and 8716 transitions. [2022-11-16 12:43:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:43:18,250 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-16 12:43:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:18,279 INFO L225 Difference]: With dead ends: 6036 [2022-11-16 12:43:18,279 INFO L226 Difference]: Without dead ends: 4115 [2022-11-16 12:43:18,291 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-16 12:43:18,292 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 969 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:18,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1707 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-16 12:43:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2022-11-16 12:43:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 3404. [2022-11-16 12:43:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3404 states, 2523 states have (on average 1.3269916765755054) internal successors, (3348), 2555 states have internal predecessors, (3348), 691 states have call successors, (691), 168 states have call predecessors, (691), 189 states have return successors, (776), 700 states have call predecessors, (776), 690 states have call successors, (776) [2022-11-16 12:43:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4815 transitions. [2022-11-16 12:43:18,575 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4815 transitions. Word has length 75 [2022-11-16 12:43:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:18,577 INFO L495 AbstractCegarLoop]: Abstraction has 3404 states and 4815 transitions. [2022-11-16 12:43:18,577 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-16 12:43:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4815 transitions. [2022-11-16 12:43:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 12:43:18,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:18,584 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-16 12:43:18,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:43:18,584 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash 449695519, now seen corresponding path program 2 times [2022-11-16 12:43:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:18,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320098931] [2022-11-16 12:43:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:18,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:18,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:43:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:18,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:43:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:18,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:18,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-16 12:43:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:18,831 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-16 12:43:18,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:18,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320098931] [2022-11-16 12:43:18,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320098931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:18,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:18,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:43:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902359898] [2022-11-16 12:43:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:18,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:43:18,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:18,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:43:18,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:43:18,836 INFO L87 Difference]: Start difference. First operand 3404 states and 4815 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-16 12:43:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:21,935 INFO L93 Difference]: Finished difference Result 7056 states and 10078 transitions. [2022-11-16 12:43:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:43:21,936 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-16 12:43:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:21,959 INFO L225 Difference]: With dead ends: 7056 [2022-11-16 12:43:21,959 INFO L226 Difference]: Without dead ends: 3665 [2022-11-16 12:43:21,976 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-16 12:43:21,977 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 1048 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:21,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1549 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-16 12:43:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states. [2022-11-16 12:43:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 3008. [2022-11-16 12:43:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 2234 states have (on average 1.3231871083258728) internal successors, (2956), 2262 states have internal predecessors, (2956), 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-16 12:43:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4224 transitions. [2022-11-16 12:43:22,200 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4224 transitions. Word has length 75 [2022-11-16 12:43:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:22,201 INFO L495 AbstractCegarLoop]: Abstraction has 3008 states and 4224 transitions. [2022-11-16 12:43:22,201 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-16 12:43:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4224 transitions. [2022-11-16 12:43:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-16 12:43:22,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:22,208 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-16 12:43:22,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:43:22,209 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:22,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash 555634897, now seen corresponding path program 1 times [2022-11-16 12:43:22,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:22,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758761434] [2022-11-16 12:43:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:22,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-16 12:43:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:22,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:43:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:22,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-16 12:43:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:22,492 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-16 12:43:22,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:22,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758761434] [2022-11-16 12:43:22,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758761434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:22,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:22,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:43:22,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650395752] [2022-11-16 12:43:22,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:22,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:43:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:43:22,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:43:22,498 INFO L87 Difference]: Start difference. First operand 3008 states and 4224 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-16 12:43:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:26,310 INFO L93 Difference]: Finished difference Result 6849 states and 9792 transitions. [2022-11-16 12:43:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:43:26,311 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-16 12:43:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:26,340 INFO L225 Difference]: With dead ends: 6849 [2022-11-16 12:43:26,341 INFO L226 Difference]: Without dead ends: 4495 [2022-11-16 12:43:26,354 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-16 12:43:26,355 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 902 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:26,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 2148 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-16 12:43:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2022-11-16 12:43:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 3691. [2022-11-16 12:43:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 2749 states have (on average 1.3230265551109495) internal successors, (3637), 2783 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-16 12:43:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 5169 transitions. [2022-11-16 12:43:26,674 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 5169 transitions. Word has length 88 [2022-11-16 12:43:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:26,677 INFO L495 AbstractCegarLoop]: Abstraction has 3691 states and 5169 transitions. [2022-11-16 12:43:26,678 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-16 12:43:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 5169 transitions. [2022-11-16 12:43:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-16 12:43:26,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:26,694 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-16 12:43:26,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:43:26,694 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:26,695 INFO L85 PathProgramCache]: Analyzing trace with hash 270042671, now seen corresponding path program 1 times [2022-11-16 12:43:26,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:26,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467827106] [2022-11-16 12:43:26,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:26,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-16 12:43:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:26,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:43:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:43:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:26,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:43:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:43:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 12:43:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:27,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:43:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:27,020 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-16 12:43:27,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:27,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467827106] [2022-11-16 12:43:27,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467827106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:27,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:27,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:43:27,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326211346] [2022-11-16 12:43:27,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:27,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:43:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:43:27,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:43:27,024 INFO L87 Difference]: Start difference. First operand 3691 states and 5169 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-16 12:43:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:29,371 INFO L93 Difference]: Finished difference Result 8262 states and 11885 transitions. [2022-11-16 12:43:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:43:29,372 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-16 12:43:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:29,402 INFO L225 Difference]: With dead ends: 8262 [2022-11-16 12:43:29,402 INFO L226 Difference]: Without dead ends: 4584 [2022-11-16 12:43:29,434 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-16 12:43:29,435 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 600 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:29,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1536 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-16 12:43:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2022-11-16 12:43:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 3701. [2022-11-16 12:43:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 2759 states have (on average 1.3218557448350852) internal successors, (3647), 2793 states have internal predecessors, (3647), 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-16 12:43:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 5179 transitions. [2022-11-16 12:43:29,813 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 5179 transitions. Word has length 127 [2022-11-16 12:43:29,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:29,814 INFO L495 AbstractCegarLoop]: Abstraction has 3701 states and 5179 transitions. [2022-11-16 12:43:29,815 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-16 12:43:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 5179 transitions. [2022-11-16 12:43:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-16 12:43:29,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:29,831 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] [2022-11-16 12:43:29,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:43:29,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1356573346, now seen corresponding path program 1 times [2022-11-16 12:43:29,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:29,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036899949] [2022-11-16 12:43:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-16 12:43:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:43:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:43:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:43:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:43:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 12:43:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:43:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:43:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:43:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,345 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-16 12:43:30,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:30,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036899949] [2022-11-16 12:43:30,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036899949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:30,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:30,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:43:30,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134543424] [2022-11-16 12:43:30,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:30,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:43:30,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:30,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:43:30,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:43:30,347 INFO L87 Difference]: Start difference. First operand 3701 states and 5179 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:43:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:35,027 INFO L93 Difference]: Finished difference Result 12254 states and 17621 transitions. [2022-11-16 12:43:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:43:35,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 128 [2022-11-16 12:43:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:35,083 INFO L225 Difference]: With dead ends: 12254 [2022-11-16 12:43:35,083 INFO L226 Difference]: Without dead ends: 8853 [2022-11-16 12:43:35,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:43:35,110 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 1698 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 3169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:35,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 2363 Invalid, 3169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-16 12:43:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2022-11-16 12:43:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 7252. [2022-11-16 12:43:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7252 states, 5394 states have (on average 1.32146829810901) internal successors, (7128), 5498 states have internal predecessors, (7128), 1415 states have call successors, (1415), 393 states have call predecessors, (1415), 442 states have return successors, (1600), 1404 states have call predecessors, (1600), 1414 states have call successors, (1600) [2022-11-16 12:43:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7252 states to 7252 states and 10143 transitions. [2022-11-16 12:43:35,729 INFO L78 Accepts]: Start accepts. Automaton has 7252 states and 10143 transitions. Word has length 128 [2022-11-16 12:43:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:35,731 INFO L495 AbstractCegarLoop]: Abstraction has 7252 states and 10143 transitions. [2022-11-16 12:43:35,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:43:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 7252 states and 10143 transitions. [2022-11-16 12:43:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-16 12:43:35,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:35,750 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, 1, 1] [2022-11-16 12:43:35,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:43:35,750 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:35,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:35,751 INFO L85 PathProgramCache]: Analyzing trace with hash -906007754, now seen corresponding path program 1 times [2022-11-16 12:43:35,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:35,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87874012] [2022-11-16 12:43:35,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:35,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-16 12:43:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:43:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:43:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:43:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:43:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 12:43:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:43:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:43:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:43:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,393 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-16 12:43:36,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:36,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87874012] [2022-11-16 12:43:36,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87874012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:36,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:36,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:43:36,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911983992] [2022-11-16 12:43:36,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:36,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:43:36,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:36,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:43:36,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:43:36,397 INFO L87 Difference]: Start difference. First operand 7252 states and 10143 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:43:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:43,654 INFO L93 Difference]: Finished difference Result 34043 states and 50990 transitions. [2022-11-16 12:43:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:43:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 132 [2022-11-16 12:43:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:43,836 INFO L225 Difference]: With dead ends: 34043 [2022-11-16 12:43:43,837 INFO L226 Difference]: Without dead ends: 27229 [2022-11-16 12:43:43,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:43:43,878 INFO L413 NwaCegarLoop]: 916 mSDtfsCounter, 2316 mSDsluCounter, 2771 mSDsCounter, 0 mSdLazyCounter, 3209 mSolverCounterSat, 1347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 4556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1347 IncrementalHoareTripleChecker+Valid, 3209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:43,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2499 Valid, 3687 Invalid, 4556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1347 Valid, 3209 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-16 12:43:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27229 states. [2022-11-16 12:43:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27229 to 12777. [2022-11-16 12:43:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12777 states, 9537 states have (on average 1.3211701793016672) internal successors, (12600), 9715 states have internal predecessors, (12600), 2476 states have call successors, (2476), 677 states have call predecessors, (2476), 763 states have return successors, (2801), 2460 states have call predecessors, (2801), 2475 states have call successors, (2801) [2022-11-16 12:43:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12777 states to 12777 states and 17877 transitions. [2022-11-16 12:43:45,200 INFO L78 Accepts]: Start accepts. Automaton has 12777 states and 17877 transitions. Word has length 132 [2022-11-16 12:43:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:45,201 INFO L495 AbstractCegarLoop]: Abstraction has 12777 states and 17877 transitions. [2022-11-16 12:43:45,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:43:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12777 states and 17877 transitions. [2022-11-16 12:43:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-16 12:43:45,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:45,219 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-16 12:43:45,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:43:45,220 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 112532482, now seen corresponding path program 1 times [2022-11-16 12:43:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:45,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371083845] [2022-11-16 12:43:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-16 12:43:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:43:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:43:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:43:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:43:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 12:43:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:43:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,856 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-16 12:43:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:45,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371083845] [2022-11-16 12:43:45,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371083845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:45,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:45,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:43:45,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683222396] [2022-11-16 12:43:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:45,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:43:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:45,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:43:45,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:43:45,859 INFO L87 Difference]: Start difference. First operand 12777 states and 17877 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-16 12:43:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:49,967 INFO L93 Difference]: Finished difference Result 20316 states and 28881 transitions. [2022-11-16 12:43:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:43:49,968 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-16 12:43:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:49,976 INFO L225 Difference]: With dead ends: 20316 [2022-11-16 12:43:49,976 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 12:43:50,046 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-16 12:43:50,047 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 1066 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:50,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 2291 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-16 12:43:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 12:43:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 12:43:50,048 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-16 12:43:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 12:43:50,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2022-11-16 12:43:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:50,052 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 12:43:50,052 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-16 12:43:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 12:43:50,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 12:43:50,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:43:50,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:43:50,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-16 12:46:27,878 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-16 12:46:27,878 INFO L899 garLoopResultBuilder]: For program point ldv_skb_free_intFINAL(lines 6870 6876) no Hoare annotation was computed. [2022-11-16 12:46:27,879 INFO L899 garLoopResultBuilder]: For program point ldv_skb_free_intEXIT(lines 6870 6876) no Hoare annotation was computed. [2022-11-16 12:46:27,879 INFO L899 garLoopResultBuilder]: For program point L6873-1(line 6873) no Hoare annotation was computed. [2022-11-16 12:46:27,879 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-16 12:46:27,879 INFO L899 garLoopResultBuilder]: For program point __const_udelayFINAL(lines 6920 6922) no Hoare annotation was computed. [2022-11-16 12:46:27,879 INFO L899 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 6920 6922) no Hoare annotation was computed. [2022-11-16 12:46:27,880 INFO L902 garLoopResultBuilder]: At program point __const_udelayENTRY(lines 6920 6922) the Hoare annotation is: true [2022-11-16 12:46:27,880 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-16 12:46:27,880 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-16 12:46:27,880 INFO L899 garLoopResultBuilder]: For program point L5596-1(line 5596) no Hoare annotation was computed. [2022-11-16 12:46:27,880 INFO L899 garLoopResultBuilder]: For program point set_reset_modeFINAL(lines 5575 5608) no Hoare annotation was computed. [2022-11-16 12:46:27,880 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-16 12:46:27,881 INFO L899 garLoopResultBuilder]: For program point L5598-1(line 5598) no Hoare annotation was computed. [2022-11-16 12:46:27,881 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-16 12:46:27,881 INFO L899 garLoopResultBuilder]: For program point L5597-1(line 5597) no Hoare annotation was computed. [2022-11-16 12:46:27,881 INFO L899 garLoopResultBuilder]: For program point set_reset_modeEXIT(lines 5575 5608) no Hoare annotation was computed. [2022-11-16 12:46:27,881 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-16 12:46:27,881 INFO L899 garLoopResultBuilder]: For program point L5587-1(line 5587) no Hoare annotation was computed. [2022-11-16 12:46:27,882 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-16 12:46:27,882 INFO L899 garLoopResultBuilder]: For program point L5583-1(line 5583) no Hoare annotation was computed. [2022-11-16 12:46:27,882 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-16 12:46:27,882 INFO L899 garLoopResultBuilder]: For program point L5585-1(line 5585) no Hoare annotation was computed. [2022-11-16 12:46:27,882 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-16 12:46:27,883 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-16 12:46:27,883 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 5293 5299) no Hoare annotation was computed. [2022-11-16 12:46:27,883 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 5293 5299) the Hoare annotation is: true [2022-11-16 12:46:27,883 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5297) no Hoare annotation was computed. [2022-11-16 12:46:27,883 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 5293 5299) no Hoare annotation was computed. [2022-11-16 12:46:27,883 INFO L899 garLoopResultBuilder]: For program point L6014(lines 6014 6017) no Hoare annotation was computed. [2022-11-16 12:46:27,884 INFO L895 garLoopResultBuilder]: At program point L6113(line 6113) 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-16 12:46:27,884 INFO L899 garLoopResultBuilder]: For program point L6113-1(line 6113) no Hoare annotation was computed. [2022-11-16 12:46:27,884 INFO L899 garLoopResultBuilder]: For program point L6146-2(lines 6065 6166) no Hoare annotation was computed. [2022-11-16 12:46:27,884 INFO L895 garLoopResultBuilder]: At program point L5882(lines 5813 5884) 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-16 12:46:27,884 INFO L899 garLoopResultBuilder]: For program point L6014-2(lines 6014 6017) no Hoare annotation was computed. [2022-11-16 12:46:27,884 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-16 12:46:27,885 INFO L899 garLoopResultBuilder]: For program point L6031(lines 6031 6037) no Hoare annotation was computed. [2022-11-16 12:46:27,885 INFO L899 garLoopResultBuilder]: For program point L5965(lines 5965 5979) no Hoare annotation was computed. [2022-11-16 12:46:27,885 INFO L899 garLoopResultBuilder]: For program point L6031-2(lines 6031 6037) no Hoare annotation was computed. [2022-11-16 12:46:27,885 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-16 12:46:27,885 INFO L899 garLoopResultBuilder]: For program point L6114(lines 6114 6121) no Hoare annotation was computed. [2022-11-16 12:46:27,885 INFO L899 garLoopResultBuilder]: For program point L6147-1(line 6147) no Hoare annotation was computed. [2022-11-16 12:46:27,886 INFO L899 garLoopResultBuilder]: For program point L5850(line 5850) no Hoare annotation was computed. [2022-11-16 12:46:27,886 INFO L899 garLoopResultBuilder]: For program point L5850-2(line 5850) no Hoare annotation was computed. [2022-11-16 12:46:27,886 INFO L899 garLoopResultBuilder]: For program point L6131(lines 6131 6134) no Hoare annotation was computed. [2022-11-16 12:46:27,886 INFO L899 garLoopResultBuilder]: For program point L5966(line 5966) no Hoare annotation was computed. [2022-11-16 12:46:27,886 INFO L895 garLoopResultBuilder]: At program point L5834(line 5834) 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-16 12:46:27,886 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,886 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,887 INFO L899 garLoopResultBuilder]: For program point L5834-1(line 5834) no Hoare annotation was computed. [2022-11-16 12:46:27,887 INFO L895 garLoopResultBuilder]: At program point L6115(line 6115) 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-16 12:46:27,887 INFO L895 garLoopResultBuilder]: At program point L6082(line 6082) 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-16 12:46:27,887 INFO L899 garLoopResultBuilder]: For program point L6115-1(line 6115) no Hoare annotation was computed. [2022-11-16 12:46:27,887 INFO L899 garLoopResultBuilder]: For program point L6082-1(line 6082) no Hoare annotation was computed. [2022-11-16 12:46:27,887 INFO L895 garLoopResultBuilder]: At program point L6941-2(lines 6940 6942) 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-16 12:46:27,888 INFO L899 garLoopResultBuilder]: For program point L6941-1(line 6941) no Hoare annotation was computed. [2022-11-16 12:46:27,888 INFO L899 garLoopResultBuilder]: For program point L5917(lines 5917 5935) no Hoare annotation was computed. [2022-11-16 12:46:27,888 INFO L895 garLoopResultBuilder]: At program point L6941(line 6941) 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-16 12:46:27,888 INFO L899 garLoopResultBuilder]: For program point L5917-1(lines 5907 6047) no Hoare annotation was computed. [2022-11-16 12:46:27,888 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-16 12:46:27,888 INFO L899 garLoopResultBuilder]: For program point L5868-1(line 5868) no Hoare annotation was computed. [2022-11-16 12:46:27,889 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,889 INFO L899 garLoopResultBuilder]: For program point L6083(lines 6083 6090) no Hoare annotation was computed. [2022-11-16 12:46:27,889 INFO L899 garLoopResultBuilder]: For program point L6116(lines 6116 6119) no Hoare annotation was computed. [2022-11-16 12:46:27,889 INFO L899 garLoopResultBuilder]: For program point L6083-2(lines 6065 6166) no Hoare annotation was computed. [2022-11-16 12:46:27,889 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-16 12:46:27,889 INFO L899 garLoopResultBuilder]: For program point L6100-1(line 6100) no Hoare annotation was computed. [2022-11-16 12:46:27,889 INFO L899 garLoopResultBuilder]: For program point L6067-1(line 6067) no Hoare annotation was computed. [2022-11-16 12:46:27,890 INFO L895 garLoopResultBuilder]: At program point L6100(line 6100) 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-16 12:46:27,890 INFO L899 garLoopResultBuilder]: For program point L6150(lines 6150 6164) no Hoare annotation was computed. [2022-11-16 12:46:27,890 INFO L899 garLoopResultBuilder]: For program point L6084-1(line 6084) no Hoare annotation was computed. [2022-11-16 12:46:27,890 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,890 INFO L895 garLoopResultBuilder]: At program point L6084(line 6084) 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-16 12:46:27,890 INFO L899 garLoopResultBuilder]: For program point L6018-1(line 6018) no Hoare annotation was computed. [2022-11-16 12:46:27,891 INFO L895 garLoopResultBuilder]: At program point L5853(line 5853) 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-16 12:46:27,891 INFO L899 garLoopResultBuilder]: For program point L5853-1(line 5853) no Hoare annotation was computed. [2022-11-16 12:46:27,891 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,891 INFO L899 garLoopResultBuilder]: For program point L5969(line 5969) no Hoare annotation was computed. [2022-11-16 12:46:27,891 INFO L899 garLoopResultBuilder]: For program point L5936(lines 5907 6047) no Hoare annotation was computed. [2022-11-16 12:46:27,891 INFO L899 garLoopResultBuilder]: For program point L6085(lines 6085 6088) no Hoare annotation was computed. [2022-11-16 12:46:27,891 INFO L895 garLoopResultBuilder]: At program point L6944-2(lines 6943 6945) 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-16 12:46:27,892 INFO L899 garLoopResultBuilder]: For program point L6366(line 6366) no Hoare annotation was computed. [2022-11-16 12:46:27,892 INFO L899 garLoopResultBuilder]: For program point L6944-1(line 6944) no Hoare annotation was computed. [2022-11-16 12:46:27,892 INFO L895 garLoopResultBuilder]: At program point L5854(line 5854) 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-16 12:46:27,892 INFO L895 garLoopResultBuilder]: At program point L6944(line 6944) 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-16 12:46:27,892 INFO L899 garLoopResultBuilder]: For program point L5953(lines 5953 5957) no Hoare annotation was computed. [2022-11-16 12:46:27,892 INFO L899 garLoopResultBuilder]: For program point L5854-1(line 5854) no Hoare annotation was computed. [2022-11-16 12:46:27,892 INFO L899 garLoopResultBuilder]: For program point L5871(lines 5871 5874) no Hoare annotation was computed. [2022-11-16 12:46:27,893 INFO L899 garLoopResultBuilder]: For program point L5838(lines 5838 5841) no Hoare annotation was computed. [2022-11-16 12:46:27,893 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,893 INFO L899 garLoopResultBuilder]: For program point L5987(lines 5907 6047) no Hoare annotation was computed. [2022-11-16 12:46:27,893 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-16 12:46:27,893 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,893 INFO L899 garLoopResultBuilder]: For program point L6665-1(line 6665) no Hoare annotation was computed. [2022-11-16 12:46:27,894 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,894 INFO L899 garLoopResultBuilder]: For program point L6071(lines 6071 6074) no Hoare annotation was computed. [2022-11-16 12:46:27,894 INFO L899 garLoopResultBuilder]: For program point L6071-2(lines 6071 6074) no Hoare annotation was computed. [2022-11-16 12:46:27,894 INFO L899 garLoopResultBuilder]: For program point L5972(line 5972) no Hoare annotation was computed. [2022-11-16 12:46:27,894 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,894 INFO L899 garLoopResultBuilder]: For program point L5857-3(line 5857) no Hoare annotation was computed. [2022-11-16 12:46:27,894 INFO L899 garLoopResultBuilder]: For program point L5857-1(line 5857) no Hoare annotation was computed. [2022-11-16 12:46:27,895 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-16 12:46:27,895 INFO L899 garLoopResultBuilder]: For program point L6072-1(line 6072) no Hoare annotation was computed. [2022-11-16 12:46:27,895 INFO L899 garLoopResultBuilder]: For program point ldv_irq_1FINAL(lines 6349 6374) no Hoare annotation was computed. [2022-11-16 12:46:27,895 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,895 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-16 12:46:27,895 INFO L899 garLoopResultBuilder]: For program point L6006-1(lines 6006 6024) no Hoare annotation was computed. [2022-11-16 12:46:27,896 INFO L895 garLoopResultBuilder]: At program point L6122(lines 6109 6127) 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-16 12:46:27,896 INFO L899 garLoopResultBuilder]: For program point L5924-1(line 5924) no Hoare annotation was computed. [2022-11-16 12:46:27,896 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,896 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-16 12:46:27,896 INFO L899 garLoopResultBuilder]: For program point L6139-1(line 6139) no Hoare annotation was computed. [2022-11-16 12:46:27,896 INFO L899 garLoopResultBuilder]: For program point L6354(lines 6354 6371) no Hoare annotation was computed. [2022-11-16 12:46:27,896 INFO L899 garLoopResultBuilder]: For program point L5908-1(line 5908) no Hoare annotation was computed. [2022-11-16 12:46:27,897 INFO L895 garLoopResultBuilder]: At program point L5842(line 5842) 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-16 12:46:27,897 INFO L895 garLoopResultBuilder]: At program point L5908(line 5908) 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-16 12:46:27,897 INFO L899 garLoopResultBuilder]: For program point L5842-1(line 5842) no Hoare annotation was computed. [2022-11-16 12:46:27,897 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-16 12:46:27,897 INFO L899 garLoopResultBuilder]: For program point L5925-2(lines 5925 5928) no Hoare annotation was computed. [2022-11-16 12:46:27,897 INFO L899 garLoopResultBuilder]: For program point L5925(lines 5925 5928) no Hoare annotation was computed. [2022-11-16 12:46:27,898 INFO L899 garLoopResultBuilder]: For program point L6140(lines 6140 6143) no Hoare annotation was computed. [2022-11-16 12:46:27,898 INFO L899 garLoopResultBuilder]: For program point L5975(line 5975) no Hoare annotation was computed. [2022-11-16 12:46:27,898 INFO L899 garLoopResultBuilder]: For program point L5843(lines 5843 5856) no Hoare annotation was computed. [2022-11-16 12:46:27,898 INFO L899 garLoopResultBuilder]: For program point L5843-1(lines 5833 5883) no Hoare annotation was computed. [2022-11-16 12:46:27,898 INFO L899 garLoopResultBuilder]: For program point L6091-1(lines 6065 6166) no Hoare annotation was computed. [2022-11-16 12:46:27,898 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,898 INFO L895 garLoopResultBuilder]: At program point L6124(lines 6109 6127) 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-16 12:46:27,899 INFO L899 garLoopResultBuilder]: For program point L6157-1(line 6157) no Hoare annotation was computed. [2022-11-16 12:46:27,899 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,899 INFO L899 garLoopResultBuilder]: For program point L6025-2(lines 6025 6041) no Hoare annotation was computed. [2022-11-16 12:46:27,899 INFO L899 garLoopResultBuilder]: For program point L6025(lines 6025 6041) no Hoare annotation was computed. [2022-11-16 12:46:27,899 INFO L899 garLoopResultBuilder]: For program point L5860-1(lines 5860 5875) no Hoare annotation was computed. [2022-11-16 12:46:27,899 INFO L899 garLoopResultBuilder]: For program point L5860(lines 5860 5875) no Hoare annotation was computed. [2022-11-16 12:46:27,900 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-16 12:46:27,900 INFO L899 garLoopResultBuilder]: For program point L6075-1(line 6075) no Hoare annotation was computed. [2022-11-16 12:46:27,900 INFO L895 garLoopResultBuilder]: At program point L6141(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-16 12:46:27,900 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,900 INFO L899 garLoopResultBuilder]: For program point L5943-1(line 5943) no Hoare annotation was computed. [2022-11-16 12:46:27,900 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,901 INFO L899 garLoopResultBuilder]: For program point L6356(lines 6356 6368) no Hoare annotation was computed. [2022-11-16 12:46:27,901 INFO L899 garLoopResultBuilder]: For program point L5877-1(line 5877) no Hoare annotation was computed. [2022-11-16 12:46:27,901 INFO L899 garLoopResultBuilder]: For program point L6158(lines 6158 6162) no Hoare annotation was computed. [2022-11-16 12:46:27,901 INFO L895 garLoopResultBuilder]: At program point L6026(line 6026) 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-16 12:46:27,901 INFO L899 garLoopResultBuilder]: For program point L6026-1(line 6026) no Hoare annotation was computed. [2022-11-16 12:46:27,901 INFO L899 garLoopResultBuilder]: For program point L5960(lines 5907 6047) no Hoare annotation was computed. [2022-11-16 12:46:27,901 INFO L899 garLoopResultBuilder]: For program point L5861-2(line 5861) no Hoare annotation was computed. [2022-11-16 12:46:27,902 INFO L899 garLoopResultBuilder]: For program point L5861(line 5861) no Hoare annotation was computed. [2022-11-16 12:46:27,902 INFO L899 garLoopResultBuilder]: For program point L6076(lines 6076 6079) no Hoare annotation was computed. [2022-11-16 12:46:27,902 INFO L899 garLoopResultBuilder]: For program point L6109-1(lines 6065 6166) no Hoare annotation was computed. [2022-11-16 12:46:27,902 INFO L899 garLoopResultBuilder]: For program point L5944-2(lines 5936 5958) no Hoare annotation was computed. [2022-11-16 12:46:27,902 INFO L899 garLoopResultBuilder]: For program point L5944(lines 5944 5947) no Hoare annotation was computed. [2022-11-16 12:46:27,902 INFO L895 garLoopResultBuilder]: At program point L5845(line 5845) 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-16 12:46:27,902 INFO L899 garLoopResultBuilder]: For program point L6357(line 6357) no Hoare annotation was computed. [2022-11-16 12:46:27,903 INFO L899 garLoopResultBuilder]: For program point L5845-1(line 5845) no Hoare annotation was computed. [2022-11-16 12:46:27,903 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,903 INFO L899 garLoopResultBuilder]: For program point L5994-1(line 5994) no Hoare annotation was computed. [2022-11-16 12:46:27,903 INFO L899 garLoopResultBuilder]: For program point L6358(lines 6358 6364) no Hoare annotation was computed. [2022-11-16 12:46:27,903 INFO L895 garLoopResultBuilder]: At program point L5846(line 5846) 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-16 12:46:27,903 INFO L899 garLoopResultBuilder]: For program point L5846-1(line 5846) no Hoare annotation was computed. [2022-11-16 12:46:27,903 INFO L899 garLoopResultBuilder]: For program point L5995(lines 5995 5998) no Hoare annotation was computed. [2022-11-16 12:46:27,904 INFO L899 garLoopResultBuilder]: For program point L6028-1(line 6028) no Hoare annotation was computed. [2022-11-16 12:46:27,904 INFO L895 garLoopResultBuilder]: At program point L6028(line 6028) 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-16 12:46:27,904 INFO L899 garLoopResultBuilder]: For program point L5995-2(lines 5987 6004) no Hoare annotation was computed. [2022-11-16 12:46:27,904 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-16 12:46:27,904 INFO L895 garLoopResultBuilder]: At program point L5847(line 5847) 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-16 12:46:27,904 INFO L899 garLoopResultBuilder]: For program point L5847-1(line 5847) no Hoare annotation was computed. [2022-11-16 12:46:27,905 INFO L899 garLoopResultBuilder]: For program point L5913(lines 5913 5916) no Hoare annotation was computed. [2022-11-16 12:46:27,905 INFO L899 garLoopResultBuilder]: For program point L6095(lines 6065 6166) no Hoare annotation was computed. [2022-11-16 12:46:27,905 INFO L899 garLoopResultBuilder]: For program point L6673-1(line 6673) no Hoare annotation was computed. [2022-11-16 12:46:27,905 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,905 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,905 INFO L899 garLoopResultBuilder]: For program point L5963-1(line 5963) no Hoare annotation was computed. [2022-11-16 12:46:27,905 INFO L899 garLoopResultBuilder]: For program point ldv_irq_1EXIT(lines 6349 6374) no Hoare annotation was computed. [2022-11-16 12:46:27,906 INFO L895 garLoopResultBuilder]: At program point L6046(lines 5885 6048) 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-16 12:46:27,906 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,906 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,906 INFO L899 garLoopResultBuilder]: For program point L6013-1(line 6013) no Hoare annotation was computed. [2022-11-16 12:46:27,906 INFO L899 garLoopResultBuilder]: For program point L5848-1(line 5848) no Hoare annotation was computed. [2022-11-16 12:46:27,906 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,907 INFO L895 garLoopResultBuilder]: At program point L5848(line 5848) 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-16 12:46:27,907 INFO L899 garLoopResultBuilder]: For program point L5881-1(line 5881) no Hoare annotation was computed. [2022-11-16 12:46:27,907 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,907 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)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-16 12:46:27,907 INFO L899 garLoopResultBuilder]: For program point L6096(lines 6096 6104) no Hoare annotation was computed. [2022-11-16 12:46:27,907 INFO L899 garLoopResultBuilder]: For program point L6129-1(lines 6129 6136) no Hoare annotation was computed. [2022-11-16 12:46:27,908 INFO L899 garLoopResultBuilder]: For program point L6146(lines 6146 6149) no Hoare annotation was computed. [2022-11-16 12:46:27,908 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,908 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,908 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-16 12:46:27,908 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,908 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-16 12:46:27,909 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-16 12:46:27,909 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-16 12:46:27,909 INFO L902 garLoopResultBuilder]: At program point L7018(lines 7017 7019) the Hoare annotation is: true [2022-11-16 12:46:27,909 INFO L902 garLoopResultBuilder]: At program point L6316(lines 6311 6318) the Hoare annotation is: true [2022-11-16 12:46:27,909 INFO L899 garLoopResultBuilder]: For program point L6314-1(line 6314) no Hoare annotation was computed. [2022-11-16 12:46:27,909 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5300 5306) no Hoare annotation was computed. [2022-11-16 12:46:27,909 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5300 5306) the Hoare annotation is: true [2022-11-16 12:46:27,910 INFO L902 garLoopResultBuilder]: At program point L6938(lines 6937 6939) the Hoare annotation is: true [2022-11-16 12:46:27,910 INFO L902 garLoopResultBuilder]: At program point L6935(lines 6934 6936) the Hoare annotation is: true [2022-11-16 12:46:27,910 INFO L899 garLoopResultBuilder]: For program point sja1000_write_cmdregEXIT(lines 5534 5546) no Hoare annotation was computed. [2022-11-16 12:46:27,910 INFO L902 garLoopResultBuilder]: At program point sja1000_write_cmdregENTRY(lines 5534 5546) the Hoare annotation is: true [2022-11-16 12:46:27,910 INFO L902 garLoopResultBuilder]: At program point L5542(line 5542) the Hoare annotation is: true [2022-11-16 12:46:27,910 INFO L899 garLoopResultBuilder]: For program point sja1000_write_cmdregFINAL(lines 5534 5546) no Hoare annotation was computed. [2022-11-16 12:46:27,910 INFO L902 garLoopResultBuilder]: At program point L5224(lines 5220 5226) the Hoare annotation is: true [2022-11-16 12:46:27,911 INFO L902 garLoopResultBuilder]: At program point L5539(line 5539) the Hoare annotation is: true [2022-11-16 12:46:27,911 INFO L899 garLoopResultBuilder]: For program point L5539-1(line 5539) no Hoare annotation was computed. [2022-11-16 12:46:27,911 INFO L902 garLoopResultBuilder]: At program point L5541(line 5541) the Hoare annotation is: true [2022-11-16 12:46:27,911 INFO L899 garLoopResultBuilder]: For program point L5542-1(line 5542) no Hoare annotation was computed. [2022-11-16 12:46:27,911 INFO L899 garLoopResultBuilder]: For program point L5541-1(line 5541) no Hoare annotation was computed. [2022-11-16 12:46:27,911 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 5307 5312) no Hoare annotation was computed. [2022-11-16 12:46:27,911 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 5307 5312) the Hoare annotation is: true [2022-11-16 12:46:27,912 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 5307 5312) no Hoare annotation was computed. [2022-11-16 12:46:27,912 INFO L899 garLoopResultBuilder]: For program point netdev_privFINAL(lines 5371 5376) no Hoare annotation was computed. [2022-11-16 12:46:27,912 INFO L902 garLoopResultBuilder]: At program point netdev_privENTRY(lines 5371 5376) the Hoare annotation is: true [2022-11-16 12:46:27,912 INFO L899 garLoopResultBuilder]: For program point netdev_privEXIT(lines 5371 5376) no Hoare annotation was computed. [2022-11-16 12:46:27,912 INFO L899 garLoopResultBuilder]: For program point L6749-3(lines 6746 6775) no Hoare annotation was computed. [2022-11-16 12:46:27,912 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-16 12:46:27,913 INFO L899 garLoopResultBuilder]: For program point L6764-1(lines 6764 6767) no Hoare annotation was computed. [2022-11-16 12:46:27,913 INFO L899 garLoopResultBuilder]: For program point L6764(lines 6764 6767) no Hoare annotation was computed. [2022-11-16 12:46:27,913 INFO L899 garLoopResultBuilder]: For program point L6754(lines 6754 6758) no Hoare annotation was computed. [2022-11-16 12:46:27,913 INFO L899 garLoopResultBuilder]: For program point L6750(lines 6750 6753) no Hoare annotation was computed. [2022-11-16 12:46:27,913 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-16 12:46:27,913 INFO L899 garLoopResultBuilder]: For program point L6750-1(lines 6750 6753) no Hoare annotation was computed. [2022-11-16 12:46:27,913 INFO L899 garLoopResultBuilder]: For program point L6763-3(lines 6763 6770) no Hoare annotation was computed. [2022-11-16 12:46:27,914 INFO L899 garLoopResultBuilder]: For program point L6761-1(lines 6742 6776) no Hoare annotation was computed. [2022-11-16 12:46:27,914 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-16 12:46:27,914 INFO L899 garLoopResultBuilder]: For program point ldv_set_removeEXIT(lines 6742 6776) no Hoare annotation was computed. [2022-11-16 12:46:27,914 INFO L899 garLoopResultBuilder]: For program point netdev_get_tx_queueEXIT(lines 5364 5370) no Hoare annotation was computed. [2022-11-16 12:46:27,914 INFO L902 garLoopResultBuilder]: At program point netdev_get_tx_queueENTRY(lines 5364 5370) the Hoare annotation is: true [2022-11-16 12:46:27,914 INFO L899 garLoopResultBuilder]: For program point netdev_get_tx_queueFINAL(lines 5364 5370) no Hoare annotation was computed. [2022-11-16 12:46:27,915 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~TO~~u8~0EXIT(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,915 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~int~TO~~u8~0ENTRY(line -1) the Hoare annotation is: true [2022-11-16 12:46:27,915 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~TO~~u8~0FINAL(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,915 INFO L899 garLoopResultBuilder]: For program point close_candevEXIT(lines 6969 6971) no Hoare annotation was computed. [2022-11-16 12:46:27,915 INFO L902 garLoopResultBuilder]: At program point close_candevENTRY(lines 6969 6971) the Hoare annotation is: true [2022-11-16 12:46:27,915 INFO L899 garLoopResultBuilder]: For program point close_candevFINAL(lines 6969 6971) no Hoare annotation was computed. [2022-11-16 12:46:27,915 INFO L899 garLoopResultBuilder]: For program point L5410-1(line 5410) no Hoare annotation was computed. [2022-11-16 12:46:27,916 INFO L899 garLoopResultBuilder]: For program point netif_wake_queueEXIT(lines 5406 5414) no Hoare annotation was computed. [2022-11-16 12:46:27,916 INFO L899 garLoopResultBuilder]: For program point L5399(lines 5399 5402) no Hoare annotation was computed. [2022-11-16 12:46:27,916 INFO L902 garLoopResultBuilder]: At program point L5399-2(lines 5394 5405) the Hoare annotation is: true [2022-11-16 12:46:27,916 INFO L902 garLoopResultBuilder]: At program point netif_wake_queueENTRY(lines 5406 5414) the Hoare annotation is: true [2022-11-16 12:46:27,916 INFO L902 garLoopResultBuilder]: At program point L5198(lines 5192 5200) the Hoare annotation is: true [2022-11-16 12:46:27,916 INFO L902 garLoopResultBuilder]: At program point L6928(lines 6927 6929) the Hoare annotation is: true [2022-11-16 12:46:27,916 INFO L902 garLoopResultBuilder]: At program point L5410(line 5410) the Hoare annotation is: true [2022-11-16 12:46:27,917 INFO L899 garLoopResultBuilder]: For program point netif_wake_queueFINAL(lines 5406 5414) no Hoare annotation was computed. [2022-11-16 12:46:27,917 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5240 5242) the Hoare annotation is: true [2022-11-16 12:46:27,917 INFO L899 garLoopResultBuilder]: For program point L5241-2(lines 5240 5242) no Hoare annotation was computed. [2022-11-16 12:46:27,917 INFO L899 garLoopResultBuilder]: For program point L5241(line 5241) no Hoare annotation was computed. [2022-11-16 12:46:27,917 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5240 5242) no Hoare annotation was computed. [2022-11-16 12:46:27,917 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-16 12:46:27,917 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeFINAL(lines 6863 6869) no Hoare annotation was computed. [2022-11-16 12:46:27,918 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeEXIT(lines 6863 6869) no Hoare annotation was computed. [2022-11-16 12:46:27,918 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-16 12:46:27,918 INFO L902 garLoopResultBuilder]: At program point L5663(line 5663) the Hoare annotation is: true [2022-11-16 12:46:27,918 INFO L899 garLoopResultBuilder]: For program point L5663-1(line 5663) no Hoare annotation was computed. [2022-11-16 12:46:27,918 INFO L902 garLoopResultBuilder]: At program point L5634-2(lines 5634 5638) the Hoare annotation is: true [2022-11-16 12:46:27,918 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-16 12:46:27,919 INFO L899 garLoopResultBuilder]: For program point L5626(lines 5626 5630) no Hoare annotation was computed. [2022-11-16 12:46:27,919 INFO L899 garLoopResultBuilder]: For program point L5639(line 5639) no Hoare annotation was computed. [2022-11-16 12:46:27,919 INFO L902 garLoopResultBuilder]: At program point L5635(line 5635) the Hoare annotation is: true [2022-11-16 12:46:27,919 INFO L899 garLoopResultBuilder]: For program point L5635-1(line 5635) no Hoare annotation was computed. [2022-11-16 12:46:27,919 INFO L899 garLoopResultBuilder]: For program point L5664-1(line 5664) no Hoare annotation was computed. [2022-11-16 12:46:27,919 INFO L902 garLoopResultBuilder]: At program point L5664(line 5664) the Hoare annotation is: true [2022-11-16 12:46:27,919 INFO L902 garLoopResultBuilder]: At program point L5627(line 5627) the Hoare annotation is: true [2022-11-16 12:46:27,920 INFO L899 garLoopResultBuilder]: For program point L5627-1(line 5627) no Hoare annotation was computed. [2022-11-16 12:46:27,920 INFO L899 garLoopResultBuilder]: For program point L5656-1(line 5656) no Hoare annotation was computed. [2022-11-16 12:46:27,920 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-16 12:46:27,920 INFO L902 garLoopResultBuilder]: At program point L5619(line 5619) the Hoare annotation is: true [2022-11-16 12:46:27,920 INFO L899 garLoopResultBuilder]: For program point L5619-1(line 5619) no Hoare annotation was computed. [2022-11-16 12:46:27,920 INFO L899 garLoopResultBuilder]: For program point sja1000_startFINAL(lines 5651 5668) no Hoare annotation was computed. [2022-11-16 12:46:27,920 INFO L902 garLoopResultBuilder]: At program point L5648(lines 5609 5650) the Hoare annotation is: true [2022-11-16 12:46:27,921 INFO L902 garLoopResultBuilder]: At program point L5644(lines 5616 5649) the Hoare annotation is: true [2022-11-16 12:46:27,921 INFO L899 garLoopResultBuilder]: For program point L5640-1(line 5640) no Hoare annotation was computed. [2022-11-16 12:46:27,921 INFO L902 garLoopResultBuilder]: At program point L5640(line 5640) the Hoare annotation is: true [2022-11-16 12:46:27,921 INFO L899 garLoopResultBuilder]: For program point sja1000_startEXIT(lines 5651 5668) no Hoare annotation was computed. [2022-11-16 12:46:27,921 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-16 12:46:27,921 INFO L902 garLoopResultBuilder]: At program point L5637(line 5637) the Hoare annotation is: true [2022-11-16 12:46:27,921 INFO L899 garLoopResultBuilder]: For program point L5637-1(line 5637) no Hoare annotation was computed. [2022-11-16 12:46:27,922 INFO L902 garLoopResultBuilder]: At program point L5662(line 5662) the Hoare annotation is: true [2022-11-16 12:46:27,922 INFO L899 garLoopResultBuilder]: For program point L5658(lines 5658 5661) no Hoare annotation was computed. [2022-11-16 12:46:27,922 INFO L899 garLoopResultBuilder]: For program point L5662-1(line 5662) no Hoare annotation was computed. [2022-11-16 12:46:27,922 INFO L902 garLoopResultBuilder]: At program point L5629(line 5629) the Hoare annotation is: true [2022-11-16 12:46:27,922 INFO L899 garLoopResultBuilder]: For program point L5629-1(line 5629) no Hoare annotation was computed. [2022-11-16 12:46:27,922 INFO L899 garLoopResultBuilder]: For program point L5658-1(lines 5658 5661) no Hoare annotation was computed. [2022-11-16 12:46:27,922 INFO L902 garLoopResultBuilder]: At program point L5617(line 5617) the Hoare annotation is: true [2022-11-16 12:46:27,923 INFO L899 garLoopResultBuilder]: For program point L5617-1(line 5617) no Hoare annotation was computed. [2022-11-16 12:46:27,923 INFO L902 garLoopResultBuilder]: At program point L5642(lines 5616 5649) the Hoare annotation is: true [2022-11-16 12:46:27,923 INFO L899 garLoopResultBuilder]: For program point L5634(lines 5634 5638) no Hoare annotation was computed. [2022-11-16 12:46:27,923 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,923 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-11-16 12:46:27,923 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,923 INFO L902 garLoopResultBuilder]: At program point L5551(line 5551) the Hoare annotation is: true [2022-11-16 12:46:27,923 INFO L899 garLoopResultBuilder]: For program point L5551-1(line 5551) no Hoare annotation was computed. [2022-11-16 12:46:27,924 INFO L899 garLoopResultBuilder]: For program point sja1000_is_absentFINAL(lines 5547 5554) no Hoare annotation was computed. [2022-11-16 12:46:27,924 INFO L899 garLoopResultBuilder]: For program point sja1000_is_absentEXIT(lines 5547 5554) no Hoare annotation was computed. [2022-11-16 12:46:27,924 INFO L902 garLoopResultBuilder]: At program point sja1000_is_absentENTRY(lines 5547 5554) the Hoare annotation is: true [2022-11-16 12:46:27,924 INFO L899 garLoopResultBuilder]: For program point netif_stop_queueEXIT(lines 5437 5445) no Hoare annotation was computed. [2022-11-16 12:46:27,924 INFO L902 garLoopResultBuilder]: At program point L5182(lines 5178 5184) the Hoare annotation is: true [2022-11-16 12:46:27,925 INFO L902 garLoopResultBuilder]: At program point L5441(line 5441) the Hoare annotation is: true [2022-11-16 12:46:27,925 INFO L899 garLoopResultBuilder]: For program point L5441-1(line 5441) no Hoare annotation was computed. [2022-11-16 12:46:27,925 INFO L902 garLoopResultBuilder]: At program point L5434(lines 5415 5436) the Hoare annotation is: true [2022-11-16 12:46:27,925 INFO L899 garLoopResultBuilder]: For program point L5427(line 5427) no Hoare annotation was computed. [2022-11-16 12:46:27,925 INFO L902 garLoopResultBuilder]: At program point netif_stop_queueENTRY(lines 5437 5445) the Hoare annotation is: true [2022-11-16 12:46:27,925 INFO L899 garLoopResultBuilder]: For program point L5428(lines 5428 5432) no Hoare annotation was computed. [2022-11-16 12:46:27,925 INFO L899 garLoopResultBuilder]: For program point L5423(lines 5423 5426) no Hoare annotation was computed. [2022-11-16 12:46:27,925 INFO L902 garLoopResultBuilder]: At program point L5422(line 5422) the Hoare annotation is: true [2022-11-16 12:46:27,926 INFO L899 garLoopResultBuilder]: For program point L5422-1(line 5422) no Hoare annotation was computed. [2022-11-16 12:46:27,926 INFO L902 garLoopResultBuilder]: At program point L5423-2(lines 5423 5426) the Hoare annotation is: true [2022-11-16 12:46:27,926 INFO L902 garLoopResultBuilder]: At program point L7021(lines 7020 7022) the Hoare annotation is: true [2022-11-16 12:46:27,926 INFO L899 garLoopResultBuilder]: For program point netif_stop_queueFINAL(lines 5437 5445) no Hoare annotation was computed. [2022-11-16 12:46:27,926 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-16 12:46:27,926 INFO L902 garLoopResultBuilder]: At program point L5255(line 5255) the Hoare annotation is: true [2022-11-16 12:46:27,926 INFO L899 garLoopResultBuilder]: For program point L5255-1(line 5255) no Hoare annotation was computed. [2022-11-16 12:46:27,927 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5243 5259) no Hoare annotation was computed. [2022-11-16 12:46:27,927 INFO L899 garLoopResultBuilder]: For program point L5250(lines 5250 5257) no Hoare annotation was computed. [2022-11-16 12:46:27,927 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5243 5259) no Hoare annotation was computed. [2022-11-16 12:46:27,927 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,927 INFO L899 garLoopResultBuilder]: For program point L5272-1(line 5272) no Hoare annotation was computed. [2022-11-16 12:46:27,927 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 5260 5276) no Hoare annotation was computed. [2022-11-16 12:46:27,927 INFO L902 garLoopResultBuilder]: At program point L5272(line 5272) the Hoare annotation is: true [2022-11-16 12:46:27,928 INFO L899 garLoopResultBuilder]: For program point L5267(lines 5267 5274) no Hoare annotation was computed. [2022-11-16 12:46:27,928 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 (not (= ~ldv_irq_1_0~0 0)) .cse0 .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_irq_1_2~0 0))))) [2022-11-16 12:46:27,928 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 5260 5276) no Hoare annotation was computed. [2022-11-16 12:46:27,928 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-16 12:46:27,928 INFO L899 garLoopResultBuilder]: For program point L5783-1(line 5783) no Hoare annotation was computed. [2022-11-16 12:46:27,928 INFO L899 garLoopResultBuilder]: For program point L6510(lines 6510 6538) no Hoare annotation was computed. [2022-11-16 12:46:27,929 INFO L899 garLoopResultBuilder]: For program point L6543(line 6543) no Hoare annotation was computed. [2022-11-16 12:46:27,929 INFO L899 garLoopResultBuilder]: For program point L5486(lines 5486 5489) no Hoare annotation was computed. [2022-11-16 12:46:27,929 INFO L899 garLoopResultBuilder]: For program point L6576(line 6576) no Hoare annotation was computed. [2022-11-16 12:46:27,929 INFO L899 garLoopResultBuilder]: For program point L6609(line 6609) no Hoare annotation was computed. [2022-11-16 12:46:27,929 INFO L899 garLoopResultBuilder]: For program point L6378(lines 6378 6384) no Hoare annotation was computed. [2022-11-16 12:46:27,929 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-16 12:46:27,929 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-16 12:46:27,930 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-16 12:46:27,930 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-16 12:46:27,930 INFO L899 garLoopResultBuilder]: For program point L5784-1(line 5784) no Hoare annotation was computed. [2022-11-16 12:46:27,930 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-16 12:46:27,930 INFO L902 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: true [2022-11-16 12:46:27,930 INFO L899 garLoopResultBuilder]: For program point L6511(line 6511) no Hoare annotation was computed. [2022-11-16 12:46:27,930 INFO L899 garLoopResultBuilder]: For program point L6544(lines 6544 6607) no Hoare annotation was computed. [2022-11-16 12:46:27,931 INFO L899 garLoopResultBuilder]: For program point L6577(lines 6577 6581) no Hoare annotation was computed. [2022-11-16 12:46:27,931 INFO L899 garLoopResultBuilder]: For program point L6412(lines 6412 6415) no Hoare annotation was computed. [2022-11-16 12:46:27,931 INFO L899 garLoopResultBuilder]: For program point L6214(line 6214) no Hoare annotation was computed. [2022-11-16 12:46:27,931 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-16 12:46:27,931 INFO L899 garLoopResultBuilder]: For program point L5785-1(line 5785) no Hoare annotation was computed. [2022-11-16 12:46:27,931 INFO L899 garLoopResultBuilder]: For program point L6512(lines 6512 6517) no Hoare annotation was computed. [2022-11-16 12:46:27,931 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-16 12:46:27,932 INFO L899 garLoopResultBuilder]: For program point L5389-1(line 5389) no Hoare annotation was computed. [2022-11-16 12:46:27,932 INFO L899 garLoopResultBuilder]: For program point L6215(lines 6215 6218) no Hoare annotation was computed. [2022-11-16 12:46:27,932 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-16 12:46:27,932 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-16 12:46:27,932 INFO L899 garLoopResultBuilder]: For program point L6182-1(line 6182) no Hoare annotation was computed. [2022-11-16 12:46:27,932 INFO L899 garLoopResultBuilder]: For program point L6546(lines 6546 6604) no Hoare annotation was computed. [2022-11-16 12:46:27,932 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-16 12:46:27,933 INFO L899 garLoopResultBuilder]: For program point L6547(line 6547) no Hoare annotation was computed. [2022-11-16 12:46:27,933 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-16 12:46:27,933 INFO L899 garLoopResultBuilder]: For program point L6448-1(line 6448) no Hoare annotation was computed. [2022-11-16 12:46:27,933 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-16 12:46:27,933 INFO L899 garLoopResultBuilder]: For program point L6184-1(line 6184) no Hoare annotation was computed. [2022-11-16 12:46:27,933 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-16 12:46:27,933 INFO L899 garLoopResultBuilder]: For program point L5788-1(line 5788) no Hoare annotation was computed. [2022-11-16 12:46:27,934 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-16 12:46:27,934 INFO L895 garLoopResultBuilder]: At program point L6713(lines 6708 6715) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_irq_1_0~0 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_irq_1_2~0 0)) [2022-11-16 12:46:27,934 INFO L899 garLoopResultBuilder]: For program point L6548(lines 6548 6552) no Hoare annotation was computed. [2022-11-16 12:46:27,934 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-16 12:46:27,934 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-16 12:46:27,934 INFO L899 garLoopResultBuilder]: For program point L5789-1(line 5789) no Hoare annotation was computed. [2022-11-16 12:46:27,935 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-16 12:46:27,935 INFO L899 garLoopResultBuilder]: For program point L5492-1(lines 5480 5506) no Hoare annotation was computed. [2022-11-16 12:46:27,935 INFO L899 garLoopResultBuilder]: For program point L5492(lines 5492 5506) no Hoare annotation was computed. [2022-11-16 12:46:27,935 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-16 12:46:27,935 INFO L899 garLoopResultBuilder]: For program point L6186(lines 6186 6189) no Hoare annotation was computed. [2022-11-16 12:46:27,935 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-16 12:46:27,935 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-16 12:46:27,936 INFO L899 garLoopResultBuilder]: For program point L6913(lines 6913 6916) no Hoare annotation was computed. [2022-11-16 12:46:27,936 INFO L899 garLoopResultBuilder]: For program point L5790-1(line 5790) no Hoare annotation was computed. [2022-11-16 12:46:27,936 INFO L899 garLoopResultBuilder]: For program point L6583(line 6583) no Hoare annotation was computed. [2022-11-16 12:46:27,936 INFO L902 garLoopResultBuilder]: At program point L6616(lines 6479 6618) the Hoare annotation is: true [2022-11-16 12:46:27,936 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-16 12:46:27,936 INFO L899 garLoopResultBuilder]: For program point L5493-1(line 5493) no Hoare annotation was computed. [2022-11-16 12:46:27,936 INFO L899 garLoopResultBuilder]: For program point L6385(lines 6385 6391) no Hoare annotation was computed. [2022-11-16 12:46:27,937 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-11-16 12:46:27,937 INFO L899 garLoopResultBuilder]: For program point L5494(lines 5494 5503) no Hoare annotation was computed. [2022-11-16 12:46:27,937 INFO L899 garLoopResultBuilder]: For program point L6584(lines 6584 6592) no Hoare annotation was computed. [2022-11-16 12:46:27,937 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-16 12:46:27,937 INFO L902 garLoopResultBuilder]: At program point L6915-1(lines 6908 6919) the Hoare annotation is: true [2022-11-16 12:46:27,937 INFO L895 garLoopResultBuilder]: At program point L6915(line 6915) the Hoare annotation is: false [2022-11-16 12:46:27,937 INFO L899 garLoopResultBuilder]: For program point L6519(line 6519) no Hoare annotation was computed. [2022-11-16 12:46:27,938 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-16 12:46:27,938 INFO L899 garLoopResultBuilder]: For program point L6586(lines 6586 6590) no Hoare annotation was computed. [2022-11-16 12:46:27,938 INFO L899 garLoopResultBuilder]: For program point L6520(lines 6520 6534) no Hoare annotation was computed. [2022-11-16 12:46:27,938 INFO L899 garLoopResultBuilder]: For program point L6190(lines 6190 6199) no Hoare annotation was computed. [2022-11-16 12:46:27,938 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-16 12:46:27,938 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-16 12:46:27,938 INFO L899 garLoopResultBuilder]: For program point L6554(line 6554) no Hoare annotation was computed. [2022-11-16 12:46:27,939 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-16 12:46:27,939 INFO L899 garLoopResultBuilder]: For program point L5497-1(lines 5497 5498) no Hoare annotation was computed. [2022-11-16 12:46:27,939 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-16 12:46:27,939 INFO L899 garLoopResultBuilder]: For program point L5762-1(line 5762) no Hoare annotation was computed. [2022-11-16 12:46:27,939 INFO L899 garLoopResultBuilder]: For program point L6522(lines 6522 6527) no Hoare annotation was computed. [2022-11-16 12:46:27,939 INFO L899 garLoopResultBuilder]: For program point L6555(lines 6555 6559) no Hoare annotation was computed. [2022-11-16 12:46:27,939 INFO L899 garLoopResultBuilder]: For program point L6522-2(lines 6520 6533) no Hoare annotation was computed. [2022-11-16 12:46:27,940 INFO L899 garLoopResultBuilder]: For program point L6456(lines 6456 6460) no Hoare annotation was computed. [2022-11-16 12:46:27,940 INFO L899 garLoopResultBuilder]: For program point L6555-2(lines 6546 6604) no Hoare annotation was computed. [2022-11-16 12:46:27,940 INFO L899 garLoopResultBuilder]: For program point L5499(lines 5499 5502) no Hoare annotation was computed. [2022-11-16 12:46:27,940 INFO L899 garLoopResultBuilder]: For program point L6556-1(line 6556) no Hoare annotation was computed. [2022-11-16 12:46:27,940 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-16 12:46:27,940 INFO L899 garLoopResultBuilder]: For program point L6424(lines 6424 6439) no Hoare annotation was computed. [2022-11-16 12:46:27,940 INFO L899 garLoopResultBuilder]: For program point L6193(lines 6193 6197) no Hoare annotation was computed. [2022-11-16 12:46:27,941 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-16 12:46:27,941 INFO L899 garLoopResultBuilder]: For program point L5797-1(line 5797) no Hoare annotation was computed. [2022-11-16 12:46:27,941 INFO L899 garLoopResultBuilder]: For program point L6689-2(lines 6689 6692) no Hoare annotation was computed. [2022-11-16 12:46:27,941 INFO L899 garLoopResultBuilder]: For program point L6689(lines 6689 6692) no Hoare annotation was computed. [2022-11-16 12:46:27,941 INFO L899 garLoopResultBuilder]: For program point L6491-1(line 6491) no Hoare annotation was computed. [2022-11-16 12:46:27,941 INFO L895 garLoopResultBuilder]: At program point L6491(line 6491) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_irq_1_0~0 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_irq_1_2~0 0)) [2022-11-16 12:46:27,941 INFO L899 garLoopResultBuilder]: For program point L6392(lines 6392 6398) no Hoare annotation was computed. [2022-11-16 12:46:27,942 INFO L899 garLoopResultBuilder]: For program point L6425(line 6425) no Hoare annotation was computed. [2022-11-16 12:46:27,942 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-16 12:46:27,942 INFO L899 garLoopResultBuilder]: For program point L6194-1(line 6194) no Hoare annotation was computed. [2022-11-16 12:46:27,942 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-16 12:46:27,942 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-16 12:46:27,942 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-16 12:46:27,943 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-16 12:46:27,943 INFO L899 garLoopResultBuilder]: For program point L6426-1(line 6426) no Hoare annotation was computed. [2022-11-16 12:46:27,943 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-16 12:46:27,943 INFO L899 garLoopResultBuilder]: For program point L5766(lines 5766 5769) no Hoare annotation was computed. [2022-11-16 12:46:27,943 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,943 INFO L899 garLoopResultBuilder]: For program point L6428(line 6428) no Hoare annotation was computed. [2022-11-16 12:46:27,943 INFO L899 garLoopResultBuilder]: For program point L6461(lines 6461 6465) no Hoare annotation was computed. [2022-11-16 12:46:27,944 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-16 12:46:27,944 INFO L899 garLoopResultBuilder]: For program point L6594(line 6594) no Hoare annotation was computed. [2022-11-16 12:46:27,944 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-16 12:46:27,944 INFO L899 garLoopResultBuilder]: For program point L6561-1(line 6561) no Hoare annotation was computed. [2022-11-16 12:46:27,944 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-16 12:46:27,944 INFO L899 garLoopResultBuilder]: For program point L6429-1(line 6429) no Hoare annotation was computed. [2022-11-16 12:46:27,944 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-16 12:46:27,945 INFO L899 garLoopResultBuilder]: For program point L6595(lines 6595 6600) no Hoare annotation was computed. [2022-11-16 12:46:27,945 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-16 12:46:27,945 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-16 12:46:27,945 INFO L895 garLoopResultBuilder]: At program point L6860(lines 6856 6862) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_irq_1_0~0 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_irq_1_2~0 0)) [2022-11-16 12:46:27,945 INFO L899 garLoopResultBuilder]: For program point L5770-1(line 5770) no Hoare annotation was computed. [2022-11-16 12:46:27,945 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-16 12:46:27,945 INFO L899 garLoopResultBuilder]: For program point L6431(line 6431) no Hoare annotation was computed. [2022-11-16 12:46:27,946 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-16 12:46:27,946 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-16 12:46:27,946 INFO L899 garLoopResultBuilder]: For program point L6432-1(line 6432) no Hoare annotation was computed. [2022-11-16 12:46:27,946 INFO L899 garLoopResultBuilder]: For program point L6399(lines 6399 6405) no Hoare annotation was computed. [2022-11-16 12:46:27,946 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-16 12:46:27,946 INFO L899 garLoopResultBuilder]: For program point L6201(line 6201) no Hoare annotation was computed. [2022-11-16 12:46:27,947 INFO L899 garLoopResultBuilder]: For program point L5805(lines 5805 5809) no Hoare annotation was computed. [2022-11-16 12:46:27,947 INFO L899 garLoopResultBuilder]: For program point L6466(lines 6466 6470) no Hoare annotation was computed. [2022-11-16 12:46:27,947 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,947 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-16 12:46:27,947 INFO L899 garLoopResultBuilder]: For program point L6566(line 6566) no Hoare annotation was computed. [2022-11-16 12:46:27,947 INFO L899 garLoopResultBuilder]: For program point L6434(line 6434) no Hoare annotation was computed. [2022-11-16 12:46:27,947 INFO L899 garLoopResultBuilder]: For program point L6500(lines 6500 6611) no Hoare annotation was computed. [2022-11-16 12:46:27,948 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-16 12:46:27,948 INFO L899 garLoopResultBuilder]: For program point L5774(lines 5774 5777) no Hoare annotation was computed. [2022-11-16 12:46:27,948 INFO L899 garLoopResultBuilder]: For program point L5774-2(lines 5761 5811) no Hoare annotation was computed. [2022-11-16 12:46:27,948 INFO L899 garLoopResultBuilder]: For program point L6567(lines 6567 6574) no Hoare annotation was computed. [2022-11-16 12:46:27,948 INFO L899 garLoopResultBuilder]: For program point L6435-1(line 6435) no Hoare annotation was computed. [2022-11-16 12:46:27,948 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-16 12:46:27,948 INFO L899 garLoopResultBuilder]: For program point L6501(line 6501) no Hoare annotation was computed. [2022-11-16 12:46:27,949 INFO L899 garLoopResultBuilder]: For program point L5808-1(lines 5805 5809) no Hoare annotation was computed. [2022-11-16 12:46:27,949 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-16 12:46:27,949 INFO L899 garLoopResultBuilder]: For program point L6502(lines 6502 6505) no Hoare annotation was computed. [2022-11-16 12:46:27,949 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-16 12:46:27,949 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,949 INFO L899 garLoopResultBuilder]: For program point L6602(line 6602) no Hoare annotation was computed. [2022-11-16 12:46:27,949 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-16 12:46:27,950 INFO L899 garLoopResultBuilder]: For program point L6536(line 6536) no Hoare annotation was computed. [2022-11-16 12:46:27,950 INFO L899 garLoopResultBuilder]: For program point L6569(lines 6569 6572) no Hoare annotation was computed. [2022-11-16 12:46:27,950 INFO L899 garLoopResultBuilder]: For program point L6437(line 6437) no Hoare annotation was computed. [2022-11-16 12:46:27,950 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-16 12:46:27,950 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-16 12:46:27,950 INFO L902 garLoopResultBuilder]: At program point L6603(line 6603) the Hoare annotation is: true [2022-11-16 12:46:27,950 INFO L902 garLoopResultBuilder]: At program point L6438(line 6438) the Hoare annotation is: true [2022-11-16 12:46:27,951 INFO L899 garLoopResultBuilder]: For program point L6471(lines 6471 6475) no Hoare annotation was computed. [2022-11-16 12:46:27,951 INFO L902 garLoopResultBuilder]: At program point L6537(line 6537) the Hoare annotation is: true [2022-11-16 12:46:27,951 INFO L899 garLoopResultBuilder]: For program point L5480(lines 5480 5506) no Hoare annotation was computed. [2022-11-16 12:46:27,951 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-16 12:46:27,951 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-16 12:46:27,951 INFO L899 garLoopResultBuilder]: For program point L5778-1(lines 5778 5791) no Hoare annotation was computed. [2022-11-16 12:46:27,951 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-16 12:46:27,952 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-16 12:46:27,952 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-16 12:46:27,952 INFO L899 garLoopResultBuilder]: For program point L5481-1(line 5481) no Hoare annotation was computed. [2022-11-16 12:46:27,952 INFO L899 garLoopResultBuilder]: For program point L5482(lines 5482 5490) no Hoare annotation was computed. [2022-11-16 12:46:27,952 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-16 12:46:27,952 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-16 12:46:27,953 INFO L899 garLoopResultBuilder]: For program point L6507(line 6507) no Hoare annotation was computed. [2022-11-16 12:46:27,953 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-16 12:46:27,953 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-16 12:46:27,953 INFO L899 garLoopResultBuilder]: For program point L5781-1(line 5781) no Hoare annotation was computed. [2022-11-16 12:46:27,953 INFO L899 garLoopResultBuilder]: For program point L6508(lines 6508 6541) no Hoare annotation was computed. [2022-11-16 12:46:27,953 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-16 12:46:27,953 INFO L899 garLoopResultBuilder]: For program point L6211-1(line 6211) no Hoare annotation was computed. [2022-11-16 12:46:27,954 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-16 12:46:27,954 INFO L899 garLoopResultBuilder]: For program point L5782-1(line 5782) no Hoare annotation was computed. [2022-11-16 12:46:27,954 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-16 12:46:27,954 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-16 12:46:27,954 INFO L899 garLoopResultBuilder]: For program point L5485-1(line 5485) no Hoare annotation was computed. [2022-11-16 12:46:27,954 INFO L902 garLoopResultBuilder]: At program point spinlock_checkENTRY(lines 5214 5219) the Hoare annotation is: true [2022-11-16 12:46:27,954 INFO L899 garLoopResultBuilder]: For program point spinlock_checkEXIT(lines 5214 5219) no Hoare annotation was computed. [2022-11-16 12:46:27,955 INFO L899 garLoopResultBuilder]: For program point spinlock_checkFINAL(lines 5214 5219) no Hoare annotation was computed. [2022-11-16 12:46:27,955 INFO L899 garLoopResultBuilder]: For program point can_change_mtuFINAL(lines 6953 6955) no Hoare annotation was computed. [2022-11-16 12:46:27,955 INFO L902 garLoopResultBuilder]: At program point can_change_mtuENTRY(lines 6953 6955) the Hoare annotation is: true [2022-11-16 12:46:27,955 INFO L899 garLoopResultBuilder]: For program point can_change_mtuEXIT(lines 6953 6955) no Hoare annotation was computed. [2022-11-16 12:46:27,955 INFO L899 garLoopResultBuilder]: For program point can_led_eventFINAL(lines 6963 6965) no Hoare annotation was computed. [2022-11-16 12:46:27,955 INFO L902 garLoopResultBuilder]: At program point can_led_eventENTRY(lines 6963 6965) the Hoare annotation is: true [2022-11-16 12:46:27,955 INFO L899 garLoopResultBuilder]: For program point can_led_eventEXIT(lines 6963 6965) no Hoare annotation was computed. [2022-11-16 12:46:27,959 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:27,961 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:46:27,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:27,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:27,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:27,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:27,983 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:27,984 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:27,984 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:27,984 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,011 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,015 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,015 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,030 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,034 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,035 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,035 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:46:28 BoogieIcfgContainer [2022-11-16 12:46:28,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:46:28,036 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:46:28,036 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:46:28,037 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:46:28,037 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:06" (3/4) ... [2022-11-16 12:46:28,040 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 12:46:28,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free_int [2022-11-16 12:46:28,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2022-11-16 12:46:28,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure set_reset_mode [2022-11-16 12:46:28,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-16 12:46:28,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_irq_1 [2022-11-16 12:46:28,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-11-16 12:46:28,050 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-16 12:46:28,050 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_write_cmdreg [2022-11-16 12:46:28,050 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2022-11-16 12:46:28,050 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netdev_priv [2022-11-16 12:46:28,050 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_set_remove [2022-11-16 12:46:28,050 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netdev_get_tx_queue [2022-11-16 12:46:28,050 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-16 12:46:28,050 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure close_candev [2022-11-16 12:46:28,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_wake_queue [2022-11-16 12:46:28,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-16 12:46:28,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free [2022-11-16 12:46:28,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_start [2022-11-16 12:46:28,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-16 12:46:28,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_is_absent [2022-11-16 12:46:28,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_stop_queue [2022-11-16 12:46:28,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-16 12:46:28,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-11-16 12:46:28,052 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2022-11-16 12:46:28,052 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_change_mtu [2022-11-16 12:46:28,052 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_led_event [2022-11-16 12:46:28,083 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 180 nodes and edges [2022-11-16 12:46:28,087 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2022-11-16 12:46:28,089 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-16 12:46:28,092 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-16 12:46:28,094 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-16 12:46:28,096 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 12:46:28,099 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 12:46:28,137 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-16 12:46:28,137 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-16 12:46:28,138 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,141 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-16 12:46:28,142 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-16 12:46:28,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && !(\result == 0)) && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,142 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-16 12:46:28,145 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-16 12:46:28,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,147 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-16 12:46:28,147 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-16 12:46:28,147 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-16 12:46:28,147 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-16 12:46:28,147 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-16 12:46:28,147 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-16 12:46:28,148 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-16 12:46:28,148 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-16 12:46:28,148 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-16 12:46:28,148 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-16 12:46:28,149 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-16 12:46:28,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,150 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-16 12:46:28,150 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-16 12:46:28,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,152 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-16 12:46:28,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,153 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-16 12:46:28,153 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-16 12:46:28,153 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-16 12:46:28,153 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,154 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,154 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-16 12:46:28,154 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-16 12:46:28,154 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-16 12:46:28,154 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-16 12:46:28,155 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-16 12:46:28,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,155 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-16 12:46:28,156 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,156 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-16 12:46:28,156 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-16 12:46:28,156 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(ldv_retval_0 == 0) || !(\old(last_index) == 0) [2022-11-16 12:46:28,157 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-16 12:46:28,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,157 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-16 12:46:28,158 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-16 12:46:28,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-16 12:46:28,158 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-16 12:46:28,159 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-16 12:46:28,159 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-16 12:46:28,159 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-16 12:46:28,159 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-16 12:46:28,160 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-16 12:46:28,295 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:46:28,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:46:28,297 INFO L158 Benchmark]: Toolchain (without parser) took 206683.01ms. Allocated memory was 88.1MB in the beginning and 2.3GB in the end (delta: 2.3GB). Free memory was 60.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-16 12:46:28,297 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 88.1MB. Free memory was 66.7MB in the beginning and 66.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:46:28,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2157.22ms. Allocated memory was 88.1MB in the beginning and 159.4MB in the end (delta: 71.3MB). Free memory was 60.3MB in the beginning and 87.9MB in the end (delta: -27.6MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2022-11-16 12:46:28,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 181.11ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 75.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:46:28,298 INFO L158 Benchmark]: Boogie Preprocessor took 142.41ms. Allocated memory is still 159.4MB. Free memory was 75.3MB in the beginning and 63.7MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:46:28,299 INFO L158 Benchmark]: RCFGBuilder took 2248.15ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 63.7MB in the beginning and 110.0MB in the end (delta: -46.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2022-11-16 12:46:28,299 INFO L158 Benchmark]: TraceAbstraction took 201686.29ms. Allocated memory was 207.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 110.0MB in the beginning and 1.1GB in the end (delta: -987.9MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-16 12:46:28,300 INFO L158 Benchmark]: Witness Printer took 259.42ms. Allocated memory is still 2.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-16 12:46:28,302 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.27ms. Allocated memory is still 88.1MB. Free memory was 66.7MB in the beginning and 66.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2157.22ms. Allocated memory was 88.1MB in the beginning and 159.4MB in the end (delta: 71.3MB). Free memory was 60.3MB in the beginning and 87.9MB in the end (delta: -27.6MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 181.11ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 75.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 142.41ms. Allocated memory is still 159.4MB. Free memory was 75.3MB in the beginning and 63.7MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2248.15ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 63.7MB in the beginning and 110.0MB in the end (delta: -46.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 201686.29ms. Allocated memory was 207.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 110.0MB in the beginning and 1.1GB in the end (delta: -987.9MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 259.42ms. Allocated memory is still 2.3GB. Free memory was 1.1GB in the beginning and 1.1GB 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: 201.5s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 157.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12179 SdHoareTripleChecker+Valid, 29.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11270 mSDsluCounter, 20714 SdHoareTripleChecker+Invalid, 25.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14183 mSDsCounter, 6155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15402 IncrementalHoareTripleChecker+Invalid, 21557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6155 mSolverCounterUnsat, 6531 mSDtfsCounter, 15402 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12777occurred in iteration=9, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 19482 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 212 LocationsWithAnnotation, 40895 PreInvPairs, 47446 NumberOfFragments, 2248 HoareAnnotationTreeSize, 40895 FomulaSimplifications, 602112 FormulaSimplificationTreeSizeReduction, 121.7s HoareSimplificationTime, 212 FomulaSimplificationsInter, 4132664 FormulaSimplificationTreeSizeReductionInter, 35.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 831 ConstructedInterpolants, 0 QuantifiedInterpolants, 1653 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 241/241 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)) || \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: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - 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)) || \old(last_index) == last_index - InvariantResult [Line: 6262]: Loop Invariant [2022-11-16 12:46:28,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,319 WARN L421 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: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6065]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - 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_irq_1_0 == 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_irq_1_0 == 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)) || \old(last_index) == last_index - InvariantResult [Line: 5862]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \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: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - 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)) || \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: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6949]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \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-16 12:46:28,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,328 WARN L421 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)) || \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: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6109]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - 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-16 12:46:28,332 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,332 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,332 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,333 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,333 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,333 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,333 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,333 WARN L421 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)) || \old(last_index) == last_index - InvariantResult [Line: 5582]: Loop Invariant [2022-11-16 12:46:28,334 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,336 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,336 WARN L421 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-16 12:46:28,336 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,338 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,338 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,338 WARN L421 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-16 12:46:28,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:46:28,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:46:28,341 WARN L421 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-16 12:46:28,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc713f8-c039-4b0d-bb50-0f2e294dae14/bin/uautomizer-tPACEb0tL8/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