./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 8393723b 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_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/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_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 19:47:10,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:47:10,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:47:10,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:47:10,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:47:10,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:47:10,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:47:10,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:47:10,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:47:10,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:47:10,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:47:10,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:47:10,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:47:10,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:47:10,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:47:10,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:47:10,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:47:10,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:47:10,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:47:10,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:47:10,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:47:10,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:47:10,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:47:10,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:47:10,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:47:10,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:47:10,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:47:10,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:47:10,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:47:10,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:47:10,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:47:10,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:47:10,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:47:10,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:47:10,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:47:10,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:47:10,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:47:10,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:47:10,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:47:10,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:47:10,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:47:10,646 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 19:47:10,691 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:47:10,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:47:10,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:47:10,693 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:47:10,694 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:47:10,694 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:47:10,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:47:10,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:47:10,695 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:47:10,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:47:10,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:47:10,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:47:10,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:47:10,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:47:10,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:47:10,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:47:10,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:47:10,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:47:10,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:47:10,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:47:10,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:47:10,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:47:10,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:47:10,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:47:10,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:47:10,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:47:10,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:47:10,701 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:47:10,701 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:47:10,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:47:10,702 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_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/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_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro 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-18 19:47:10,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:47:11,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:47:11,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:47:11,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:47:11,018 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:47:11,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/../../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-18 19:47:11,097 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/data/2121d8ded/f3719a642ad6455186a0ecb826a29cd2/FLAG830540466 [2022-11-18 19:47:11,962 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:47:11,966 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/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-18 19:47:12,020 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/data/2121d8ded/f3719a642ad6455186a0ecb826a29cd2/FLAG830540466 [2022-11-18 19:47:12,488 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/data/2121d8ded/f3719a642ad6455186a0ecb826a29cd2 [2022-11-18 19:47:12,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:47:12,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:47:12,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:47:12,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:47:12,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:47:12,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:47:12" (1/1) ... [2022-11-18 19:47:12,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c88cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:12, skipping insertion in model container [2022-11-18 19:47:12,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:47:12" (1/1) ... [2022-11-18 19:47:12,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:47:12,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:47:13,408 WARN L234 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_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/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-18 19:47:13,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:47:14,026 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:47:14,224 WARN L234 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_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/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-18 19:47:14,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:47:14,779 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:47:14,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14 WrapperNode [2022-11-18 19:47:14,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:47:14,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:47:14,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:47:14,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:47:14,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:14,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:15,004 INFO L138 Inliner]: procedures = 141, calls = 780, calls flagged for inlining = 69, calls inlined = 55, statements flattened = 1741 [2022-11-18 19:47:15,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:47:15,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:47:15,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:47:15,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:47:15,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:15,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:15,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:15,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:15,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:15,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:15,115 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:15,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:15,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:47:15,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:47:15,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:47:15,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:47:15,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (1/1) ... [2022-11-18 19:47:15,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:47:15,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:47:15,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:47:15,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:47:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 19:47:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 19:47:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:47:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_write_cmdreg [2022-11-18 19:47:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_write_cmdreg [2022-11-18 19:47:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-11-18 19:47:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-11-18 19:47:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-18 19:47:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-18 19:47:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-18 19:47:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-18 19:47:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 19:47:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 19:47:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:47:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure set_reset_mode [2022-11-18 19:47:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure set_reset_mode [2022-11-18 19:47:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-18 19:47:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-18 19:47:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-18 19:47:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-18 19:47:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-18 19:47:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-18 19:47:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 19:47:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 19:47:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_is_absent [2022-11-18 19:47:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_is_absent [2022-11-18 19:47:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-18 19:47:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-18 19:47:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:47:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-18 19:47:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-18 19:47:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-11-18 19:47:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-11-18 19:47:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:47:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-11-18 19:47:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-11-18 19:47:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:47:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:47:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-11-18 19:47:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-11-18 19:47:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-18 19:47:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-18 19:47:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:47:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-18 19:47:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-18 19:47:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2022-11-18 19:47:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2022-11-18 19:47:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:47:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 19:47:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-18 19:47:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-18 19:47:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-18 19:47:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-18 19:47:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-11-18 19:47:15,259 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-11-18 19:47:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:47:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_start [2022-11-18 19:47:15,261 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_start [2022-11-18 19:47:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-18 19:47:15,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-18 19:47:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:47:15,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:47:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure can_change_mtu [2022-11-18 19:47:15,264 INFO L138 BoogieDeclarations]: Found implementation of procedure can_change_mtu [2022-11-18 19:47:15,821 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:47:15,824 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:47:16,798 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-18 19:47:17,587 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:47:17,598 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:47:17,599 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 19:47:17,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:47:17 BoogieIcfgContainer [2022-11-18 19:47:17,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:47:17,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:47:17,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:47:17,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:47:17,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:47:12" (1/3) ... [2022-11-18 19:47:17,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaa71fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:47:17, skipping insertion in model container [2022-11-18 19:47:17,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:47:14" (2/3) ... [2022-11-18 19:47:17,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaa71fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:47:17, skipping insertion in model container [2022-11-18 19:47:17,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:47:17" (3/3) ... [2022-11-18 19:47:17,615 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-18 19:47:17,637 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:47:17,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:47:17,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:47:17,724 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;@7b39553c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:47:17,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:47:17,731 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-18 19:47:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 19:47:17,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:17,744 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-18 19:47:17,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:17,750 INFO L85 PathProgramCache]: Analyzing trace with hash 689378182, now seen corresponding path program 1 times [2022-11-18 19:47:17,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:17,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551494857] [2022-11-18 19:47:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:17,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:18,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:47:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:18,493 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-18 19:47:18,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:18,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551494857] [2022-11-18 19:47:18,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551494857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:18,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:18,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:47:18,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975947130] [2022-11-18 19:47:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:18,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:47:18,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:47:18,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:47:18,556 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-18 19:47:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:21,055 INFO L93 Difference]: Finished difference Result 1593 states and 2315 transitions. [2022-11-18 19:47:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:47:21,058 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-18 19:47:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:21,084 INFO L225 Difference]: With dead ends: 1593 [2022-11-18 19:47:21,084 INFO L226 Difference]: Without dead ends: 1069 [2022-11-18 19:47:21,099 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-18 19:47:21,102 INFO L413 NwaCegarLoop]: 629 mSDtfsCounter, 873 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1382 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.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:21,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1382 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-18 19:47:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2022-11-18 19:47:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 973. [2022-11-18 19:47:21,340 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-18 19:47:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1373 transitions. [2022-11-18 19:47:21,354 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1373 transitions. Word has length 22 [2022-11-18 19:47:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:21,360 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1373 transitions. [2022-11-18 19:47:21,360 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-18 19:47:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1373 transitions. [2022-11-18 19:47:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 19:47:21,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:21,370 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-18 19:47:21,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:47:21,371 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:21,372 INFO L85 PathProgramCache]: Analyzing trace with hash -881467453, now seen corresponding path program 1 times [2022-11-18 19:47:21,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:21,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809936939] [2022-11-18 19:47:21,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:21,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:21,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:47:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:21,632 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-18 19:47:21,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809936939] [2022-11-18 19:47:21,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809936939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:21,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:21,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:47:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449387055] [2022-11-18 19:47:21,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:21,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:47:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:21,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:47:21,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:47:21,638 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-18 19:47:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:23,382 INFO L93 Difference]: Finished difference Result 2035 states and 2880 transitions. [2022-11-18 19:47:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:47:23,383 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-18 19:47:23,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:23,400 INFO L225 Difference]: With dead ends: 2035 [2022-11-18 19:47:23,401 INFO L226 Difference]: Without dead ends: 1068 [2022-11-18 19:47:23,406 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-18 19:47:23,412 INFO L413 NwaCegarLoop]: 732 mSDtfsCounter, 945 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1650 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.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:23,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 1650 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-18 19:47:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-11-18 19:47:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 972. [2022-11-18 19:47:23,518 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-18 19:47:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1369 transitions. [2022-11-18 19:47:23,526 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1369 transitions. Word has length 25 [2022-11-18 19:47:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:23,526 INFO L495 AbstractCegarLoop]: Abstraction has 972 states and 1369 transitions. [2022-11-18 19:47:23,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 19:47:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1369 transitions. [2022-11-18 19:47:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:47:23,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:23,531 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-18 19:47:23,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:47:23,532 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:23,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash 120933822, now seen corresponding path program 1 times [2022-11-18 19:47:23,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:23,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20722026] [2022-11-18 19:47:23,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:23,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:23,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:47:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:23,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:47:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:23,919 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-18 19:47:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:23,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20722026] [2022-11-18 19:47:23,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20722026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:23,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:23,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:47:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842700564] [2022-11-18 19:47:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:23,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:47:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:47:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:47:23,922 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-18 19:47:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:26,731 INFO L93 Difference]: Finished difference Result 2116 states and 3026 transitions. [2022-11-18 19:47:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:47:26,732 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-18 19:47:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:26,744 INFO L225 Difference]: With dead ends: 2116 [2022-11-18 19:47:26,745 INFO L226 Difference]: Without dead ends: 2109 [2022-11-18 19:47:26,746 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-18 19:47:26,747 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 853 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:26,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 2420 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-18 19:47:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2022-11-18 19:47:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1927. [2022-11-18 19:47:26,883 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-18 19:47:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2742 transitions. [2022-11-18 19:47:26,898 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2742 transitions. Word has length 39 [2022-11-18 19:47:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:26,898 INFO L495 AbstractCegarLoop]: Abstraction has 1927 states and 2742 transitions. [2022-11-18 19:47:26,898 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-18 19:47:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2742 transitions. [2022-11-18 19:47:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-18 19:47:26,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:26,905 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-18 19:47:26,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:47:26,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:26,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1929035325, now seen corresponding path program 1 times [2022-11-18 19:47:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:26,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325378808] [2022-11-18 19:47:26,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:27,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:47:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:47:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:47:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:27,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 19:47:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:27,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:47:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:27,145 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-18 19:47:27,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:27,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325378808] [2022-11-18 19:47:27,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325378808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:27,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:27,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:47:27,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575251059] [2022-11-18 19:47:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:27,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:47:27,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:27,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:47:27,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:47:27,150 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-18 19:47:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:30,931 INFO L93 Difference]: Finished difference Result 6036 states and 8716 transitions. [2022-11-18 19:47:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:47:30,932 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-18 19:47:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:30,964 INFO L225 Difference]: With dead ends: 6036 [2022-11-18 19:47:30,965 INFO L226 Difference]: Without dead ends: 4115 [2022-11-18 19:47:30,976 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-18 19:47:30,982 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 969 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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, 3.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:30,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1707 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-18 19:47:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2022-11-18 19:47:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 3404. [2022-11-18 19:47:31,247 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-18 19:47:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4815 transitions. [2022-11-18 19:47:31,283 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4815 transitions. Word has length 75 [2022-11-18 19:47:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:31,285 INFO L495 AbstractCegarLoop]: Abstraction has 3404 states and 4815 transitions. [2022-11-18 19:47:31,285 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-18 19:47:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4815 transitions. [2022-11-18 19:47:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-18 19:47:31,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:31,293 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-18 19:47:31,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:47:31,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash 449695519, now seen corresponding path program 2 times [2022-11-18 19:47:31,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:31,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850968774] [2022-11-18 19:47:31,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:31,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:31,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:47:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:47:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:31,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 19:47:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:47:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:31,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:47:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:31,564 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-18 19:47:31,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:31,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850968774] [2022-11-18 19:47:31,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850968774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:31,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:31,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:47:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926301807] [2022-11-18 19:47:31,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:31,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:47:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:31,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:47:31,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:47:31,571 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-18 19:47:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:35,028 INFO L93 Difference]: Finished difference Result 7056 states and 10078 transitions. [2022-11-18 19:47:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:47:35,028 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-18 19:47:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:35,058 INFO L225 Difference]: With dead ends: 7056 [2022-11-18 19:47:35,058 INFO L226 Difference]: Without dead ends: 3665 [2022-11-18 19:47:35,077 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-18 19:47:35,078 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 1048 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:35,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1550 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-18 19:47:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states. [2022-11-18 19:47:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 3008. [2022-11-18 19:47:35,296 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-18 19:47:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4224 transitions. [2022-11-18 19:47:35,318 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4224 transitions. Word has length 75 [2022-11-18 19:47:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:35,318 INFO L495 AbstractCegarLoop]: Abstraction has 3008 states and 4224 transitions. [2022-11-18 19:47:35,319 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-18 19:47:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4224 transitions. [2022-11-18 19:47:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-18 19:47:35,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:35,326 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-18 19:47:35,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:47:35,326 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:35,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:35,327 INFO L85 PathProgramCache]: Analyzing trace with hash 555634897, now seen corresponding path program 1 times [2022-11-18 19:47:35,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:35,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431177491] [2022-11-18 19:47:35,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:35,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:47:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:35,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:47:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 19:47:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-18 19:47:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:47:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:35,567 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-18 19:47:35,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:35,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431177491] [2022-11-18 19:47:35,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431177491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:35,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:35,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:47:35,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567204900] [2022-11-18 19:47:35,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:35,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:47:35,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:35,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:47:35,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:47:35,573 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-18 19:47:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:39,972 INFO L93 Difference]: Finished difference Result 6849 states and 9792 transitions. [2022-11-18 19:47:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:47:39,973 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-18 19:47:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:40,015 INFO L225 Difference]: With dead ends: 6849 [2022-11-18 19:47:40,017 INFO L226 Difference]: Without dead ends: 4495 [2022-11-18 19:47:40,030 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-18 19:47:40,031 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 902 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:40,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 2150 Invalid, 1902 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [473 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-18 19:47:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2022-11-18 19:47:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 3691. [2022-11-18 19:47:40,298 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-18 19:47:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 5169 transitions. [2022-11-18 19:47:40,319 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 5169 transitions. Word has length 88 [2022-11-18 19:47:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:40,319 INFO L495 AbstractCegarLoop]: Abstraction has 3691 states and 5169 transitions. [2022-11-18 19:47:40,320 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-18 19:47:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 5169 transitions. [2022-11-18 19:47:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-18 19:47:40,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:40,336 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-18 19:47:40,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:47:40,336 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:40,337 INFO L85 PathProgramCache]: Analyzing trace with hash 270042671, now seen corresponding path program 1 times [2022-11-18 19:47:40,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:40,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282170899] [2022-11-18 19:47:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:40,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:47:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:47:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 19:47:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 19:47:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:47:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 19:47:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 19:47:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 19:47:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-18 19:47:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:47:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:40,714 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-18 19:47:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:40,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282170899] [2022-11-18 19:47:40,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282170899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:40,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:40,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:47:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066923621] [2022-11-18 19:47:40,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:40,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:47:40,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:40,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:47:40,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:47:40,717 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-18 19:47:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:43,365 INFO L93 Difference]: Finished difference Result 8262 states and 11885 transitions. [2022-11-18 19:47:43,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:47:43,365 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-18 19:47:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:43,401 INFO L225 Difference]: With dead ends: 8262 [2022-11-18 19:47:43,401 INFO L226 Difference]: Without dead ends: 4584 [2022-11-18 19:47:43,435 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-18 19:47:43,436 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 600 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:43,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1540 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-18 19:47:43,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2022-11-18 19:47:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 3701. [2022-11-18 19:47:43,842 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-18 19:47:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 5179 transitions. [2022-11-18 19:47:43,874 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 5179 transitions. Word has length 127 [2022-11-18 19:47:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:43,875 INFO L495 AbstractCegarLoop]: Abstraction has 3701 states and 5179 transitions. [2022-11-18 19:47:43,876 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-18 19:47:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 5179 transitions. [2022-11-18 19:47:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-18 19:47:43,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:43,891 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-18 19:47:43,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:47:43,891 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1356573346, now seen corresponding path program 1 times [2022-11-18 19:47:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:43,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279569900] [2022-11-18 19:47:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:43,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:47:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:47:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:47:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 19:47:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 19:47:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 19:47:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-18 19:47:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 19:47:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 19:47:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 19:47:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:47:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:44,445 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-18 19:47:44,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:44,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279569900] [2022-11-18 19:47:44,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279569900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:44,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:44,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:47:44,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118828117] [2022-11-18 19:47:44,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:44,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:47:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:47:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:47:44,448 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-18 19:47:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:49,451 INFO L93 Difference]: Finished difference Result 12254 states and 17621 transitions. [2022-11-18 19:47:49,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:47:49,459 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-18 19:47:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:49,527 INFO L225 Difference]: With dead ends: 12254 [2022-11-18 19:47:49,527 INFO L226 Difference]: Without dead ends: 8853 [2022-11-18 19:47:49,561 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-18 19:47:49,563 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 1698 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 2073 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 2073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:49,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 2364 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 2073 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-18 19:47:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2022-11-18 19:47:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 7252. [2022-11-18 19:47:50,146 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-18 19:47:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7252 states to 7252 states and 10143 transitions. [2022-11-18 19:47:50,190 INFO L78 Accepts]: Start accepts. Automaton has 7252 states and 10143 transitions. Word has length 128 [2022-11-18 19:47:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:50,192 INFO L495 AbstractCegarLoop]: Abstraction has 7252 states and 10143 transitions. [2022-11-18 19:47:50,192 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-18 19:47:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand 7252 states and 10143 transitions. [2022-11-18 19:47:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-18 19:47:50,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:50,212 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] [2022-11-18 19:47:50,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:47:50,212 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:47:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1296487203, now seen corresponding path program 1 times [2022-11-18 19:47:50,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:50,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021992550] [2022-11-18 19:47:50,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:50,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:47:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:47:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:47:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 19:47:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 19:47:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 19:47:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-18 19:47:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 19:47:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 19:47:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 19:47:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:47:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:50,848 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-18 19:47:50,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:50,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021992550] [2022-11-18 19:47:50,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021992550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:50,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:50,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:47:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749827008] [2022-11-18 19:47:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:50,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:47:50,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:50,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:47:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:47:50,853 INFO L87 Difference]: Start difference. First operand 7252 states and 10143 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 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-18 19:47:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:58,669 INFO L93 Difference]: Finished difference Result 34041 states and 50986 transitions. [2022-11-18 19:47:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 19:47:58,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 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 131 [2022-11-18 19:47:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:58,863 INFO L225 Difference]: With dead ends: 34041 [2022-11-18 19:47:58,864 INFO L226 Difference]: Without dead ends: 27227 [2022-11-18 19:47:58,916 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-18 19:47:58,919 INFO L413 NwaCegarLoop]: 918 mSDtfsCounter, 2340 mSDsluCounter, 2776 mSDsCounter, 0 mSdLazyCounter, 3206 mSolverCounterSat, 1355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2524 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 4561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1355 IncrementalHoareTripleChecker+Valid, 3206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:58,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2524 Valid, 3694 Invalid, 4561 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1355 Valid, 3206 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-18 19:47:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27227 states. [2022-11-18 19:48:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27227 to 12775. [2022-11-18 19:48:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12775 states, 9535 states have (on average 1.3210277923439957) internal successors, (12596), 9713 states have internal predecessors, (12596), 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-18 19:48:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12775 states to 12775 states and 17873 transitions. [2022-11-18 19:48:00,516 INFO L78 Accepts]: Start accepts. Automaton has 12775 states and 17873 transitions. Word has length 131 [2022-11-18 19:48:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:48:00,517 INFO L495 AbstractCegarLoop]: Abstraction has 12775 states and 17873 transitions. [2022-11-18 19:48:00,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 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-18 19:48:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 12775 states and 17873 transitions. [2022-11-18 19:48:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-18 19:48:00,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:48:00,542 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-18 19:48:00,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:48:00,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:48:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash 112532482, now seen corresponding path program 1 times [2022-11-18 19:48:00,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:00,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373919071] [2022-11-18 19:48:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:00,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:48:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:48:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 19:48:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 19:48:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:48:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 19:48:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 19:48:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-18 19:48:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 19:48:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:48:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:01,353 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-18 19:48:01,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:01,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373919071] [2022-11-18 19:48:01,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373919071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:01,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:01,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 19:48:01,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470948821] [2022-11-18 19:48:01,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:01,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:48:01,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:01,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:48:01,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:48:01,356 INFO L87 Difference]: Start difference. First operand 12775 states and 17873 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-18 19:48:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:48:05,375 INFO L93 Difference]: Finished difference Result 20313 states and 28875 transitions. [2022-11-18 19:48:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:48:05,376 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-18 19:48:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:48:05,380 INFO L225 Difference]: With dead ends: 20313 [2022-11-18 19:48:05,380 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 19:48:05,437 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-18 19:48:05,438 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 1066 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:48:05,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 1951 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-18 19:48:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 19:48:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 19:48:05,440 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-18 19:48:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 19:48:05,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2022-11-18 19:48:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:48:05,444 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 19:48:05,444 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-18 19:48:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 19:48:05,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 19:48:05,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 19:48:05,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:48:05,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 19:50:48,755 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-18 19:50:48,755 INFO L899 garLoopResultBuilder]: For program point ldv_skb_free_intFINAL(lines 6870 6876) no Hoare annotation was computed. [2022-11-18 19:50:48,755 INFO L899 garLoopResultBuilder]: For program point ldv_skb_free_intEXIT(lines 6870 6876) no Hoare annotation was computed. [2022-11-18 19:50:48,756 INFO L899 garLoopResultBuilder]: For program point L6873-1(line 6873) no Hoare annotation was computed. [2022-11-18 19:50:48,756 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-18 19:50:48,756 INFO L899 garLoopResultBuilder]: For program point __const_udelayFINAL(lines 6920 6922) no Hoare annotation was computed. [2022-11-18 19:50:48,756 INFO L899 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 6920 6922) no Hoare annotation was computed. [2022-11-18 19:50:48,756 INFO L902 garLoopResultBuilder]: At program point __const_udelayENTRY(lines 6920 6922) the Hoare annotation is: true [2022-11-18 19:50:48,757 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-18 19:50:48,757 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-18 19:50:48,757 INFO L899 garLoopResultBuilder]: For program point L5596-1(line 5596) no Hoare annotation was computed. [2022-11-18 19:50:48,757 INFO L899 garLoopResultBuilder]: For program point set_reset_modeFINAL(lines 5575 5608) no Hoare annotation was computed. [2022-11-18 19:50:48,757 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-18 19:50:48,757 INFO L899 garLoopResultBuilder]: For program point L5598-1(line 5598) no Hoare annotation was computed. [2022-11-18 19:50:48,758 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-18 19:50:48,758 INFO L899 garLoopResultBuilder]: For program point L5597-1(line 5597) no Hoare annotation was computed. [2022-11-18 19:50:48,758 INFO L899 garLoopResultBuilder]: For program point set_reset_modeEXIT(lines 5575 5608) no Hoare annotation was computed. [2022-11-18 19:50:48,758 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-18 19:50:48,758 INFO L899 garLoopResultBuilder]: For program point L5587-1(line 5587) no Hoare annotation was computed. [2022-11-18 19:50:48,759 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-18 19:50:48,759 INFO L899 garLoopResultBuilder]: For program point L5583-1(line 5583) no Hoare annotation was computed. [2022-11-18 19:50:48,759 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-18 19:50:48,759 INFO L899 garLoopResultBuilder]: For program point L5585-1(line 5585) no Hoare annotation was computed. [2022-11-18 19:50:48,759 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-18 19:50:48,760 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-18 19:50:48,760 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 5293 5299) no Hoare annotation was computed. [2022-11-18 19:50:48,760 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 5293 5299) the Hoare annotation is: true [2022-11-18 19:50:48,760 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5297) no Hoare annotation was computed. [2022-11-18 19:50:48,760 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 5293 5299) no Hoare annotation was computed. [2022-11-18 19:50:48,760 INFO L899 garLoopResultBuilder]: For program point L6014(lines 6014 6017) no Hoare annotation was computed. [2022-11-18 19:50:48,761 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-18 19:50:48,761 INFO L899 garLoopResultBuilder]: For program point L6113-1(line 6113) no Hoare annotation was computed. [2022-11-18 19:50:48,761 INFO L899 garLoopResultBuilder]: For program point L6146-2(lines 6065 6166) no Hoare annotation was computed. [2022-11-18 19:50:48,761 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-18 19:50:48,761 INFO L899 garLoopResultBuilder]: For program point L6014-2(lines 6014 6017) no Hoare annotation was computed. [2022-11-18 19:50:48,761 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-18 19:50:48,762 INFO L899 garLoopResultBuilder]: For program point L6031(lines 6031 6037) no Hoare annotation was computed. [2022-11-18 19:50:48,762 INFO L899 garLoopResultBuilder]: For program point L5965(lines 5965 5979) no Hoare annotation was computed. [2022-11-18 19:50:48,762 INFO L899 garLoopResultBuilder]: For program point L6031-2(lines 6031 6037) no Hoare annotation was computed. [2022-11-18 19:50:48,762 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-18 19:50:48,762 INFO L899 garLoopResultBuilder]: For program point L6114(lines 6114 6121) no Hoare annotation was computed. [2022-11-18 19:50:48,762 INFO L899 garLoopResultBuilder]: For program point L6147-1(line 6147) no Hoare annotation was computed. [2022-11-18 19:50:48,763 INFO L899 garLoopResultBuilder]: For program point L5850(line 5850) no Hoare annotation was computed. [2022-11-18 19:50:48,763 INFO L899 garLoopResultBuilder]: For program point L5850-2(line 5850) no Hoare annotation was computed. [2022-11-18 19:50:48,763 INFO L899 garLoopResultBuilder]: For program point L6131(lines 6131 6134) no Hoare annotation was computed. [2022-11-18 19:50:48,763 INFO L899 garLoopResultBuilder]: For program point L5966(line 5966) no Hoare annotation was computed. [2022-11-18 19:50:48,763 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-18 19:50:48,764 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-18 19:50:48,764 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-18 19:50:48,764 INFO L899 garLoopResultBuilder]: For program point L5834-1(line 5834) no Hoare annotation was computed. [2022-11-18 19:50:48,764 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-18 19:50:48,764 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-18 19:50:48,764 INFO L899 garLoopResultBuilder]: For program point L6115-1(line 6115) no Hoare annotation was computed. [2022-11-18 19:50:48,765 INFO L899 garLoopResultBuilder]: For program point L6082-1(line 6082) no Hoare annotation was computed. [2022-11-18 19:50:48,765 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-18 19:50:48,765 INFO L899 garLoopResultBuilder]: For program point L6941-1(line 6941) no Hoare annotation was computed. [2022-11-18 19:50:48,765 INFO L899 garLoopResultBuilder]: For program point L5917(lines 5917 5935) no Hoare annotation was computed. [2022-11-18 19:50:48,765 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-18 19:50:48,765 INFO L899 garLoopResultBuilder]: For program point L5917-1(lines 5907 6047) no Hoare annotation was computed. [2022-11-18 19:50:48,766 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-18 19:50:48,766 INFO L899 garLoopResultBuilder]: For program point L5868-1(line 5868) no Hoare annotation was computed. [2022-11-18 19:50:48,766 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-18 19:50:48,766 INFO L899 garLoopResultBuilder]: For program point L6083(lines 6083 6090) no Hoare annotation was computed. [2022-11-18 19:50:48,766 INFO L899 garLoopResultBuilder]: For program point L6116(lines 6116 6119) no Hoare annotation was computed. [2022-11-18 19:50:48,766 INFO L899 garLoopResultBuilder]: For program point L6083-2(lines 6065 6166) no Hoare annotation was computed. [2022-11-18 19:50:48,767 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-18 19:50:48,767 INFO L899 garLoopResultBuilder]: For program point L6100-1(line 6100) no Hoare annotation was computed. [2022-11-18 19:50:48,767 INFO L899 garLoopResultBuilder]: For program point L6067-1(line 6067) no Hoare annotation was computed. [2022-11-18 19:50:48,767 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-18 19:50:48,767 INFO L899 garLoopResultBuilder]: For program point L6150(lines 6150 6164) no Hoare annotation was computed. [2022-11-18 19:50:48,768 INFO L899 garLoopResultBuilder]: For program point L6084-1(line 6084) no Hoare annotation was computed. [2022-11-18 19:50:48,768 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-18 19:50:48,768 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-18 19:50:48,768 INFO L899 garLoopResultBuilder]: For program point L6018-1(line 6018) no Hoare annotation was computed. [2022-11-18 19:50:48,768 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-18 19:50:48,768 INFO L899 garLoopResultBuilder]: For program point L5853-1(line 5853) no Hoare annotation was computed. [2022-11-18 19:50:48,769 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-18 19:50:48,769 INFO L899 garLoopResultBuilder]: For program point L5969(line 5969) no Hoare annotation was computed. [2022-11-18 19:50:48,769 INFO L899 garLoopResultBuilder]: For program point L5936(lines 5907 6047) no Hoare annotation was computed. [2022-11-18 19:50:48,769 INFO L899 garLoopResultBuilder]: For program point L6085(lines 6085 6088) no Hoare annotation was computed. [2022-11-18 19:50:48,769 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-18 19:50:48,769 INFO L899 garLoopResultBuilder]: For program point L6366(line 6366) no Hoare annotation was computed. [2022-11-18 19:50:48,770 INFO L899 garLoopResultBuilder]: For program point L6944-1(line 6944) no Hoare annotation was computed. [2022-11-18 19:50:48,770 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-18 19:50:48,770 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-18 19:50:48,770 INFO L899 garLoopResultBuilder]: For program point L5953(lines 5953 5957) no Hoare annotation was computed. [2022-11-18 19:50:48,770 INFO L899 garLoopResultBuilder]: For program point L5854-1(line 5854) no Hoare annotation was computed. [2022-11-18 19:50:48,770 INFO L899 garLoopResultBuilder]: For program point L5871(lines 5871 5874) no Hoare annotation was computed. [2022-11-18 19:50:48,771 INFO L899 garLoopResultBuilder]: For program point L5838(lines 5838 5841) no Hoare annotation was computed. [2022-11-18 19:50:48,771 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-18 19:50:48,771 INFO L899 garLoopResultBuilder]: For program point L5987(lines 5907 6047) no Hoare annotation was computed. [2022-11-18 19:50:48,771 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-18 19:50:48,771 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-18 19:50:48,771 INFO L899 garLoopResultBuilder]: For program point L6665-1(line 6665) no Hoare annotation was computed. [2022-11-18 19:50:48,772 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-18 19:50:48,772 INFO L899 garLoopResultBuilder]: For program point L6071(lines 6071 6074) no Hoare annotation was computed. [2022-11-18 19:50:48,772 INFO L899 garLoopResultBuilder]: For program point L6071-2(lines 6071 6074) no Hoare annotation was computed. [2022-11-18 19:50:48,772 INFO L899 garLoopResultBuilder]: For program point L5972(line 5972) no Hoare annotation was computed. [2022-11-18 19:50:48,772 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-18 19:50:48,772 INFO L899 garLoopResultBuilder]: For program point L5857-3(line 5857) no Hoare annotation was computed. [2022-11-18 19:50:48,773 INFO L899 garLoopResultBuilder]: For program point L5857-1(line 5857) no Hoare annotation was computed. [2022-11-18 19:50:48,773 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-18 19:50:48,773 INFO L899 garLoopResultBuilder]: For program point L6072-1(line 6072) no Hoare annotation was computed. [2022-11-18 19:50:48,773 INFO L899 garLoopResultBuilder]: For program point ldv_irq_1FINAL(lines 6349 6374) no Hoare annotation was computed. [2022-11-18 19:50:48,773 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-18 19:50:48,773 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-18 19:50:48,773 INFO L899 garLoopResultBuilder]: For program point L6006-1(lines 6006 6024) no Hoare annotation was computed. [2022-11-18 19:50:48,773 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-18 19:50:48,773 INFO L899 garLoopResultBuilder]: For program point L5924-1(line 5924) no Hoare annotation was computed. [2022-11-18 19:50:48,774 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-18 19:50:48,774 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-18 19:50:48,774 INFO L899 garLoopResultBuilder]: For program point L6139-1(line 6139) no Hoare annotation was computed. [2022-11-18 19:50:48,774 INFO L899 garLoopResultBuilder]: For program point L6354(lines 6354 6371) no Hoare annotation was computed. [2022-11-18 19:50:48,774 INFO L899 garLoopResultBuilder]: For program point L5908-1(line 5908) no Hoare annotation was computed. [2022-11-18 19:50:48,774 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-18 19:50:48,774 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-18 19:50:48,775 INFO L899 garLoopResultBuilder]: For program point L5842-1(line 5842) no Hoare annotation was computed. [2022-11-18 19:50:48,775 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-18 19:50:48,775 INFO L899 garLoopResultBuilder]: For program point L5925-2(lines 5925 5928) no Hoare annotation was computed. [2022-11-18 19:50:48,775 INFO L899 garLoopResultBuilder]: For program point L5925(lines 5925 5928) no Hoare annotation was computed. [2022-11-18 19:50:48,775 INFO L899 garLoopResultBuilder]: For program point L6140(lines 6140 6143) no Hoare annotation was computed. [2022-11-18 19:50:48,775 INFO L899 garLoopResultBuilder]: For program point L5975(line 5975) no Hoare annotation was computed. [2022-11-18 19:50:48,775 INFO L899 garLoopResultBuilder]: For program point L5843(lines 5843 5856) no Hoare annotation was computed. [2022-11-18 19:50:48,776 INFO L899 garLoopResultBuilder]: For program point L5843-1(lines 5833 5883) no Hoare annotation was computed. [2022-11-18 19:50:48,776 INFO L899 garLoopResultBuilder]: For program point L6091-1(lines 6065 6166) no Hoare annotation was computed. [2022-11-18 19:50:48,776 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-18 19:50:48,776 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-18 19:50:48,776 INFO L899 garLoopResultBuilder]: For program point L6157-1(line 6157) no Hoare annotation was computed. [2022-11-18 19:50:48,776 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-18 19:50:48,777 INFO L899 garLoopResultBuilder]: For program point L6025-2(lines 6025 6041) no Hoare annotation was computed. [2022-11-18 19:50:48,777 INFO L899 garLoopResultBuilder]: For program point L6025(lines 6025 6041) no Hoare annotation was computed. [2022-11-18 19:50:48,777 INFO L899 garLoopResultBuilder]: For program point L5860-1(lines 5860 5875) no Hoare annotation was computed. [2022-11-18 19:50:48,777 INFO L899 garLoopResultBuilder]: For program point L5860(lines 5860 5875) no Hoare annotation was computed. [2022-11-18 19:50:48,777 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-18 19:50:48,777 INFO L899 garLoopResultBuilder]: For program point L6075-1(line 6075) no Hoare annotation was computed. [2022-11-18 19:50:48,777 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-18 19:50:48,778 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-18 19:50:48,778 INFO L899 garLoopResultBuilder]: For program point L5943-1(line 5943) no Hoare annotation was computed. [2022-11-18 19:50:48,778 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-18 19:50:48,778 INFO L899 garLoopResultBuilder]: For program point L6356(lines 6356 6368) no Hoare annotation was computed. [2022-11-18 19:50:48,778 INFO L899 garLoopResultBuilder]: For program point L5877-1(line 5877) no Hoare annotation was computed. [2022-11-18 19:50:48,778 INFO L899 garLoopResultBuilder]: For program point L6158(lines 6158 6162) no Hoare annotation was computed. [2022-11-18 19:50:48,779 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-18 19:50:48,779 INFO L899 garLoopResultBuilder]: For program point L6026-1(line 6026) no Hoare annotation was computed. [2022-11-18 19:50:48,779 INFO L899 garLoopResultBuilder]: For program point L5960(lines 5907 6047) no Hoare annotation was computed. [2022-11-18 19:50:48,779 INFO L899 garLoopResultBuilder]: For program point L5861-2(line 5861) no Hoare annotation was computed. [2022-11-18 19:50:48,779 INFO L899 garLoopResultBuilder]: For program point L5861(line 5861) no Hoare annotation was computed. [2022-11-18 19:50:48,779 INFO L899 garLoopResultBuilder]: For program point L6076(lines 6076 6079) no Hoare annotation was computed. [2022-11-18 19:50:48,779 INFO L899 garLoopResultBuilder]: For program point L6109-1(lines 6065 6166) no Hoare annotation was computed. [2022-11-18 19:50:48,780 INFO L899 garLoopResultBuilder]: For program point L5944-2(lines 5936 5958) no Hoare annotation was computed. [2022-11-18 19:50:48,780 INFO L899 garLoopResultBuilder]: For program point L5944(lines 5944 5947) no Hoare annotation was computed. [2022-11-18 19:50:48,780 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-18 19:50:48,780 INFO L899 garLoopResultBuilder]: For program point L6357(line 6357) no Hoare annotation was computed. [2022-11-18 19:50:48,780 INFO L899 garLoopResultBuilder]: For program point L5845-1(line 5845) no Hoare annotation was computed. [2022-11-18 19:50:48,780 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-18 19:50:48,781 INFO L899 garLoopResultBuilder]: For program point L5994-1(line 5994) no Hoare annotation was computed. [2022-11-18 19:50:48,781 INFO L899 garLoopResultBuilder]: For program point L6358(lines 6358 6364) no Hoare annotation was computed. [2022-11-18 19:50:48,781 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-18 19:50:48,781 INFO L899 garLoopResultBuilder]: For program point L5846-1(line 5846) no Hoare annotation was computed. [2022-11-18 19:50:48,781 INFO L899 garLoopResultBuilder]: For program point L5995(lines 5995 5998) no Hoare annotation was computed. [2022-11-18 19:50:48,781 INFO L899 garLoopResultBuilder]: For program point L6028-1(line 6028) no Hoare annotation was computed. [2022-11-18 19:50:48,782 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-18 19:50:48,782 INFO L899 garLoopResultBuilder]: For program point L5995-2(lines 5987 6004) no Hoare annotation was computed. [2022-11-18 19:50:48,782 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-18 19:50:48,782 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-18 19:50:48,782 INFO L899 garLoopResultBuilder]: For program point L5847-1(line 5847) no Hoare annotation was computed. [2022-11-18 19:50:48,782 INFO L899 garLoopResultBuilder]: For program point L5913(lines 5913 5916) no Hoare annotation was computed. [2022-11-18 19:50:48,782 INFO L899 garLoopResultBuilder]: For program point L6095(lines 6065 6166) no Hoare annotation was computed. [2022-11-18 19:50:48,783 INFO L899 garLoopResultBuilder]: For program point L6673-1(line 6673) no Hoare annotation was computed. [2022-11-18 19:50:48,783 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-18 19:50:48,783 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-18 19:50:48,783 INFO L899 garLoopResultBuilder]: For program point L5963-1(line 5963) no Hoare annotation was computed. [2022-11-18 19:50:48,783 INFO L899 garLoopResultBuilder]: For program point ldv_irq_1EXIT(lines 6349 6374) no Hoare annotation was computed. [2022-11-18 19:50:48,783 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-18 19:50:48,784 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-18 19:50:48,784 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-18 19:50:48,784 INFO L899 garLoopResultBuilder]: For program point L6013-1(line 6013) no Hoare annotation was computed. [2022-11-18 19:50:48,784 INFO L899 garLoopResultBuilder]: For program point L5848-1(line 5848) no Hoare annotation was computed. [2022-11-18 19:50:48,784 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-18 19:50:48,785 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-18 19:50:48,785 INFO L899 garLoopResultBuilder]: For program point L5881-1(line 5881) no Hoare annotation was computed. [2022-11-18 19:50:48,785 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-18 19:50:48,785 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-18 19:50:48,785 INFO L899 garLoopResultBuilder]: For program point L6096(lines 6096 6104) no Hoare annotation was computed. [2022-11-18 19:50:48,785 INFO L899 garLoopResultBuilder]: For program point L6129-1(lines 6129 6136) no Hoare annotation was computed. [2022-11-18 19:50:48,785 INFO L899 garLoopResultBuilder]: For program point L6146(lines 6146 6149) no Hoare annotation was computed. [2022-11-18 19:50:48,786 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,786 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,786 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-18 19:50:48,786 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,786 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-18 19:50:48,787 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-18 19:50:48,787 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-18 19:50:48,787 INFO L902 garLoopResultBuilder]: At program point L7018(lines 7017 7019) the Hoare annotation is: true [2022-11-18 19:50:48,787 INFO L902 garLoopResultBuilder]: At program point L6316(lines 6311 6318) the Hoare annotation is: true [2022-11-18 19:50:48,787 INFO L899 garLoopResultBuilder]: For program point L6314-1(line 6314) no Hoare annotation was computed. [2022-11-18 19:50:48,788 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5300 5306) no Hoare annotation was computed. [2022-11-18 19:50:48,788 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5300 5306) the Hoare annotation is: true [2022-11-18 19:50:48,788 INFO L902 garLoopResultBuilder]: At program point L6938(lines 6937 6939) the Hoare annotation is: true [2022-11-18 19:50:48,788 INFO L902 garLoopResultBuilder]: At program point L6935(lines 6934 6936) the Hoare annotation is: true [2022-11-18 19:50:48,788 INFO L899 garLoopResultBuilder]: For program point sja1000_write_cmdregEXIT(lines 5534 5546) no Hoare annotation was computed. [2022-11-18 19:50:48,788 INFO L902 garLoopResultBuilder]: At program point sja1000_write_cmdregENTRY(lines 5534 5546) the Hoare annotation is: true [2022-11-18 19:50:48,788 INFO L902 garLoopResultBuilder]: At program point L5542(line 5542) the Hoare annotation is: true [2022-11-18 19:50:48,789 INFO L899 garLoopResultBuilder]: For program point sja1000_write_cmdregFINAL(lines 5534 5546) no Hoare annotation was computed. [2022-11-18 19:50:48,789 INFO L902 garLoopResultBuilder]: At program point L5224(lines 5220 5226) the Hoare annotation is: true [2022-11-18 19:50:48,789 INFO L902 garLoopResultBuilder]: At program point L5539(line 5539) the Hoare annotation is: true [2022-11-18 19:50:48,789 INFO L899 garLoopResultBuilder]: For program point L5539-1(line 5539) no Hoare annotation was computed. [2022-11-18 19:50:48,789 INFO L902 garLoopResultBuilder]: At program point L5541(line 5541) the Hoare annotation is: true [2022-11-18 19:50:48,789 INFO L899 garLoopResultBuilder]: For program point L5542-1(line 5542) no Hoare annotation was computed. [2022-11-18 19:50:48,790 INFO L899 garLoopResultBuilder]: For program point L5541-1(line 5541) no Hoare annotation was computed. [2022-11-18 19:50:48,790 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 5307 5312) no Hoare annotation was computed. [2022-11-18 19:50:48,790 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 5307 5312) the Hoare annotation is: true [2022-11-18 19:50:48,790 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 5307 5312) no Hoare annotation was computed. [2022-11-18 19:50:48,790 INFO L899 garLoopResultBuilder]: For program point netdev_privFINAL(lines 5371 5376) no Hoare annotation was computed. [2022-11-18 19:50:48,790 INFO L902 garLoopResultBuilder]: At program point netdev_privENTRY(lines 5371 5376) the Hoare annotation is: true [2022-11-18 19:50:48,790 INFO L899 garLoopResultBuilder]: For program point netdev_privEXIT(lines 5371 5376) no Hoare annotation was computed. [2022-11-18 19:50:48,791 INFO L899 garLoopResultBuilder]: For program point L6749-3(lines 6746 6775) no Hoare annotation was computed. [2022-11-18 19:50:48,791 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-18 19:50:48,791 INFO L899 garLoopResultBuilder]: For program point L6764-1(lines 6764 6767) no Hoare annotation was computed. [2022-11-18 19:50:48,791 INFO L899 garLoopResultBuilder]: For program point L6764(lines 6764 6767) no Hoare annotation was computed. [2022-11-18 19:50:48,791 INFO L899 garLoopResultBuilder]: For program point L6754(lines 6754 6758) no Hoare annotation was computed. [2022-11-18 19:50:48,791 INFO L899 garLoopResultBuilder]: For program point L6750(lines 6750 6753) no Hoare annotation was computed. [2022-11-18 19:50:48,792 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-18 19:50:48,792 INFO L899 garLoopResultBuilder]: For program point L6750-1(lines 6750 6753) no Hoare annotation was computed. [2022-11-18 19:50:48,792 INFO L899 garLoopResultBuilder]: For program point L6763-3(lines 6763 6770) no Hoare annotation was computed. [2022-11-18 19:50:48,792 INFO L899 garLoopResultBuilder]: For program point L6761-1(lines 6742 6776) no Hoare annotation was computed. [2022-11-18 19:50:48,792 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-18 19:50:48,792 INFO L899 garLoopResultBuilder]: For program point ldv_set_removeEXIT(lines 6742 6776) no Hoare annotation was computed. [2022-11-18 19:50:48,793 INFO L899 garLoopResultBuilder]: For program point netdev_get_tx_queueEXIT(lines 5364 5370) no Hoare annotation was computed. [2022-11-18 19:50:48,793 INFO L902 garLoopResultBuilder]: At program point netdev_get_tx_queueENTRY(lines 5364 5370) the Hoare annotation is: true [2022-11-18 19:50:48,793 INFO L899 garLoopResultBuilder]: For program point netdev_get_tx_queueFINAL(lines 5364 5370) no Hoare annotation was computed. [2022-11-18 19:50:48,793 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~TO~~u8~0EXIT(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,793 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~int~TO~~u8~0ENTRY(line -1) the Hoare annotation is: true [2022-11-18 19:50:48,793 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~TO~~u8~0FINAL(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,794 INFO L899 garLoopResultBuilder]: For program point close_candevEXIT(lines 6969 6971) no Hoare annotation was computed. [2022-11-18 19:50:48,794 INFO L902 garLoopResultBuilder]: At program point close_candevENTRY(lines 6969 6971) the Hoare annotation is: true [2022-11-18 19:50:48,794 INFO L899 garLoopResultBuilder]: For program point close_candevFINAL(lines 6969 6971) no Hoare annotation was computed. [2022-11-18 19:50:48,794 INFO L899 garLoopResultBuilder]: For program point L5410-1(line 5410) no Hoare annotation was computed. [2022-11-18 19:50:48,794 INFO L899 garLoopResultBuilder]: For program point netif_wake_queueEXIT(lines 5406 5414) no Hoare annotation was computed. [2022-11-18 19:50:48,794 INFO L899 garLoopResultBuilder]: For program point L5399(lines 5399 5402) no Hoare annotation was computed. [2022-11-18 19:50:48,795 INFO L902 garLoopResultBuilder]: At program point L5399-2(lines 5394 5405) the Hoare annotation is: true [2022-11-18 19:50:48,795 INFO L902 garLoopResultBuilder]: At program point netif_wake_queueENTRY(lines 5406 5414) the Hoare annotation is: true [2022-11-18 19:50:48,795 INFO L902 garLoopResultBuilder]: At program point L5198(lines 5192 5200) the Hoare annotation is: true [2022-11-18 19:50:48,795 INFO L902 garLoopResultBuilder]: At program point L6928(lines 6927 6929) the Hoare annotation is: true [2022-11-18 19:50:48,799 INFO L902 garLoopResultBuilder]: At program point L5410(line 5410) the Hoare annotation is: true [2022-11-18 19:50:48,799 INFO L899 garLoopResultBuilder]: For program point netif_wake_queueFINAL(lines 5406 5414) no Hoare annotation was computed. [2022-11-18 19:50:48,799 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5240 5242) the Hoare annotation is: true [2022-11-18 19:50:48,799 INFO L899 garLoopResultBuilder]: For program point L5241-2(lines 5240 5242) no Hoare annotation was computed. [2022-11-18 19:50:48,799 INFO L899 garLoopResultBuilder]: For program point L5241(line 5241) no Hoare annotation was computed. [2022-11-18 19:50:48,800 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5240 5242) no Hoare annotation was computed. [2022-11-18 19:50:48,800 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-18 19:50:48,800 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeFINAL(lines 6863 6869) no Hoare annotation was computed. [2022-11-18 19:50:48,800 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeEXIT(lines 6863 6869) no Hoare annotation was computed. [2022-11-18 19:50:48,800 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-18 19:50:48,800 INFO L902 garLoopResultBuilder]: At program point L5663(line 5663) the Hoare annotation is: true [2022-11-18 19:50:48,800 INFO L899 garLoopResultBuilder]: For program point L5663-1(line 5663) no Hoare annotation was computed. [2022-11-18 19:50:48,800 INFO L902 garLoopResultBuilder]: At program point L5634-2(lines 5634 5638) the Hoare annotation is: true [2022-11-18 19:50:48,801 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-18 19:50:48,801 INFO L899 garLoopResultBuilder]: For program point L5626(lines 5626 5630) no Hoare annotation was computed. [2022-11-18 19:50:48,801 INFO L899 garLoopResultBuilder]: For program point L5639(line 5639) no Hoare annotation was computed. [2022-11-18 19:50:48,801 INFO L902 garLoopResultBuilder]: At program point L5635(line 5635) the Hoare annotation is: true [2022-11-18 19:50:48,801 INFO L899 garLoopResultBuilder]: For program point L5635-1(line 5635) no Hoare annotation was computed. [2022-11-18 19:50:48,801 INFO L899 garLoopResultBuilder]: For program point L5664-1(line 5664) no Hoare annotation was computed. [2022-11-18 19:50:48,801 INFO L902 garLoopResultBuilder]: At program point L5664(line 5664) the Hoare annotation is: true [2022-11-18 19:50:48,801 INFO L902 garLoopResultBuilder]: At program point L5627(line 5627) the Hoare annotation is: true [2022-11-18 19:50:48,802 INFO L899 garLoopResultBuilder]: For program point L5627-1(line 5627) no Hoare annotation was computed. [2022-11-18 19:50:48,802 INFO L899 garLoopResultBuilder]: For program point L5656-1(line 5656) no Hoare annotation was computed. [2022-11-18 19:50:48,802 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-18 19:50:48,802 INFO L902 garLoopResultBuilder]: At program point L5619(line 5619) the Hoare annotation is: true [2022-11-18 19:50:48,802 INFO L899 garLoopResultBuilder]: For program point L5619-1(line 5619) no Hoare annotation was computed. [2022-11-18 19:50:48,802 INFO L899 garLoopResultBuilder]: For program point sja1000_startFINAL(lines 5651 5668) no Hoare annotation was computed. [2022-11-18 19:50:48,802 INFO L902 garLoopResultBuilder]: At program point L5648(lines 5609 5650) the Hoare annotation is: true [2022-11-18 19:50:48,802 INFO L902 garLoopResultBuilder]: At program point L5644(lines 5616 5649) the Hoare annotation is: true [2022-11-18 19:50:48,803 INFO L899 garLoopResultBuilder]: For program point L5640-1(line 5640) no Hoare annotation was computed. [2022-11-18 19:50:48,803 INFO L902 garLoopResultBuilder]: At program point L5640(line 5640) the Hoare annotation is: true [2022-11-18 19:50:48,803 INFO L899 garLoopResultBuilder]: For program point sja1000_startEXIT(lines 5651 5668) no Hoare annotation was computed. [2022-11-18 19:50:48,803 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-18 19:50:48,803 INFO L902 garLoopResultBuilder]: At program point L5637(line 5637) the Hoare annotation is: true [2022-11-18 19:50:48,803 INFO L899 garLoopResultBuilder]: For program point L5637-1(line 5637) no Hoare annotation was computed. [2022-11-18 19:50:48,803 INFO L902 garLoopResultBuilder]: At program point L5662(line 5662) the Hoare annotation is: true [2022-11-18 19:50:48,804 INFO L899 garLoopResultBuilder]: For program point L5658(lines 5658 5661) no Hoare annotation was computed. [2022-11-18 19:50:48,804 INFO L899 garLoopResultBuilder]: For program point L5662-1(line 5662) no Hoare annotation was computed. [2022-11-18 19:50:48,804 INFO L902 garLoopResultBuilder]: At program point L5629(line 5629) the Hoare annotation is: true [2022-11-18 19:50:48,804 INFO L899 garLoopResultBuilder]: For program point L5629-1(line 5629) no Hoare annotation was computed. [2022-11-18 19:50:48,804 INFO L899 garLoopResultBuilder]: For program point L5658-1(lines 5658 5661) no Hoare annotation was computed. [2022-11-18 19:50:48,804 INFO L902 garLoopResultBuilder]: At program point L5617(line 5617) the Hoare annotation is: true [2022-11-18 19:50:48,804 INFO L899 garLoopResultBuilder]: For program point L5617-1(line 5617) no Hoare annotation was computed. [2022-11-18 19:50:48,804 INFO L902 garLoopResultBuilder]: At program point L5642(lines 5616 5649) the Hoare annotation is: true [2022-11-18 19:50:48,804 INFO L899 garLoopResultBuilder]: For program point L5634(lines 5634 5638) no Hoare annotation was computed. [2022-11-18 19:50:48,804 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,804 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-11-18 19:50:48,805 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,805 INFO L902 garLoopResultBuilder]: At program point L5551(line 5551) the Hoare annotation is: true [2022-11-18 19:50:48,805 INFO L899 garLoopResultBuilder]: For program point L5551-1(line 5551) no Hoare annotation was computed. [2022-11-18 19:50:48,805 INFO L899 garLoopResultBuilder]: For program point sja1000_is_absentFINAL(lines 5547 5554) no Hoare annotation was computed. [2022-11-18 19:50:48,805 INFO L899 garLoopResultBuilder]: For program point sja1000_is_absentEXIT(lines 5547 5554) no Hoare annotation was computed. [2022-11-18 19:50:48,805 INFO L902 garLoopResultBuilder]: At program point sja1000_is_absentENTRY(lines 5547 5554) the Hoare annotation is: true [2022-11-18 19:50:48,805 INFO L899 garLoopResultBuilder]: For program point netif_stop_queueEXIT(lines 5437 5445) no Hoare annotation was computed. [2022-11-18 19:50:48,805 INFO L902 garLoopResultBuilder]: At program point L5182(lines 5178 5184) the Hoare annotation is: true [2022-11-18 19:50:48,805 INFO L902 garLoopResultBuilder]: At program point L5441(line 5441) the Hoare annotation is: true [2022-11-18 19:50:48,805 INFO L899 garLoopResultBuilder]: For program point L5441-1(line 5441) no Hoare annotation was computed. [2022-11-18 19:50:48,806 INFO L902 garLoopResultBuilder]: At program point L5434(lines 5415 5436) the Hoare annotation is: true [2022-11-18 19:50:48,806 INFO L899 garLoopResultBuilder]: For program point L5427(line 5427) no Hoare annotation was computed. [2022-11-18 19:50:48,806 INFO L902 garLoopResultBuilder]: At program point netif_stop_queueENTRY(lines 5437 5445) the Hoare annotation is: true [2022-11-18 19:50:48,806 INFO L899 garLoopResultBuilder]: For program point L5428(lines 5428 5432) no Hoare annotation was computed. [2022-11-18 19:50:48,806 INFO L899 garLoopResultBuilder]: For program point L5423(lines 5423 5426) no Hoare annotation was computed. [2022-11-18 19:50:48,806 INFO L902 garLoopResultBuilder]: At program point L5422(line 5422) the Hoare annotation is: true [2022-11-18 19:50:48,806 INFO L899 garLoopResultBuilder]: For program point L5422-1(line 5422) no Hoare annotation was computed. [2022-11-18 19:50:48,806 INFO L902 garLoopResultBuilder]: At program point L5423-2(lines 5423 5426) the Hoare annotation is: true [2022-11-18 19:50:48,806 INFO L902 garLoopResultBuilder]: At program point L7021(lines 7020 7022) the Hoare annotation is: true [2022-11-18 19:50:48,806 INFO L899 garLoopResultBuilder]: For program point netif_stop_queueFINAL(lines 5437 5445) no Hoare annotation was computed. [2022-11-18 19:50:48,807 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-18 19:50:48,807 INFO L902 garLoopResultBuilder]: At program point L5255(line 5255) the Hoare annotation is: true [2022-11-18 19:50:48,807 INFO L899 garLoopResultBuilder]: For program point L5255-1(line 5255) no Hoare annotation was computed. [2022-11-18 19:50:48,807 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5243 5259) no Hoare annotation was computed. [2022-11-18 19:50:48,807 INFO L899 garLoopResultBuilder]: For program point L5250(lines 5250 5257) no Hoare annotation was computed. [2022-11-18 19:50:48,807 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5243 5259) no Hoare annotation was computed. [2022-11-18 19:50:48,807 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,807 INFO L899 garLoopResultBuilder]: For program point L5272-1(line 5272) no Hoare annotation was computed. [2022-11-18 19:50:48,807 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 5260 5276) no Hoare annotation was computed. [2022-11-18 19:50:48,807 INFO L902 garLoopResultBuilder]: At program point L5272(line 5272) the Hoare annotation is: true [2022-11-18 19:50:48,808 INFO L899 garLoopResultBuilder]: For program point L5267(lines 5267 5274) no Hoare annotation was computed. [2022-11-18 19:50:48,808 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_1~0 0))))) [2022-11-18 19:50:48,808 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 5260 5276) no Hoare annotation was computed. [2022-11-18 19:50:48,808 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-18 19:50:48,808 INFO L899 garLoopResultBuilder]: For program point L5783-1(line 5783) no Hoare annotation was computed. [2022-11-18 19:50:48,808 INFO L899 garLoopResultBuilder]: For program point L6510(lines 6510 6538) no Hoare annotation was computed. [2022-11-18 19:50:48,808 INFO L899 garLoopResultBuilder]: For program point L6543(line 6543) no Hoare annotation was computed. [2022-11-18 19:50:48,808 INFO L899 garLoopResultBuilder]: For program point L5486(lines 5486 5489) no Hoare annotation was computed. [2022-11-18 19:50:48,808 INFO L899 garLoopResultBuilder]: For program point L6576(line 6576) no Hoare annotation was computed. [2022-11-18 19:50:48,808 INFO L899 garLoopResultBuilder]: For program point L6609(line 6609) no Hoare annotation was computed. [2022-11-18 19:50:48,809 INFO L899 garLoopResultBuilder]: For program point L6378(lines 6378 6384) no Hoare annotation was computed. [2022-11-18 19:50:48,809 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-18 19:50:48,809 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-18 19:50:48,809 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-18 19:50:48,809 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-18 19:50:48,809 INFO L899 garLoopResultBuilder]: For program point L5784-1(line 5784) no Hoare annotation was computed. [2022-11-18 19:50:48,809 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-18 19:50:48,809 INFO L902 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: true [2022-11-18 19:50:48,809 INFO L899 garLoopResultBuilder]: For program point L6511(line 6511) no Hoare annotation was computed. [2022-11-18 19:50:48,809 INFO L899 garLoopResultBuilder]: For program point L6544(lines 6544 6607) no Hoare annotation was computed. [2022-11-18 19:50:48,809 INFO L899 garLoopResultBuilder]: For program point L6577(lines 6577 6581) no Hoare annotation was computed. [2022-11-18 19:50:48,810 INFO L899 garLoopResultBuilder]: For program point L6412(lines 6412 6415) no Hoare annotation was computed. [2022-11-18 19:50:48,810 INFO L899 garLoopResultBuilder]: For program point L6214(line 6214) no Hoare annotation was computed. [2022-11-18 19:50:48,810 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-18 19:50:48,810 INFO L899 garLoopResultBuilder]: For program point L5785-1(line 5785) no Hoare annotation was computed. [2022-11-18 19:50:48,810 INFO L899 garLoopResultBuilder]: For program point L6512(lines 6512 6517) no Hoare annotation was computed. [2022-11-18 19:50:48,810 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-18 19:50:48,810 INFO L899 garLoopResultBuilder]: For program point L5389-1(line 5389) no Hoare annotation was computed. [2022-11-18 19:50:48,810 INFO L899 garLoopResultBuilder]: For program point L6215(lines 6215 6218) no Hoare annotation was computed. [2022-11-18 19:50:48,810 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-18 19:50:48,810 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-18 19:50:48,811 INFO L899 garLoopResultBuilder]: For program point L6182-1(line 6182) no Hoare annotation was computed. [2022-11-18 19:50:48,811 INFO L899 garLoopResultBuilder]: For program point L6546(lines 6546 6604) no Hoare annotation was computed. [2022-11-18 19:50:48,811 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 (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-18 19:50:48,811 INFO L899 garLoopResultBuilder]: For program point L6547(line 6547) no Hoare annotation was computed. [2022-11-18 19:50:48,811 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-18 19:50:48,811 INFO L899 garLoopResultBuilder]: For program point L6448-1(line 6448) no Hoare annotation was computed. [2022-11-18 19:50:48,811 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-18 19:50:48,811 INFO L899 garLoopResultBuilder]: For program point L6184-1(line 6184) no Hoare annotation was computed. [2022-11-18 19:50:48,811 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-18 19:50:48,811 INFO L899 garLoopResultBuilder]: For program point L5788-1(line 5788) no Hoare annotation was computed. [2022-11-18 19:50:48,812 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-18 19:50:48,812 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_1~0 0)) [2022-11-18 19:50:48,812 INFO L899 garLoopResultBuilder]: For program point L6548(lines 6548 6552) no Hoare annotation was computed. [2022-11-18 19:50:48,812 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-18 19:50:48,812 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-18 19:50:48,812 INFO L899 garLoopResultBuilder]: For program point L5789-1(line 5789) no Hoare annotation was computed. [2022-11-18 19:50:48,812 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-18 19:50:48,812 INFO L899 garLoopResultBuilder]: For program point L5492-1(lines 5480 5506) no Hoare annotation was computed. [2022-11-18 19:50:48,813 INFO L899 garLoopResultBuilder]: For program point L5492(lines 5492 5506) no Hoare annotation was computed. [2022-11-18 19:50:48,813 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-18 19:50:48,813 INFO L899 garLoopResultBuilder]: For program point L6186(lines 6186 6189) no Hoare annotation was computed. [2022-11-18 19:50:48,813 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-18 19:50:48,813 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-18 19:50:48,813 INFO L899 garLoopResultBuilder]: For program point L6913(lines 6913 6916) no Hoare annotation was computed. [2022-11-18 19:50:48,813 INFO L899 garLoopResultBuilder]: For program point L5790-1(line 5790) no Hoare annotation was computed. [2022-11-18 19:50:48,813 INFO L899 garLoopResultBuilder]: For program point L6583(line 6583) no Hoare annotation was computed. [2022-11-18 19:50:48,814 INFO L902 garLoopResultBuilder]: At program point L6616(lines 6479 6618) the Hoare annotation is: true [2022-11-18 19:50:48,814 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-18 19:50:48,814 INFO L899 garLoopResultBuilder]: For program point L5493-1(line 5493) no Hoare annotation was computed. [2022-11-18 19:50:48,814 INFO L899 garLoopResultBuilder]: For program point L6385(lines 6385 6391) no Hoare annotation was computed. [2022-11-18 19:50:48,814 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-11-18 19:50:48,814 INFO L899 garLoopResultBuilder]: For program point L5494(lines 5494 5503) no Hoare annotation was computed. [2022-11-18 19:50:48,814 INFO L899 garLoopResultBuilder]: For program point L6584(lines 6584 6592) no Hoare annotation was computed. [2022-11-18 19:50:48,814 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-18 19:50:48,814 INFO L902 garLoopResultBuilder]: At program point L6915-1(lines 6908 6919) the Hoare annotation is: true [2022-11-18 19:50:48,815 INFO L895 garLoopResultBuilder]: At program point L6915(line 6915) the Hoare annotation is: false [2022-11-18 19:50:48,815 INFO L899 garLoopResultBuilder]: For program point L6519(line 6519) no Hoare annotation was computed. [2022-11-18 19:50:48,815 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-18 19:50:48,815 INFO L899 garLoopResultBuilder]: For program point L6586(lines 6586 6590) no Hoare annotation was computed. [2022-11-18 19:50:48,815 INFO L899 garLoopResultBuilder]: For program point L6520(lines 6520 6534) no Hoare annotation was computed. [2022-11-18 19:50:48,815 INFO L899 garLoopResultBuilder]: For program point L6190(lines 6190 6199) no Hoare annotation was computed. [2022-11-18 19:50:48,815 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-18 19:50:48,816 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-18 19:50:48,816 INFO L899 garLoopResultBuilder]: For program point L6554(line 6554) no Hoare annotation was computed. [2022-11-18 19:50:48,816 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-18 19:50:48,816 INFO L899 garLoopResultBuilder]: For program point L5497-1(lines 5497 5498) no Hoare annotation was computed. [2022-11-18 19:50:48,816 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-18 19:50:48,816 INFO L899 garLoopResultBuilder]: For program point L5762-1(line 5762) no Hoare annotation was computed. [2022-11-18 19:50:48,817 INFO L899 garLoopResultBuilder]: For program point L6522(lines 6522 6527) no Hoare annotation was computed. [2022-11-18 19:50:48,817 INFO L899 garLoopResultBuilder]: For program point L6555(lines 6555 6559) no Hoare annotation was computed. [2022-11-18 19:50:48,817 INFO L899 garLoopResultBuilder]: For program point L6522-2(lines 6520 6533) no Hoare annotation was computed. [2022-11-18 19:50:48,817 INFO L899 garLoopResultBuilder]: For program point L6456(lines 6456 6460) no Hoare annotation was computed. [2022-11-18 19:50:48,817 INFO L899 garLoopResultBuilder]: For program point L6555-2(lines 6546 6604) no Hoare annotation was computed. [2022-11-18 19:50:48,817 INFO L899 garLoopResultBuilder]: For program point L5499(lines 5499 5502) no Hoare annotation was computed. [2022-11-18 19:50:48,818 INFO L899 garLoopResultBuilder]: For program point L6556-1(line 6556) no Hoare annotation was computed. [2022-11-18 19:50:48,818 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-18 19:50:48,818 INFO L899 garLoopResultBuilder]: For program point L6424(lines 6424 6439) no Hoare annotation was computed. [2022-11-18 19:50:48,818 INFO L899 garLoopResultBuilder]: For program point L6193(lines 6193 6197) no Hoare annotation was computed. [2022-11-18 19:50:48,818 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-18 19:50:48,818 INFO L899 garLoopResultBuilder]: For program point L5797-1(line 5797) no Hoare annotation was computed. [2022-11-18 19:50:48,819 INFO L899 garLoopResultBuilder]: For program point L6689-2(lines 6689 6692) no Hoare annotation was computed. [2022-11-18 19:50:48,819 INFO L899 garLoopResultBuilder]: For program point L6689(lines 6689 6692) no Hoare annotation was computed. [2022-11-18 19:50:48,819 INFO L899 garLoopResultBuilder]: For program point L6491-1(line 6491) no Hoare annotation was computed. [2022-11-18 19:50:48,819 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_1~0 0)) [2022-11-18 19:50:48,819 INFO L899 garLoopResultBuilder]: For program point L6392(lines 6392 6398) no Hoare annotation was computed. [2022-11-18 19:50:48,819 INFO L899 garLoopResultBuilder]: For program point L6425(line 6425) no Hoare annotation was computed. [2022-11-18 19:50:48,820 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-18 19:50:48,820 INFO L899 garLoopResultBuilder]: For program point L6194-1(line 6194) no Hoare annotation was computed. [2022-11-18 19:50:48,820 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-18 19:50:48,820 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-18 19:50:48,820 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-18 19:50:48,820 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 (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-18 19:50:48,821 INFO L899 garLoopResultBuilder]: For program point L6426-1(line 6426) no Hoare annotation was computed. [2022-11-18 19:50:48,821 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-18 19:50:48,821 INFO L899 garLoopResultBuilder]: For program point L5766(lines 5766 5769) no Hoare annotation was computed. [2022-11-18 19:50:48,821 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,821 INFO L899 garLoopResultBuilder]: For program point L6428(line 6428) no Hoare annotation was computed. [2022-11-18 19:50:48,821 INFO L899 garLoopResultBuilder]: For program point L6461(lines 6461 6465) no Hoare annotation was computed. [2022-11-18 19:50:48,822 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-18 19:50:48,822 INFO L899 garLoopResultBuilder]: For program point L6594(line 6594) no Hoare annotation was computed. [2022-11-18 19:50:48,822 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-18 19:50:48,822 INFO L899 garLoopResultBuilder]: For program point L6561-1(line 6561) no Hoare annotation was computed. [2022-11-18 19:50:48,822 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-18 19:50:48,822 INFO L899 garLoopResultBuilder]: For program point L6429-1(line 6429) no Hoare annotation was computed. [2022-11-18 19:50:48,823 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 (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-18 19:50:48,826 INFO L899 garLoopResultBuilder]: For program point L6595(lines 6595 6600) no Hoare annotation was computed. [2022-11-18 19:50:48,827 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-18 19:50:48,827 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-18 19:50:48,827 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_1~0 0)) [2022-11-18 19:50:48,827 INFO L899 garLoopResultBuilder]: For program point L5770-1(line 5770) no Hoare annotation was computed. [2022-11-18 19:50:48,828 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-18 19:50:48,828 INFO L899 garLoopResultBuilder]: For program point L6431(line 6431) no Hoare annotation was computed. [2022-11-18 19:50:48,828 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-18 19:50:48,828 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-18 19:50:48,828 INFO L899 garLoopResultBuilder]: For program point L6432-1(line 6432) no Hoare annotation was computed. [2022-11-18 19:50:48,828 INFO L899 garLoopResultBuilder]: For program point L6399(lines 6399 6405) no Hoare annotation was computed. [2022-11-18 19:50:48,829 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 (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-18 19:50:48,829 INFO L899 garLoopResultBuilder]: For program point L6201(line 6201) no Hoare annotation was computed. [2022-11-18 19:50:48,829 INFO L899 garLoopResultBuilder]: For program point L5805(lines 5805 5809) no Hoare annotation was computed. [2022-11-18 19:50:48,829 INFO L899 garLoopResultBuilder]: For program point L6466(lines 6466 6470) no Hoare annotation was computed. [2022-11-18 19:50:48,829 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,829 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-18 19:50:48,830 INFO L899 garLoopResultBuilder]: For program point L6566(line 6566) no Hoare annotation was computed. [2022-11-18 19:50:48,830 INFO L899 garLoopResultBuilder]: For program point L6434(line 6434) no Hoare annotation was computed. [2022-11-18 19:50:48,830 INFO L899 garLoopResultBuilder]: For program point L6500(lines 6500 6611) no Hoare annotation was computed. [2022-11-18 19:50:48,830 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-18 19:50:48,830 INFO L899 garLoopResultBuilder]: For program point L5774(lines 5774 5777) no Hoare annotation was computed. [2022-11-18 19:50:48,830 INFO L899 garLoopResultBuilder]: For program point L5774-2(lines 5761 5811) no Hoare annotation was computed. [2022-11-18 19:50:48,831 INFO L899 garLoopResultBuilder]: For program point L6567(lines 6567 6574) no Hoare annotation was computed. [2022-11-18 19:50:48,831 INFO L899 garLoopResultBuilder]: For program point L6435-1(line 6435) no Hoare annotation was computed. [2022-11-18 19:50:48,831 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 (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-18 19:50:48,831 INFO L899 garLoopResultBuilder]: For program point L6501(line 6501) no Hoare annotation was computed. [2022-11-18 19:50:48,831 INFO L899 garLoopResultBuilder]: For program point L5808-1(lines 5805 5809) no Hoare annotation was computed. [2022-11-18 19:50:48,831 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-18 19:50:48,832 INFO L899 garLoopResultBuilder]: For program point L6502(lines 6502 6505) no Hoare annotation was computed. [2022-11-18 19:50:48,832 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-18 19:50:48,832 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,832 INFO L899 garLoopResultBuilder]: For program point L6602(line 6602) no Hoare annotation was computed. [2022-11-18 19:50:48,832 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-18 19:50:48,832 INFO L899 garLoopResultBuilder]: For program point L6536(line 6536) no Hoare annotation was computed. [2022-11-18 19:50:48,833 INFO L899 garLoopResultBuilder]: For program point L6569(lines 6569 6572) no Hoare annotation was computed. [2022-11-18 19:50:48,833 INFO L899 garLoopResultBuilder]: For program point L6437(line 6437) no Hoare annotation was computed. [2022-11-18 19:50:48,833 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-18 19:50:48,833 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-18 19:50:48,833 INFO L902 garLoopResultBuilder]: At program point L6603(line 6603) the Hoare annotation is: true [2022-11-18 19:50:48,833 INFO L902 garLoopResultBuilder]: At program point L6438(line 6438) the Hoare annotation is: true [2022-11-18 19:50:48,834 INFO L899 garLoopResultBuilder]: For program point L6471(lines 6471 6475) no Hoare annotation was computed. [2022-11-18 19:50:48,834 INFO L902 garLoopResultBuilder]: At program point L6537(line 6537) the Hoare annotation is: true [2022-11-18 19:50:48,834 INFO L899 garLoopResultBuilder]: For program point L5480(lines 5480 5506) no Hoare annotation was computed. [2022-11-18 19:50:48,834 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-18 19:50:48,834 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-18 19:50:48,834 INFO L899 garLoopResultBuilder]: For program point L5778-1(lines 5778 5791) no Hoare annotation was computed. [2022-11-18 19:50:48,835 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-18 19:50:48,835 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-18 19:50:48,835 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-18 19:50:48,835 INFO L899 garLoopResultBuilder]: For program point L5481-1(line 5481) no Hoare annotation was computed. [2022-11-18 19:50:48,835 INFO L899 garLoopResultBuilder]: For program point L5482(lines 5482 5490) no Hoare annotation was computed. [2022-11-18 19:50:48,835 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 (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-18 19:50:48,836 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 19:50:48,836 INFO L899 garLoopResultBuilder]: For program point L6507(line 6507) no Hoare annotation was computed. [2022-11-18 19:50:48,836 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-18 19:50:48,836 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-18 19:50:48,836 INFO L899 garLoopResultBuilder]: For program point L5781-1(line 5781) no Hoare annotation was computed. [2022-11-18 19:50:48,836 INFO L899 garLoopResultBuilder]: For program point L6508(lines 6508 6541) no Hoare annotation was computed. [2022-11-18 19:50:48,837 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-18 19:50:48,837 INFO L899 garLoopResultBuilder]: For program point L6211-1(line 6211) no Hoare annotation was computed. [2022-11-18 19:50:48,837 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-18 19:50:48,837 INFO L899 garLoopResultBuilder]: For program point L5782-1(line 5782) no Hoare annotation was computed. [2022-11-18 19:50:48,837 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-18 19:50:48,837 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-18 19:50:48,837 INFO L899 garLoopResultBuilder]: For program point L5485-1(line 5485) no Hoare annotation was computed. [2022-11-18 19:50:48,838 INFO L902 garLoopResultBuilder]: At program point spinlock_checkENTRY(lines 5214 5219) the Hoare annotation is: true [2022-11-18 19:50:48,838 INFO L899 garLoopResultBuilder]: For program point spinlock_checkEXIT(lines 5214 5219) no Hoare annotation was computed. [2022-11-18 19:50:48,838 INFO L899 garLoopResultBuilder]: For program point spinlock_checkFINAL(lines 5214 5219) no Hoare annotation was computed. [2022-11-18 19:50:48,839 INFO L899 garLoopResultBuilder]: For program point can_change_mtuFINAL(lines 6953 6955) no Hoare annotation was computed. [2022-11-18 19:50:48,840 INFO L902 garLoopResultBuilder]: At program point can_change_mtuENTRY(lines 6953 6955) the Hoare annotation is: true [2022-11-18 19:50:48,840 INFO L899 garLoopResultBuilder]: For program point can_change_mtuEXIT(lines 6953 6955) no Hoare annotation was computed. [2022-11-18 19:50:48,840 INFO L899 garLoopResultBuilder]: For program point can_led_eventFINAL(lines 6963 6965) no Hoare annotation was computed. [2022-11-18 19:50:48,840 INFO L902 garLoopResultBuilder]: At program point can_led_eventENTRY(lines 6963 6965) the Hoare annotation is: true [2022-11-18 19:50:48,840 INFO L899 garLoopResultBuilder]: For program point can_led_eventEXIT(lines 6963 6965) no Hoare annotation was computed. [2022-11-18 19:50:48,845 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:48,847 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:50:48,872 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,873 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,874 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,874 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,874 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,875 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,875 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,875 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,891 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,895 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,895 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,896 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,898 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,898 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,898 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,898 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,903 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,906 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,906 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,906 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,907 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,907 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,911 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,912 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,913 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,916 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,916 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,916 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,917 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,919 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,919 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,922 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,922 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:48,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:48,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:50:48 BoogieIcfgContainer [2022-11-18 19:50:48,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:50:48,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:50:48,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:50:48,929 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:50:48,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:47:17" (3/4) ... [2022-11-18 19:50:48,932 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 19:50:48,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free_int [2022-11-18 19:50:48,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2022-11-18 19:50:48,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure set_reset_mode [2022-11-18 19:50:48,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-18 19:50:48,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_irq_1 [2022-11-18 19:50:48,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-11-18 19:50:48,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-18 19:50:48,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_write_cmdreg [2022-11-18 19:50:48,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2022-11-18 19:50:48,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netdev_priv [2022-11-18 19:50:48,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_set_remove [2022-11-18 19:50:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netdev_get_tx_queue [2022-11-18 19:50:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-18 19:50:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure close_candev [2022-11-18 19:50:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_wake_queue [2022-11-18 19:50:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-18 19:50:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free [2022-11-18 19:50:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_start [2022-11-18 19:50:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-18 19:50:48,943 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_is_absent [2022-11-18 19:50:48,943 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_stop_queue [2022-11-18 19:50:48,943 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-18 19:50:48,943 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-11-18 19:50:48,943 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2022-11-18 19:50:48,944 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_change_mtu [2022-11-18 19:50:48,944 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_led_event [2022-11-18 19:50:48,977 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 180 nodes and edges [2022-11-18 19:50:48,980 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2022-11-18 19:50:48,983 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-18 19:50:48,985 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-18 19:50:48,987 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-18 19:50:48,990 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 19:50:48,992 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 19:50:49,033 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-18 19:50:49,033 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) || ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_1 == 0) [2022-11-18 19:50:49,033 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,034 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-18 19:50:49,034 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-18 19:50:49,034 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && !(\result == 0)) && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,034 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-18 19:50:49,038 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-18 19:50:49,038 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,038 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) || ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_1 == 0) [2022-11-18 19:50:49,038 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-18 19:50:49,038 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-18 19:50:49,039 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-18 19:50:49,039 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-18 19:50:49,039 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-18 19:50:49,039 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-18 19:50:49,039 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-18 19:50:49,040 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-18 19:50:49,041 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-18 19:50:49,041 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-18 19:50:49,042 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,042 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-18 19:50:49,043 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-18 19:50:49,043 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,044 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,044 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,044 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-18 19:50:49,044 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,045 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-18 19:50:49,045 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-18 19:50:49,045 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-18 19:50:49,045 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,046 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,046 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-18 19:50:49,046 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-18 19:50:49,046 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-18 19:50:49,046 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-18 19:50:49,047 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-18 19:50:49,047 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,047 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-18 19:50:49,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,048 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-18 19:50:49,048 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-18 19:50:49,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(ldv_retval_0 == 0) || !(\old(last_index) == 0) [2022-11-18 19:50:49,049 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-18 19:50:49,049 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,049 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-18 19:50:49,050 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-18 19:50:49,050 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-18 19:50:49,050 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-18 19:50:49,051 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-18 19:50:49,051 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-18 19:50:49,051 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-18 19:50:49,051 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-18 19:50:49,052 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-18 19:50:49,210 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:50:49,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:50:49,211 INFO L158 Benchmark]: Toolchain (without parser) took 216717.71ms. Allocated memory was 148.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 111.6MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 461.8MB. Max. memory is 16.1GB. [2022-11-18 19:50:49,211 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 92.3MB. Free memory was 49.8MB in the beginning and 49.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:50:49,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2286.17ms. Allocated memory was 148.9MB in the beginning and 232.8MB in the end (delta: 83.9MB). Free memory was 111.6MB in the beginning and 121.0MB in the end (delta: -9.4MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2022-11-18 19:50:49,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 223.62ms. Allocated memory is still 232.8MB. Free memory was 121.0MB in the beginning and 177.9MB in the end (delta: -56.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:50:49,212 INFO L158 Benchmark]: Boogie Preprocessor took 130.17ms. Allocated memory is still 232.8MB. Free memory was 177.9MB in the beginning and 166.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:50:49,213 INFO L158 Benchmark]: RCFGBuilder took 2465.21ms. Allocated memory is still 232.8MB. Free memory was 166.3MB in the beginning and 104.2MB in the end (delta: 62.2MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2022-11-18 19:50:49,214 INFO L158 Benchmark]: TraceAbstraction took 211323.72ms. Allocated memory was 232.8MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 104.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-18 19:50:49,214 INFO L158 Benchmark]: Witness Printer took 281.70ms. Allocated memory is still 2.2GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-18 19:50:49,217 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.34ms. Allocated memory is still 92.3MB. Free memory was 49.8MB in the beginning and 49.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2286.17ms. Allocated memory was 148.9MB in the beginning and 232.8MB in the end (delta: 83.9MB). Free memory was 111.6MB in the beginning and 121.0MB in the end (delta: -9.4MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 223.62ms. Allocated memory is still 232.8MB. Free memory was 121.0MB in the beginning and 177.9MB in the end (delta: -56.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.17ms. Allocated memory is still 232.8MB. Free memory was 177.9MB in the beginning and 166.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2465.21ms. Allocated memory is still 232.8MB. Free memory was 166.3MB in the beginning and 104.2MB in the end (delta: 62.2MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. * TraceAbstraction took 211323.72ms. Allocated memory was 232.8MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 104.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 281.70ms. Allocated memory is still 2.2GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 29.4MB). 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: 211.2s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 39.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 163.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12205 SdHoareTripleChecker+Valid, 31.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11294 mSDsluCounter, 20408 SdHoareTripleChecker+Invalid, 27.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13860 mSDsCounter, 6150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15006 IncrementalHoareTripleChecker+Invalid, 21156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6150 mSolverCounterUnsat, 6548 mSDtfsCounter, 15006 mSolverCounterSat, 0.4s 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=12775occurred 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: 4.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 19482 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 212 LocationsWithAnnotation, 40895 PreInvPairs, 47446 NumberOfFragments, 2248 HoareAnnotationTreeSize, 40895 FomulaSimplifications, 602112 FormulaSimplificationTreeSizeReduction, 125.8s HoareSimplificationTime, 212 FomulaSimplificationsInter, 4132664 FormulaSimplificationTreeSizeReductionInter, 36.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 830 ConstructedInterpolants, 0 QuantifiedInterpolants, 1650 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-18 19:50:49,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,250 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_1 == 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_1 == 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-18 19:50:49,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,261 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-18 19:50:49,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,266 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,266 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,266 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,266 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-18 19:50:49,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,271 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-18 19:50:49,272 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,272 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,274 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: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) || ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_1 == 0) - InvariantResult [Line: 6488]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) || ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_1 == 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-18 19:50:49,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:50:49,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:50:49,278 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-18 19:50:49,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f78d7f3-d8a4-40cb-809c-390a23ff9cd4/bin/uautomizer-TMbwUNV5ro/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