./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--usb--cdc_eem.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_cca8825d-a993-423a-9468-febbb6a8ca82/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/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_cca8825d-a993-423a-9468-febbb6a8ca82/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/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--usb--cdc_eem.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/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_cca8825d-a993-423a-9468-febbb6a8ca82/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 5ad15ea2ee4e38087fdbbd25111673bb935102e85f8e91f44e32009dacc41114 --- 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 20:32:34,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:32:34,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:32:34,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:32:34,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:32:34,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:32:34,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:32:34,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:32:34,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:32:34,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:32:34,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:32:34,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:32:34,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:32:34,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:32:34,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:32:34,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:32:34,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:32:34,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:32:34,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:32:34,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:32:34,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:32:34,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:32:34,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:32:34,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:32:34,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:32:34,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:32:34,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:32:34,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:32:34,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:32:34,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:32:34,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:32:34,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:32:34,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:32:34,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:32:34,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:32:34,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:32:34,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:32:34,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:32:34,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:32:34,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:32:34,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:32:34,563 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:32:34,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:32:34,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:32:34,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:32:34,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:32:34,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:32:34,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:32:34,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:32:34,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:32:34,604 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:32:34,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:32:34,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:32:34,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:32:34,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:32:34,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:32:34,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:32:34,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:32:34,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:32:34,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:32:34,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:32:34,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:32:34,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:32:34,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:32:34,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:32:34,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:32:34,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:32:34,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:32:34,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:32:34,611 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:32:34,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:32:34,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:32:34,612 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_cca8825d-a993-423a-9468-febbb6a8ca82/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_cca8825d-a993-423a-9468-febbb6a8ca82/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 -> 5ad15ea2ee4e38087fdbbd25111673bb935102e85f8e91f44e32009dacc41114 [2022-11-18 20:32:34,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:32:34,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:32:34,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:32:34,981 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:32:34,981 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:32:34,983 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/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--usb--cdc_eem.ko-entry_point.cil.out.i [2022-11-18 20:32:35,057 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/bin/uautomizer-TMbwUNV5ro/data/b1866d3f1/51fac8563a06458d8a8835b593077bc4/FLAG30944a53e [2022-11-18 20:32:35,818 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:32:35,819 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i [2022-11-18 20:32:35,866 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/bin/uautomizer-TMbwUNV5ro/data/b1866d3f1/51fac8563a06458d8a8835b593077bc4/FLAG30944a53e [2022-11-18 20:32:35,897 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/bin/uautomizer-TMbwUNV5ro/data/b1866d3f1/51fac8563a06458d8a8835b593077bc4 [2022-11-18 20:32:35,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:32:35,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:32:35,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:32:35,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:32:35,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:32:35,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:32:35" (1/1) ... [2022-11-18 20:32:35,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dab2db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:35, skipping insertion in model container [2022-11-18 20:32:35,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:32:35" (1/1) ... [2022-11-18 20:32:35,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:32:36,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:32:36,909 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_cca8825d-a993-423a-9468-febbb6a8ca82/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i[161556,161569] [2022-11-18 20:32:37,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:32:37,214 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:32:37,396 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_cca8825d-a993-423a-9468-febbb6a8ca82/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i[161556,161569] [2022-11-18 20:32:37,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:32:37,526 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:32:37,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37 WrapperNode [2022-11-18 20:32:37,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:32:37,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:32:37,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:32:37,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:32:37,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,728 INFO L138 Inliner]: procedures = 125, calls = 351, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1078 [2022-11-18 20:32:37,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:32:37,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:32:37,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:32:37,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:32:37,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,862 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:32:37,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:32:37,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:32:37,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:32:37,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (1/1) ... [2022-11-18 20:32:37,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:32:37,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:37,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:32:37,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:32:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-18 20:32:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-18 20:32:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-18 20:32:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 20:32:37,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 20:32:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:32:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-11-18 20:32:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-11-18 20:32:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-11-18 20:32:37,984 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-11-18 20:32:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure skb_clone [2022-11-18 20:32:37,987 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_clone [2022-11-18 20:32:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-18 20:32:37,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-18 20:32:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:32:37,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:32:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-11-18 20:32:37,987 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-11-18 20:32:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:32:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-18 20:32:37,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-18 20:32:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-11-18 20:32:37,988 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-11-18 20:32:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-18 20:32:37,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-18 20:32:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure put_unaligned_le16 [2022-11-18 20:32:37,989 INFO L138 BoogieDeclarations]: Found implementation of procedure put_unaligned_le16 [2022-11-18 20:32:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-18 20:32:37,989 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-18 20:32:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:32:37,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:32:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure eem_rx_fixup [2022-11-18 20:32:37,990 INFO L138 BoogieDeclarations]: Found implementation of procedure eem_rx_fixup [2022-11-18 20:32:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:32:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-11-18 20:32:37,990 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-11-18 20:32:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-11-18 20:32:37,990 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-11-18 20:32:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:32:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:32:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:32:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:32:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-18 20:32:37,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-18 20:32:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-18 20:32:37,991 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-18 20:32:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:32:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:32:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-18 20:32:37,992 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-18 20:32:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:32:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-18 20:32:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-18 20:32:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-18 20:32:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:32:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:32:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure eem_tx_fixup [2022-11-18 20:32:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure eem_tx_fixup [2022-11-18 20:32:38,436 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:32:38,439 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:32:38,527 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-18 20:32:40,631 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:32:40,639 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:32:40,640 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:32:40,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:32:40 BoogieIcfgContainer [2022-11-18 20:32:40,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:32:40,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:32:40,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:32:40,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:32:40,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:32:35" (1/3) ... [2022-11-18 20:32:40,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfd7031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:32:40, skipping insertion in model container [2022-11-18 20:32:40,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:37" (2/3) ... [2022-11-18 20:32:40,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfd7031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:32:40, skipping insertion in model container [2022-11-18 20:32:40,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:32:40" (3/3) ... [2022-11-18 20:32:40,651 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i [2022-11-18 20:32:40,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:32:40,669 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:32:40,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:32:40,729 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;@69ce0ed0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:32:40,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:32:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 252 states have (on average 1.3888888888888888) internal successors, (350), 261 states have internal predecessors, (350), 49 states have call successors, (49), 21 states have call predecessors, (49), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-11-18 20:32:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-18 20:32:40,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:40,747 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:32:40,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:40,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -593870594, now seen corresponding path program 1 times [2022-11-18 20:32:40,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:40,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671087650] [2022-11-18 20:32:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:40,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 20:32:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:41,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:41,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:32:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:32:41,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:41,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671087650] [2022-11-18 20:32:41,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671087650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:41,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:41,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:32:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463801505] [2022-11-18 20:32:41,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:41,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:32:41,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:41,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:32:41,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:32:41,486 INFO L87 Difference]: Start difference. First operand has 323 states, 252 states have (on average 1.3888888888888888) internal successors, (350), 261 states have internal predecessors, (350), 49 states have call successors, (49), 21 states have call predecessors, (49), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:32:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:44,549 INFO L93 Difference]: Finished difference Result 1110 states and 1633 transitions. [2022-11-18 20:32:44,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:32:44,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-11-18 20:32:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:44,581 INFO L225 Difference]: With dead ends: 1110 [2022-11-18 20:32:44,584 INFO L226 Difference]: Without dead ends: 734 [2022-11-18 20:32:44,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:32:44,599 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 947 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:44,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1095 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-18 20:32:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-11-18 20:32:44,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 539. [2022-11-18 20:32:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 435 states have (on average 1.360919540229885) internal successors, (592), 439 states have internal predecessors, (592), 68 states have call successors, (68), 36 states have call predecessors, (68), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-11-18 20:32:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 727 transitions. [2022-11-18 20:32:44,770 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 727 transitions. Word has length 42 [2022-11-18 20:32:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:44,776 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 727 transitions. [2022-11-18 20:32:44,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:32:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 727 transitions. [2022-11-18 20:32:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 20:32:44,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:44,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-18 20:32:44,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:32:44,788 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:44,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1220430588, now seen corresponding path program 1 times [2022-11-18 20:32:44,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:44,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863565770] [2022-11-18 20:32:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:44,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 20:32:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:32:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:32:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-18 20:32:45,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:45,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863565770] [2022-11-18 20:32:45,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863565770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:45,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:45,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:32:45,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357647195] [2022-11-18 20:32:45,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:45,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:32:45,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:45,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:32:45,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:32:45,214 INFO L87 Difference]: Start difference. First operand 539 states and 727 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 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 20:32:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:48,049 INFO L93 Difference]: Finished difference Result 1441 states and 2043 transitions. [2022-11-18 20:32:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:32:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 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 52 [2022-11-18 20:32:48,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:48,060 INFO L225 Difference]: With dead ends: 1441 [2022-11-18 20:32:48,060 INFO L226 Difference]: Without dead ends: 1432 [2022-11-18 20:32:48,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:32:48,063 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 915 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:48,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1598 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-18 20:32:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-11-18 20:32:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1177. [2022-11-18 20:32:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 956 states have (on average 1.3786610878661087) internal successors, (1318), 966 states have internal predecessors, (1318), 149 states have call successors, (149), 70 states have call predecessors, (149), 71 states have return successors, (160), 148 states have call predecessors, (160), 148 states have call successors, (160) [2022-11-18 20:32:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1627 transitions. [2022-11-18 20:32:48,154 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1627 transitions. Word has length 52 [2022-11-18 20:32:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:48,155 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1627 transitions. [2022-11-18 20:32:48,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 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 20:32:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1627 transitions. [2022-11-18 20:32:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-18 20:32:48,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:48,163 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:48,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:32:48,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash 762310521, now seen corresponding path program 1 times [2022-11-18 20:32:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:48,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018583587] [2022-11-18 20:32:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:48,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 20:32:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:32:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:32:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:32:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:32:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:32:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-18 20:32:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:32:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:32:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:32:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:32:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:32:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-18 20:32:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:32:48,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:48,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018583587] [2022-11-18 20:32:48,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018583587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:48,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:48,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:32:48,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354957425] [2022-11-18 20:32:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:48,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:32:48,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:48,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:32:48,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:32:48,618 INFO L87 Difference]: Start difference. First operand 1177 states and 1627 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-18 20:32:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:51,384 INFO L93 Difference]: Finished difference Result 2821 states and 3963 transitions. [2022-11-18 20:32:51,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:32:51,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2022-11-18 20:32:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:51,395 INFO L225 Difference]: With dead ends: 2821 [2022-11-18 20:32:51,395 INFO L226 Difference]: Without dead ends: 1660 [2022-11-18 20:32:51,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:32:51,401 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 476 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:51,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1370 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-18 20:32:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2022-11-18 20:32:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1406. [2022-11-18 20:32:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1158 states have (on average 1.3946459412780656) internal successors, (1615), 1170 states have internal predecessors, (1615), 162 states have call successors, (162), 80 states have call predecessors, (162), 85 states have return successors, (177), 163 states have call predecessors, (177), 161 states have call successors, (177) [2022-11-18 20:32:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1954 transitions. [2022-11-18 20:32:51,500 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1954 transitions. Word has length 162 [2022-11-18 20:32:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:51,500 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 1954 transitions. [2022-11-18 20:32:51,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-18 20:32:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1954 transitions. [2022-11-18 20:32:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-18 20:32:51,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:51,513 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:51,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:32:51,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:51,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:51,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1254297885, now seen corresponding path program 1 times [2022-11-18 20:32:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:51,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214061787] [2022-11-18 20:32:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:51,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 20:32:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:32:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:32:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:32:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:32:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:32:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:32:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:32:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:32:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-18 20:32:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:32:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:32:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:32:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:32:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:32:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-18 20:32:52,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:52,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214061787] [2022-11-18 20:32:52,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214061787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:52,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:52,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:32:52,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408806631] [2022-11-18 20:32:52,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:52,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:32:52,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:32:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:32:52,049 INFO L87 Difference]: Start difference. First operand 1406 states and 1954 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-18 20:32:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:55,622 INFO L93 Difference]: Finished difference Result 4337 states and 6109 transitions. [2022-11-18 20:32:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:32:55,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 184 [2022-11-18 20:32:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:55,639 INFO L225 Difference]: With dead ends: 4337 [2022-11-18 20:32:55,639 INFO L226 Difference]: Without dead ends: 2958 [2022-11-18 20:32:55,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:32:55,655 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 776 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:55,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1641 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-18 20:32:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2022-11-18 20:32:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2472. [2022-11-18 20:32:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2030 states have (on average 1.383743842364532) internal successors, (2809), 2054 states have internal predecessors, (2809), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-11-18 20:32:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3400 transitions. [2022-11-18 20:32:55,857 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3400 transitions. Word has length 184 [2022-11-18 20:32:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:55,857 INFO L495 AbstractCegarLoop]: Abstraction has 2472 states and 3400 transitions. [2022-11-18 20:32:55,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-18 20:32:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3400 transitions. [2022-11-18 20:32:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-18 20:32:55,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:55,863 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:55,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:32:55,864 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:55,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash -887535747, now seen corresponding path program 1 times [2022-11-18 20:32:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:55,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421477463] [2022-11-18 20:32:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:55,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 20:32:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:32:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:32:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:32:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:32:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:32:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:32:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:32:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:32:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-18 20:32:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:32:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:32:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:32:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:32:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:32:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-11-18 20:32:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:56,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421477463] [2022-11-18 20:32:56,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421477463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:56,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:56,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:32:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428019384] [2022-11-18 20:32:56,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:56,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:32:56,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:56,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:32:56,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:32:56,270 INFO L87 Difference]: Start difference. First operand 2472 states and 3400 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-18 20:32:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:59,425 INFO L93 Difference]: Finished difference Result 4332 states and 6098 transitions. [2022-11-18 20:32:59,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:32:59,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2022-11-18 20:32:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:59,441 INFO L225 Difference]: With dead ends: 4332 [2022-11-18 20:32:59,442 INFO L226 Difference]: Without dead ends: 2957 [2022-11-18 20:32:59,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:32:59,447 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 295 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:59,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1346 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-18 20:32:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2022-11-18 20:32:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2480. [2022-11-18 20:32:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2038 states have (on average 1.3822374877330716) internal successors, (2817), 2062 states have internal predecessors, (2817), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-11-18 20:32:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3408 transitions. [2022-11-18 20:32:59,594 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3408 transitions. Word has length 184 [2022-11-18 20:32:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:59,595 INFO L495 AbstractCegarLoop]: Abstraction has 2480 states and 3408 transitions. [2022-11-18 20:32:59,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-18 20:32:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3408 transitions. [2022-11-18 20:32:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-11-18 20:32:59,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:59,600 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:59,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:32:59,601 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1216507748, now seen corresponding path program 1 times [2022-11-18 20:32:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:59,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88961350] [2022-11-18 20:32:59,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:59,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:33:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 20:33:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:33:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:33:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:33:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:33:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:33:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:33:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:33:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:33:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 20:33:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-18 20:33:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:33:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:33:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:33:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:33:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-18 20:33:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-11-18 20:33:00,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:00,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88961350] [2022-11-18 20:33:00,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88961350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:33:00,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:33:00,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 20:33:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614245572] [2022-11-18 20:33:00,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:33:00,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:33:00,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:00,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:33:00,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:33:00,926 INFO L87 Difference]: Start difference. First operand 2480 states and 3408 transitions. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 8 states have internal predecessors, (109), 5 states have call successors, (22), 7 states have call predecessors, (22), 3 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) [2022-11-18 20:33:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:04,231 INFO L93 Difference]: Finished difference Result 3899 states and 5426 transitions. [2022-11-18 20:33:04,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:33:04,232 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 8 states have internal predecessors, (109), 5 states have call successors, (22), 7 states have call predecessors, (22), 3 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) Word has length 186 [2022-11-18 20:33:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:04,233 INFO L225 Difference]: With dead ends: 3899 [2022-11-18 20:33:04,233 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:33:04,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:33:04,241 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 998 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:04,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1228 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-18 20:33:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:33:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:33:04,242 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 20:33:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:33:04,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2022-11-18 20:33:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:04,243 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:33:04,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 8 states have internal predecessors, (109), 5 states have call successors, (22), 7 states have call predecessors, (22), 3 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) [2022-11-18 20:33:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:33:04,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:33:04,246 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:33:04,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:33:04,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 20:33:10,897 INFO L902 garLoopResultBuilder]: At program point skb_putENTRY(lines 6624 6628) the Hoare annotation is: true [2022-11-18 20:33:10,897 INFO L899 garLoopResultBuilder]: For program point skb_putFINAL(lines 6624 6628) no Hoare annotation was computed. [2022-11-18 20:33:10,897 INFO L899 garLoopResultBuilder]: For program point skb_putEXIT(lines 6624 6628) no Hoare annotation was computed. [2022-11-18 20:33:10,897 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 5677 5683) no Hoare annotation was computed. [2022-11-18 20:33:10,897 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 5677 5683) the Hoare annotation is: true [2022-11-18 20:33:10,897 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5681) no Hoare annotation was computed. [2022-11-18 20:33:10,897 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 5677 5683) no Hoare annotation was computed. [2022-11-18 20:33:10,897 INFO L899 garLoopResultBuilder]: For program point L6619-1(line 6619) no Hoare annotation was computed. [2022-11-18 20:33:10,898 INFO L895 garLoopResultBuilder]: At program point skb_pullENTRY(lines 6618 6620) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-18 20:33:10,898 INFO L895 garLoopResultBuilder]: At program point L6619(line 6619) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-18 20:33:10,898 INFO L899 garLoopResultBuilder]: For program point skb_pullFINAL(lines 6618 6620) no Hoare annotation was computed. [2022-11-18 20:33:10,898 INFO L899 garLoopResultBuilder]: For program point skb_pullEXIT(lines 6618 6620) no Hoare annotation was computed. [2022-11-18 20:33:10,898 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5684 5690) no Hoare annotation was computed. [2022-11-18 20:33:10,898 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5684 5690) the Hoare annotation is: true [2022-11-18 20:33:10,898 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 5691 5696) no Hoare annotation was computed. [2022-11-18 20:33:10,898 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 5691 5696) the Hoare annotation is: true [2022-11-18 20:33:10,898 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 5691 5696) no Hoare annotation was computed. [2022-11-18 20:33:10,899 INFO L902 garLoopResultBuilder]: At program point usbnet_disconnectENTRY(lines 6655 6657) the Hoare annotation is: true [2022-11-18 20:33:10,899 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectFINAL(lines 6655 6657) no Hoare annotation was computed. [2022-11-18 20:33:10,899 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectEXIT(lines 6655 6657) no Hoare annotation was computed. [2022-11-18 20:33:10,899 INFO L895 garLoopResultBuilder]: At program point put_unaligned_le16ENTRY(lines 5748 5754) 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 (= ~last_index~0 0))) [2022-11-18 20:33:10,899 INFO L899 garLoopResultBuilder]: For program point put_unaligned_le16FINAL(lines 5748 5754) no Hoare annotation was computed. [2022-11-18 20:33:10,899 INFO L899 garLoopResultBuilder]: For program point put_unaligned_le16EXIT(lines 5748 5754) no Hoare annotation was computed. [2022-11-18 20:33:10,899 INFO L895 garLoopResultBuilder]: At program point L6622(line 6622) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-18 20:33:10,899 INFO L899 garLoopResultBuilder]: For program point skb_pushFINAL(lines 6621 6623) no Hoare annotation was computed. [2022-11-18 20:33:10,899 INFO L899 garLoopResultBuilder]: For program point L6622-1(line 6622) no Hoare annotation was computed. [2022-11-18 20:33:10,900 INFO L895 garLoopResultBuilder]: At program point skb_pushENTRY(lines 6621 6623) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-18 20:33:10,900 INFO L899 garLoopResultBuilder]: For program point skb_pushEXIT(lines 6621 6623) no Hoare annotation was computed. [2022-11-18 20:33:10,900 INFO L899 garLoopResultBuilder]: For program point L6433-1(lines 6433 6436) no Hoare annotation was computed. [2022-11-18 20:33:10,900 INFO L899 garLoopResultBuilder]: For program point L6433(lines 6433 6436) no Hoare annotation was computed. [2022-11-18 20:33:10,900 INFO L899 garLoopResultBuilder]: For program point L6423(lines 6423 6427) no Hoare annotation was computed. [2022-11-18 20:33:10,900 INFO L899 garLoopResultBuilder]: For program point L6419-1(lines 6419 6422) no Hoare annotation was computed. [2022-11-18 20:33:10,900 INFO L899 garLoopResultBuilder]: For program point L6419(lines 6419 6422) no Hoare annotation was computed. [2022-11-18 20:33:10,900 INFO L895 garLoopResultBuilder]: At program point L6432-2(lines 6432 6439) the Hoare annotation is: (not (= |old(~last_index~0)| 0)) [2022-11-18 20:33:10,900 INFO L895 garLoopResultBuilder]: At program point ldv_set_removeENTRY(lines 6411 6445) the Hoare annotation is: (or (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 20:33:10,900 INFO L899 garLoopResultBuilder]: For program point L6432-3(lines 6432 6439) no Hoare annotation was computed. [2022-11-18 20:33:10,900 INFO L899 garLoopResultBuilder]: For program point L6430-1(lines 6411 6445) no Hoare annotation was computed. [2022-11-18 20:33:10,901 INFO L899 garLoopResultBuilder]: For program point L6418-3(lines 6415 6444) no Hoare annotation was computed. [2022-11-18 20:33:10,901 INFO L895 garLoopResultBuilder]: At program point L6418-2(lines 6418 6429) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (+ ldv_set_remove_~deleted_index~0 1)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))) [2022-11-18 20:33:10,901 INFO L899 garLoopResultBuilder]: For program point ldv_set_removeEXIT(lines 6411 6445) no Hoare annotation was computed. [2022-11-18 20:33:10,901 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:33:10,901 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-11-18 20:33:10,901 INFO L895 garLoopResultBuilder]: At program point #Ultimate.C_memsetENTRY(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 (= ~last_index~0 0)) (not (= ~ldv_state_variable_2~0 0))) [2022-11-18 20:33:10,901 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:33:10,901 INFO L899 garLoopResultBuilder]: For program point skb_cloneFINAL(lines 6612 6614) no Hoare annotation was computed. [2022-11-18 20:33:10,901 INFO L899 garLoopResultBuilder]: For program point skb_cloneEXIT(lines 6612 6614) no Hoare annotation was computed. [2022-11-18 20:33:10,901 INFO L895 garLoopResultBuilder]: At program point skb_cloneENTRY(lines 6612 6614) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-18 20:33:10,902 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-11-18 20:33:10,902 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-18 20:33:10,902 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5624 5626) the Hoare annotation is: true [2022-11-18 20:33:10,902 INFO L899 garLoopResultBuilder]: For program point L5625-2(lines 5624 5626) no Hoare annotation was computed. [2022-11-18 20:33:10,902 INFO L899 garLoopResultBuilder]: For program point L5625(line 5625) no Hoare annotation was computed. [2022-11-18 20:33:10,902 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5624 5626) no Hoare annotation was computed. [2022-11-18 20:33:10,902 INFO L895 garLoopResultBuilder]: At program point ldv_skb_freeENTRY(lines 6532 6538) the Hoare annotation is: (or (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 20:33:10,902 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeFINAL(lines 6532 6538) no Hoare annotation was computed. [2022-11-18 20:33:10,902 INFO L895 garLoopResultBuilder]: At program point L6535(line 6535) the Hoare annotation is: (or (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 20:33:10,904 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeEXIT(lines 6532 6538) no Hoare annotation was computed. [2022-11-18 20:33:10,904 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 6641 6643) no Hoare annotation was computed. [2022-11-18 20:33:10,904 INFO L902 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 6641 6643) the Hoare annotation is: true [2022-11-18 20:33:10,904 INFO L899 garLoopResultBuilder]: For program point usb_free_urbFINAL(lines 6641 6643) no Hoare annotation was computed. [2022-11-18 20:33:10,904 INFO L895 garLoopResultBuilder]: At program point L6031(line 6031) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,904 INFO L899 garLoopResultBuilder]: For program point L6031-1(line 6031) no Hoare annotation was computed. [2022-11-18 20:33:10,905 INFO L895 garLoopResultBuilder]: At program point eem_rx_fixupENTRY(lines 5926 6059) the Hoare annotation is: (or (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(~last_index~0)| ~last_index~0)) (not (= |old(~last_index~0)| 0))) [2022-11-18 20:33:10,905 INFO L899 garLoopResultBuilder]: For program point L5833(line 5833) no Hoare annotation was computed. [2022-11-18 20:33:10,905 INFO L895 garLoopResultBuilder]: At program point L5951(line 5951) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,905 INFO L895 garLoopResultBuilder]: At program point L5984-1(line 5984) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,905 INFO L899 garLoopResultBuilder]: For program point L5951-1(line 5951) no Hoare annotation was computed. [2022-11-18 20:33:10,905 INFO L895 garLoopResultBuilder]: At program point L5984(line 5984) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,906 INFO L895 garLoopResultBuilder]: At program point L5737(lines 5732 5739) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,906 INFO L899 garLoopResultBuilder]: For program point L6051(line 6051) no Hoare annotation was computed. [2022-11-18 20:33:10,906 INFO L899 garLoopResultBuilder]: For program point L6018(lines 6018 6028) no Hoare annotation was computed. [2022-11-18 20:33:10,906 INFO L895 garLoopResultBuilder]: At program point L5506(lines 5501 5508) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,906 INFO L899 garLoopResultBuilder]: For program point L5985(line 5985) no Hoare annotation was computed. [2022-11-18 20:33:10,906 INFO L899 garLoopResultBuilder]: For program point L5952(lines 5952 6049) no Hoare annotation was computed. [2022-11-18 20:33:10,907 INFO L899 garLoopResultBuilder]: For program point L6018-2(lines 6003 6049) no Hoare annotation was computed. [2022-11-18 20:33:10,907 INFO L895 garLoopResultBuilder]: At program point L5787(lines 5775 5789) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,907 INFO L895 garLoopResultBuilder]: At program point L5490(lines 5486 5492) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,907 INFO L899 garLoopResultBuilder]: For program point L5969-2(line 5969) no Hoare annotation was computed. [2022-11-18 20:33:10,907 INFO L899 garLoopResultBuilder]: For program point L5969(line 5969) no Hoare annotation was computed. [2022-11-18 20:33:10,907 INFO L899 garLoopResultBuilder]: For program point L5969-4(line 5969) no Hoare annotation was computed. [2022-11-18 20:33:10,907 INFO L899 garLoopResultBuilder]: For program point eem_rx_fixupEXIT(lines 5926 6059) no Hoare annotation was computed. [2022-11-18 20:33:10,908 INFO L895 garLoopResultBuilder]: At program point L5986(line 5986) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,908 INFO L895 garLoopResultBuilder]: At program point L6052(lines 5942 6058) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,908 INFO L899 garLoopResultBuilder]: For program point L5953(lines 5953 5968) no Hoare annotation was computed. [2022-11-18 20:33:10,908 INFO L899 garLoopResultBuilder]: For program point L5986-1(line 5986) no Hoare annotation was computed. [2022-11-18 20:33:10,908 INFO L899 garLoopResultBuilder]: For program point L5970(lines 5970 6001) no Hoare annotation was computed. [2022-11-18 20:33:10,908 INFO L895 garLoopResultBuilder]: At program point L5838(lines 5817 5840) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,909 INFO L899 garLoopResultBuilder]: For program point L6053(lines 6053 6056) no Hoare annotation was computed. [2022-11-18 20:33:10,909 INFO L899 garLoopResultBuilder]: For program point L5971(line 5971) no Hoare annotation was computed. [2022-11-18 20:33:10,909 INFO L899 garLoopResultBuilder]: For program point L6037(lines 6003 6049) no Hoare annotation was computed. [2022-11-18 20:33:10,909 INFO L899 garLoopResultBuilder]: For program point L6004(lines 6004 6007) no Hoare annotation was computed. [2022-11-18 20:33:10,909 INFO L895 garLoopResultBuilder]: At program point L6054(lines 5942 6058) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,909 INFO L895 garLoopResultBuilder]: At program point L6021(line 6021) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,910 INFO L899 garLoopResultBuilder]: For program point L6021-1(line 6021) no Hoare annotation was computed. [2022-11-18 20:33:10,910 INFO L899 garLoopResultBuilder]: For program point L5823(lines 5823 5826) no Hoare annotation was computed. [2022-11-18 20:33:10,910 INFO L895 garLoopResultBuilder]: At program point L5526(lines 5521 5528) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,910 INFO L899 garLoopResultBuilder]: For program point L5972-2(line 5972) no Hoare annotation was computed. [2022-11-18 20:33:10,910 INFO L899 garLoopResultBuilder]: For program point L5972(line 5972) no Hoare annotation was computed. [2022-11-18 20:33:10,910 INFO L899 garLoopResultBuilder]: For program point L5972-4(line 5972) no Hoare annotation was computed. [2022-11-18 20:33:10,910 INFO L895 garLoopResultBuilder]: At program point L6633-2(lines 6632 6634) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,911 INFO L895 garLoopResultBuilder]: At program point L6022(lines 6022 6023) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,911 INFO L899 garLoopResultBuilder]: For program point L6633-1(line 6633) no Hoare annotation was computed. [2022-11-18 20:33:10,911 INFO L895 garLoopResultBuilder]: At program point L6633(line 6633) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,911 INFO L899 garLoopResultBuilder]: For program point L5989(line 5989) no Hoare annotation was computed. [2022-11-18 20:33:10,911 INFO L899 garLoopResultBuilder]: For program point L6022-1(lines 6022 6023) no Hoare annotation was computed. [2022-11-18 20:33:10,911 INFO L895 garLoopResultBuilder]: At program point L6650(lines 6649 6651) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,911 INFO L899 garLoopResultBuilder]: For program point L5973(lines 5973 5976) no Hoare annotation was computed. [2022-11-18 20:33:10,912 INFO L899 garLoopResultBuilder]: For program point eem_rx_fixupFINAL(lines 5926 6059) no Hoare annotation was computed. [2022-11-18 20:33:10,912 INFO L899 garLoopResultBuilder]: For program point L6024(lines 6024 6027) no Hoare annotation was computed. [2022-11-18 20:33:10,912 INFO L895 garLoopResultBuilder]: At program point L5512(lines 5509 5514) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,912 INFO L899 garLoopResultBuilder]: For program point L6008-2(line 6008) no Hoare annotation was computed. [2022-11-18 20:33:10,912 INFO L899 garLoopResultBuilder]: For program point L6008(line 6008) no Hoare annotation was computed. [2022-11-18 20:33:10,912 INFO L899 garLoopResultBuilder]: For program point L6008-4(line 6008) no Hoare annotation was computed. [2022-11-18 20:33:10,913 INFO L899 garLoopResultBuilder]: For program point L5992-2(line 5992) no Hoare annotation was computed. [2022-11-18 20:33:10,913 INFO L899 garLoopResultBuilder]: For program point L5992(line 5992) no Hoare annotation was computed. [2022-11-18 20:33:10,913 INFO L895 garLoopResultBuilder]: At program point L6042(line 6042) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,913 INFO L895 garLoopResultBuilder]: At program point L6653(lines 6652 6654) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,913 INFO L899 garLoopResultBuilder]: For program point L6009(lines 6009 6012) no Hoare annotation was computed. [2022-11-18 20:33:10,913 INFO L899 garLoopResultBuilder]: For program point L6042-1(line 6042) no Hoare annotation was computed. [2022-11-18 20:33:10,913 INFO L895 garLoopResultBuilder]: At program point L5745(lines 5740 5747) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,914 INFO L899 garLoopResultBuilder]: For program point L5960-1(line 5960) no Hoare annotation was computed. [2022-11-18 20:33:10,914 INFO L899 garLoopResultBuilder]: For program point L5993(line 5993) no Hoare annotation was computed. [2022-11-18 20:33:10,914 INFO L895 garLoopResultBuilder]: At program point L5960(line 5960) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,914 INFO L895 garLoopResultBuilder]: At program point L5729(lines 5724 5731) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,914 INFO L899 garLoopResultBuilder]: For program point L6043(lines 6043 6048) no Hoare annotation was computed. [2022-11-18 20:33:10,914 INFO L895 garLoopResultBuilder]: At program point L5498(lines 5493 5500) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,915 INFO L895 garLoopResultBuilder]: At program point L6043-1(lines 5952 6049) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,915 INFO L895 garLoopResultBuilder]: At program point L5977(line 5977) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,915 INFO L899 garLoopResultBuilder]: For program point L5977-1(line 5977) no Hoare annotation was computed. [2022-11-18 20:33:10,915 INFO L895 garLoopResultBuilder]: At program point L6671(lines 6670 6672) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,915 INFO L899 garLoopResultBuilder]: For program point L5961(lines 5961 5965) no Hoare annotation was computed. [2022-11-18 20:33:10,915 INFO L895 garLoopResultBuilder]: At program point L5978(lines 5978 5979) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,942 INFO L899 garLoopResultBuilder]: For program point L5978-1(lines 5978 5979) no Hoare annotation was computed. [2022-11-18 20:33:10,942 INFO L899 garLoopResultBuilder]: For program point L5995(line 5995) no Hoare annotation was computed. [2022-11-18 20:33:10,942 INFO L899 garLoopResultBuilder]: For program point L5830(lines 5830 5837) no Hoare annotation was computed. [2022-11-18 20:33:10,942 INFO L899 garLoopResultBuilder]: For program point L5995-2(line 5995) no Hoare annotation was computed. [2022-11-18 20:33:10,943 INFO L899 garLoopResultBuilder]: For program point L5946(lines 5946 5949) no Hoare annotation was computed. [2022-11-18 20:33:10,943 INFO L895 garLoopResultBuilder]: At program point L6045(line 6045) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,943 INFO L899 garLoopResultBuilder]: For program point L5996-2(line 5996) no Hoare annotation was computed. [2022-11-18 20:33:10,943 INFO L899 garLoopResultBuilder]: For program point L5996(line 5996) no Hoare annotation was computed. [2022-11-18 20:33:10,943 INFO L895 garLoopResultBuilder]: At program point L6029-1(lines 6029 6036) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,943 INFO L895 garLoopResultBuilder]: At program point L5831(line 5831) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,944 INFO L895 garLoopResultBuilder]: At program point L5831-1(lines 5821 5839) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,944 INFO L899 garLoopResultBuilder]: For program point L6013(lines 6013 6016) no Hoare annotation was computed. [2022-11-18 20:33:10,944 INFO L899 garLoopResultBuilder]: For program point L5980(lines 5980 5983) no Hoare annotation was computed. [2022-11-18 20:33:10,944 INFO L895 garLoopResultBuilder]: At program point L5518(lines 5515 5520) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-18 20:33:10,944 INFO L899 garLoopResultBuilder]: For program point L5997(line 5997) no Hoare annotation was computed. [2022-11-18 20:33:10,944 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 5627 5643) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-18 20:33:10,945 INFO L902 garLoopResultBuilder]: At program point L5639(line 5639) the Hoare annotation is: true [2022-11-18 20:33:10,945 INFO L899 garLoopResultBuilder]: For program point L5639-1(line 5639) no Hoare annotation was computed. [2022-11-18 20:33:10,945 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5627 5643) no Hoare annotation was computed. [2022-11-18 20:33:10,945 INFO L899 garLoopResultBuilder]: For program point L5634(lines 5634 5641) no Hoare annotation was computed. [2022-11-18 20:33:10,946 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5627 5643) no Hoare annotation was computed. [2022-11-18 20:33:10,946 INFO L899 garLoopResultBuilder]: For program point crc32_leEXIT(lines 6597 6599) no Hoare annotation was computed. [2022-11-18 20:33:10,946 INFO L902 garLoopResultBuilder]: At program point crc32_leENTRY(lines 6597 6599) the Hoare annotation is: true [2022-11-18 20:33:10,946 INFO L899 garLoopResultBuilder]: For program point crc32_leFINAL(lines 6597 6599) no Hoare annotation was computed. [2022-11-18 20:33:10,946 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:33:10,946 INFO L899 garLoopResultBuilder]: For program point L5656-1(line 5656) no Hoare annotation was computed. [2022-11-18 20:33:10,946 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 5644 5660) no Hoare annotation was computed. [2022-11-18 20:33:10,947 INFO L902 garLoopResultBuilder]: At program point L5656(line 5656) the Hoare annotation is: true [2022-11-18 20:33:10,947 INFO L899 garLoopResultBuilder]: For program point L5651(lines 5651 5658) no Hoare annotation was computed. [2022-11-18 20:33:10,947 INFO L895 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 5644 5660) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~last_index~0 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_2~0 0))) (or .cse0 (not (= ~ldv_state_variable_2~0 1)) .cse1) (or .cse0 (not (= ~ldv_state_variable_0~0 1)) .cse1))) [2022-11-18 20:33:10,947 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 5644 5660) no Hoare annotation was computed. [2022-11-18 20:33:10,947 INFO L899 garLoopResultBuilder]: For program point skb_trimEXIT(lines 6629 6631) no Hoare annotation was computed. [2022-11-18 20:33:10,948 INFO L902 garLoopResultBuilder]: At program point skb_trimENTRY(lines 6629 6631) the Hoare annotation is: true [2022-11-18 20:33:10,948 INFO L899 garLoopResultBuilder]: For program point skb_trimFINAL(lines 6629 6631) no Hoare annotation was computed. [2022-11-18 20:33:10,948 INFO L895 garLoopResultBuilder]: At program point L6675(lines 6674 6676) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,948 INFO L899 garLoopResultBuilder]: For program point L6229(lines 6229 6243) no Hoare annotation was computed. [2022-11-18 20:33:10,948 INFO L899 garLoopResultBuilder]: For program point L6279(line 6279) no Hoare annotation was computed. [2022-11-18 20:33:10,948 INFO L902 garLoopResultBuilder]: At program point L6246(line 6246) the Hoare annotation is: true [2022-11-18 20:33:10,948 INFO L899 garLoopResultBuilder]: For program point L6180(lines 6180 6187) no Hoare annotation was computed. [2022-11-18 20:33:10,949 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 20:33:10,950 INFO L895 garLoopResultBuilder]: At program point L6362(lines 6351 6364) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,950 INFO L895 garLoopResultBuilder]: At program point L6263(line 6263) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,950 INFO L899 garLoopResultBuilder]: For program point L6263-1(line 6263) no Hoare annotation was computed. [2022-11-18 20:33:10,950 INFO L899 garLoopResultBuilder]: For program point L6280-2(lines 6255 6301) no Hoare annotation was computed. [2022-11-18 20:33:10,950 INFO L899 garLoopResultBuilder]: For program point L6280(lines 6280 6284) no Hoare annotation was computed. [2022-11-18 20:33:10,951 INFO L902 garLoopResultBuilder]: At program point L6313(lines 6123 6315) the Hoare annotation is: true [2022-11-18 20:33:10,951 INFO L895 garLoopResultBuilder]: At program point L6082(lines 6077 6084) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,951 INFO L895 garLoopResultBuilder]: At program point L6660(lines 6659 6661) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,951 INFO L899 garLoopResultBuilder]: For program point L6231(lines 6231 6236) no Hoare annotation was computed. [2022-11-18 20:33:10,951 INFO L899 garLoopResultBuilder]: For program point L6165(line 6165) no Hoare annotation was computed. [2022-11-18 20:33:10,951 INFO L899 garLoopResultBuilder]: For program point L6231-2(lines 6229 6242) no Hoare annotation was computed. [2022-11-18 20:33:10,952 INFO L899 garLoopResultBuilder]: For program point L6182(lines 6182 6185) no Hoare annotation was computed. [2022-11-18 20:33:10,952 INFO L895 garLoopResultBuilder]: At program point L6281(line 6281) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,952 INFO L899 garLoopResultBuilder]: For program point L6281-1(line 6281) no Hoare annotation was computed. [2022-11-18 20:33:10,952 INFO L899 garLoopResultBuilder]: For program point L6149(lines 6149 6308) no Hoare annotation was computed. [2022-11-18 20:33:10,952 INFO L895 garLoopResultBuilder]: At program point L6529(lines 6525 6531) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-11-18 20:33:10,952 INFO L899 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2022-11-18 20:33:10,952 INFO L899 garLoopResultBuilder]: For program point L6166(lines 6166 6171) no Hoare annotation was computed. [2022-11-18 20:33:10,953 INFO L899 garLoopResultBuilder]: For program point L6166-2(lines 6153 6211) no Hoare annotation was computed. [2022-11-18 20:33:10,953 INFO L899 garLoopResultBuilder]: For program point L6150(line 6150) no Hoare annotation was computed. [2022-11-18 20:33:10,953 INFO L899 garLoopResultBuilder]: For program point L6216(line 6216) no Hoare annotation was computed. [2022-11-18 20:33:10,953 INFO L899 garLoopResultBuilder]: For program point L6299(line 6299) no Hoare annotation was computed. [2022-11-18 20:33:10,953 INFO L895 garLoopResultBuilder]: At program point L6167(line 6167) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,953 INFO L895 garLoopResultBuilder]: At program point L6646(lines 6645 6647) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,954 INFO L899 garLoopResultBuilder]: For program point L6167-1(line 6167) no Hoare annotation was computed. [2022-11-18 20:33:10,954 INFO L899 garLoopResultBuilder]: For program point L6200(lines 6200 6207) no Hoare annotation was computed. [2022-11-18 20:33:10,954 INFO L895 garLoopResultBuilder]: At program point L6382(lines 6377 6384) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-11-18 20:33:10,954 INFO L899 garLoopResultBuilder]: For program point L6151(lines 6151 6214) no Hoare annotation was computed. [2022-11-18 20:33:10,954 INFO L895 garLoopResultBuilder]: At program point L6118(line 6118) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,954 INFO L899 garLoopResultBuilder]: For program point L6217(lines 6217 6250) no Hoare annotation was computed. [2022-11-18 20:33:10,955 INFO L899 garLoopResultBuilder]: For program point L6118-1(line 6118) no Hoare annotation was computed. [2022-11-18 20:33:10,955 INFO L902 garLoopResultBuilder]: At program point L6300(line 6300) the Hoare annotation is: true [2022-11-18 20:33:10,955 INFO L895 garLoopResultBuilder]: At program point L6664(lines 6663 6665) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,955 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:33:10,955 INFO L899 garLoopResultBuilder]: For program point L6202(lines 6202 6205) no Hoare annotation was computed. [2022-11-18 20:33:10,955 INFO L899 garLoopResultBuilder]: For program point L6268(line 6268) no Hoare annotation was computed. [2022-11-18 20:33:10,955 INFO L899 garLoopResultBuilder]: For program point L6136-1(line 6136) no Hoare annotation was computed. [2022-11-18 20:33:10,956 INFO L899 garLoopResultBuilder]: For program point L6582(lines 6582 6585) no Hoare annotation was computed. [2022-11-18 20:33:10,956 INFO L895 garLoopResultBuilder]: At program point L6136(line 6136) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-11-18 20:33:10,956 INFO L899 garLoopResultBuilder]: For program point L6219(lines 6219 6247) no Hoare annotation was computed. [2022-11-18 20:33:10,956 INFO L899 garLoopResultBuilder]: For program point L6252(line 6252) no Hoare annotation was computed. [2022-11-18 20:33:10,956 INFO L899 garLoopResultBuilder]: For program point L6153(lines 6153 6211) no Hoare annotation was computed. [2022-11-18 20:33:10,956 INFO L895 garLoopResultBuilder]: At program point L6120(lines 6114 6122) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,957 INFO L899 garLoopResultBuilder]: For program point L6269(lines 6269 6277) no Hoare annotation was computed. [2022-11-18 20:33:10,957 INFO L895 garLoopResultBuilder]: At program point L6286(line 6286) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,958 INFO L899 garLoopResultBuilder]: For program point L6154(line 6154) no Hoare annotation was computed. [2022-11-18 20:33:10,958 INFO L899 garLoopResultBuilder]: For program point L6253(lines 6253 6304) no Hoare annotation was computed. [2022-11-18 20:33:10,958 INFO L899 garLoopResultBuilder]: For program point L6286-1(line 6286) no Hoare annotation was computed. [2022-11-18 20:33:10,958 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-11-18 20:33:10,958 INFO L895 garLoopResultBuilder]: At program point L5543(lines 5539 5545) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,958 INFO L895 garLoopResultBuilder]: At program point L5857(lines 5841 5859) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,959 INFO L895 garLoopResultBuilder]: At program point L6138(line 6138) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-11-18 20:33:10,959 INFO L902 garLoopResultBuilder]: At program point L6584-1(lines 6577 6588) the Hoare annotation is: true [2022-11-18 20:33:10,961 INFO L899 garLoopResultBuilder]: For program point L6138-1(line 6138) no Hoare annotation was computed. [2022-11-18 20:33:10,961 INFO L895 garLoopResultBuilder]: At program point L6584(line 6584) the Hoare annotation is: false [2022-11-18 20:33:10,961 INFO L899 garLoopResultBuilder]: For program point L6155(lines 6155 6163) no Hoare annotation was computed. [2022-11-18 20:33:10,962 INFO L899 garLoopResultBuilder]: For program point L6221(lines 6221 6226) no Hoare annotation was computed. [2022-11-18 20:33:10,962 INFO L895 garLoopResultBuilder]: At program point L6089(lines 6085 6091) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,962 INFO L895 garLoopResultBuilder]: At program point L6370(lines 6365 6372) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,962 INFO L899 garLoopResultBuilder]: For program point L6271(lines 6271 6275) no Hoare annotation was computed. [2022-11-18 20:33:10,962 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:33:10,962 INFO L899 garLoopResultBuilder]: For program point L6255(lines 6255 6301) no Hoare annotation was computed. [2022-11-18 20:33:10,963 INFO L895 garLoopResultBuilder]: At program point L6602(lines 6601 6603) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,963 INFO L899 garLoopResultBuilder]: For program point L6189(line 6189) no Hoare annotation was computed. [2022-11-18 20:33:10,963 INFO L895 garLoopResultBuilder]: At program point L6668(lines 6667 6669) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,963 INFO L895 garLoopResultBuilder]: At program point L6470(lines 6467 6472) the Hoare annotation is: (and (not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0)) (= ~last_index~0 0)) [2022-11-18 20:33:10,963 INFO L895 garLoopResultBuilder]: At program point L6239(lines 6135 6314) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,963 INFO L895 garLoopResultBuilder]: At program point L6107(line 6107) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,964 INFO L899 garLoopResultBuilder]: For program point L6107-1(line 6107) no Hoare annotation was computed. [2022-11-18 20:33:10,964 INFO L895 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,964 INFO L899 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2022-11-18 20:33:10,964 INFO L899 garLoopResultBuilder]: For program point L6190(lines 6190 6197) no Hoare annotation was computed. [2022-11-18 20:33:10,964 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-11-18 20:33:10,964 INFO L899 garLoopResultBuilder]: For program point L6157(lines 6157 6161) no Hoare annotation was computed. [2022-11-18 20:33:10,964 INFO L895 garLoopResultBuilder]: At program point L6636(lines 6635 6637) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,965 INFO L899 garLoopResultBuilder]: For program point L6306(line 6306) no Hoare annotation was computed. [2022-11-18 20:33:10,965 INFO L895 garLoopResultBuilder]: At program point L6141(line 6141) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-11-18 20:33:10,965 INFO L899 garLoopResultBuilder]: For program point L6141-1(line 6141) no Hoare annotation was computed. [2022-11-18 20:33:10,965 INFO L899 garLoopResultBuilder]: For program point L6257-2(lines 6255 6301) no Hoare annotation was computed. [2022-11-18 20:33:10,965 INFO L899 garLoopResultBuilder]: For program point L6257(lines 6257 6261) no Hoare annotation was computed. [2022-11-18 20:33:10,965 INFO L902 garLoopResultBuilder]: At program point L6307(line 6307) the Hoare annotation is: true [2022-11-18 20:33:10,966 INFO L895 garLoopResultBuilder]: At program point L6142(line 6142) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-11-18 20:33:10,966 INFO L899 garLoopResultBuilder]: For program point L6142-1(line 6142) no Hoare annotation was computed. [2022-11-18 20:33:10,967 INFO L895 garLoopResultBuilder]: At program point L6109(line 6109) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,967 INFO L899 garLoopResultBuilder]: For program point L6109-1(line 6109) no Hoare annotation was computed. [2022-11-18 20:33:10,967 INFO L899 garLoopResultBuilder]: For program point L6291(line 6291) no Hoare annotation was computed. [2022-11-18 20:33:10,968 INFO L895 garLoopResultBuilder]: At program point L6258(line 6258) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,968 INFO L899 garLoopResultBuilder]: For program point L6258-1(line 6258) no Hoare annotation was computed. [2022-11-18 20:33:10,968 INFO L899 garLoopResultBuilder]: For program point L6192(lines 6192 6195) no Hoare annotation was computed. [2022-11-18 20:33:10,968 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:33:10,968 INFO L899 garLoopResultBuilder]: For program point L6209(line 6209) no Hoare annotation was computed. [2022-11-18 20:33:10,968 INFO L899 garLoopResultBuilder]: For program point L6292(lines 6292 6297) no Hoare annotation was computed. [2022-11-18 20:33:10,968 INFO L895 garLoopResultBuilder]: At program point L6606(lines 6605 6607) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,969 INFO L895 garLoopResultBuilder]: At program point L6639(lines 6638 6640) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,969 INFO L902 garLoopResultBuilder]: At program point L6210(line 6210) the Hoare annotation is: true [2022-11-18 20:33:10,969 INFO L895 garLoopResultBuilder]: At program point L6309(lines 6135 6314) the Hoare annotation is: (= ~last_index~0 0) [2022-11-18 20:33:10,969 INFO L895 garLoopResultBuilder]: At program point L6111(lines 6102 6113) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,969 INFO L899 garLoopResultBuilder]: For program point L5848(lines 5848 5854) no Hoare annotation was computed. [2022-11-18 20:33:10,969 INFO L899 garLoopResultBuilder]: For program point L6228(line 6228) no Hoare annotation was computed. [2022-11-18 20:33:10,970 INFO L895 garLoopResultBuilder]: At program point L5799(lines 5794 5801) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,970 INFO L895 garLoopResultBuilder]: At program point L5766(lines 5762 5768) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-11-18 20:33:10,970 INFO L899 garLoopResultBuilder]: For program point L6179(line 6179) no Hoare annotation was computed. [2022-11-18 20:33:10,970 INFO L899 garLoopResultBuilder]: For program point L6245(line 6245) no Hoare annotation was computed. [2022-11-18 20:33:10,970 INFO L902 garLoopResultBuilder]: At program point L6590(lines 6589 6591) the Hoare annotation is: true [2022-11-18 20:33:10,970 INFO L902 garLoopResultBuilder]: At program point dev_kfree_skb_anyENTRY(lines 5716 5722) the Hoare annotation is: true [2022-11-18 20:33:10,970 INFO L899 garLoopResultBuilder]: For program point dev_kfree_skb_anyEXIT(lines 5716 5722) no Hoare annotation was computed. [2022-11-18 20:33:10,971 INFO L899 garLoopResultBuilder]: For program point dev_kfree_skb_anyFINAL(lines 5716 5722) no Hoare annotation was computed. [2022-11-18 20:33:10,971 INFO L899 garLoopResultBuilder]: For program point L5568(lines 5568 5572) no Hoare annotation was computed. [2022-11-18 20:33:10,971 INFO L899 garLoopResultBuilder]: For program point eem_tx_fixupEXIT(lines 5860 5925) no Hoare annotation was computed. [2022-11-18 20:33:10,971 INFO L895 garLoopResultBuilder]: At program point L5759(lines 5755 5761) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-11-18 20:33:10,971 INFO L895 garLoopResultBuilder]: At program point L5536(lines 5533 5538) the Hoare annotation is: (or (not (= ~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|))) [2022-11-18 20:33:10,971 INFO L899 garLoopResultBuilder]: For program point L5916-1(line 5916) no Hoare annotation was computed. [2022-11-18 20:33:10,972 INFO L895 garLoopResultBuilder]: At program point L5916(line 5916) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-11-18 20:33:10,972 INFO L899 garLoopResultBuilder]: For program point L5908-1(line 5908) no Hoare annotation was computed. [2022-11-18 20:33:10,972 INFO L895 garLoopResultBuilder]: At program point L5908(line 5908) 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 (= ~last_index~0 0))) [2022-11-18 20:33:10,972 INFO L895 garLoopResultBuilder]: At program point L5917(line 5917) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-11-18 20:33:10,972 INFO L899 garLoopResultBuilder]: For program point L5917-1(lines 5875 5924) no Hoare annotation was computed. [2022-11-18 20:33:10,972 INFO L899 garLoopResultBuilder]: For program point L5918(lines 5918 5922) no Hoare annotation was computed. [2022-11-18 20:33:10,973 INFO L899 garLoopResultBuilder]: For program point L5885-2(lines 5885 5902) no Hoare annotation was computed. [2022-11-18 20:33:10,973 INFO L899 garLoopResultBuilder]: For program point L5885(lines 5885 5902) no Hoare annotation was computed. [2022-11-18 20:33:10,973 INFO L902 garLoopResultBuilder]: At program point L5910(lines 5875 5924) the Hoare annotation is: true [2022-11-18 20:33:10,975 INFO L899 garLoopResultBuilder]: For program point L5894(lines 5894 5900) no Hoare annotation was computed. [2022-11-18 20:33:10,975 INFO L895 garLoopResultBuilder]: At program point L5919(line 5919) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-11-18 20:33:10,975 INFO L899 garLoopResultBuilder]: For program point L5919-1(line 5919) no Hoare annotation was computed. [2022-11-18 20:33:10,975 INFO L902 garLoopResultBuilder]: At program point L5597(lines 5592 5599) the Hoare annotation is: true [2022-11-18 20:33:10,975 INFO L902 garLoopResultBuilder]: At program point L5911(line 5911) the Hoare annotation is: true [2022-11-18 20:33:10,976 INFO L899 garLoopResultBuilder]: For program point L5911-1(line 5911) no Hoare annotation was computed. [2022-11-18 20:33:10,976 INFO L902 garLoopResultBuilder]: At program point L5589(lines 5585 5591) the Hoare annotation is: true [2022-11-18 20:33:10,976 INFO L895 garLoopResultBuilder]: At program point L5556(lines 5553 5558) the Hoare annotation is: (or (not (= ~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|))) [2022-11-18 20:33:10,976 INFO L899 garLoopResultBuilder]: For program point L5614(line 5614) no Hoare annotation was computed. [2022-11-18 20:33:10,976 INFO L895 garLoopResultBuilder]: At program point L5614-3(lines 5609 5616) the Hoare annotation is: (or (not (= ~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|))) [2022-11-18 20:33:10,976 INFO L899 garLoopResultBuilder]: For program point L5614-2(line 5614) no Hoare annotation was computed. [2022-11-18 20:33:10,977 INFO L895 garLoopResultBuilder]: At program point L5606(lines 5603 5608) the Hoare annotation is: (or (not (= ~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|))) [2022-11-18 20:33:10,977 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-11-18 20:33:10,977 INFO L895 garLoopResultBuilder]: At program point L5920(line 5920) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-11-18 20:33:10,977 INFO L899 garLoopResultBuilder]: For program point eem_tx_fixupFINAL(lines 5860 5925) no Hoare annotation was computed. [2022-11-18 20:33:10,977 INFO L902 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: true [2022-11-18 20:33:10,977 INFO L899 garLoopResultBuilder]: For program point L5565(lines 5565 5575) no Hoare annotation was computed. [2022-11-18 20:33:10,977 INFO L899 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2022-11-18 20:33:10,978 INFO L899 garLoopResultBuilder]: For program point L5565-1(lines 5565 5575) no Hoare annotation was computed. [2022-11-18 20:33:10,978 INFO L895 garLoopResultBuilder]: At program point eem_tx_fixupENTRY(lines 5860 5925) the Hoare annotation is: (or (not (= ~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|))) [2022-11-18 20:33:10,978 INFO L895 garLoopResultBuilder]: At program point L5582(lines 5579 5584) the Hoare annotation is: (or (not (= ~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|))) [2022-11-18 20:33:10,978 INFO L899 garLoopResultBuilder]: For program point L5904(lines 5904 5907) no Hoare annotation was computed. [2022-11-18 20:33:10,978 INFO L899 garLoopResultBuilder]: For program point L5880-2(lines 5880 5883) no Hoare annotation was computed. [2022-11-18 20:33:10,978 INFO L895 garLoopResultBuilder]: At program point L5913(line 5913) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-11-18 20:33:10,979 INFO L899 garLoopResultBuilder]: For program point L5880(lines 5880 5883) no Hoare annotation was computed. [2022-11-18 20:33:10,979 INFO L899 garLoopResultBuilder]: For program point L5913-1(line 5913) no Hoare annotation was computed. [2022-11-18 20:33:10,979 INFO L895 garLoopResultBuilder]: At program point L6616-2(lines 6615 6617) 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 (= ~last_index~0 0))) [2022-11-18 20:33:10,979 INFO L899 garLoopResultBuilder]: For program point L6616-1(line 6616) no Hoare annotation was computed. [2022-11-18 20:33:10,980 INFO L895 garLoopResultBuilder]: At program point L6616(line 6616) the Hoare annotation is: (or (not (= ~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|))) [2022-11-18 20:33:10,980 INFO L895 garLoopResultBuilder]: At program point L5576(lines 5559 5578) the Hoare annotation is: (or (not (= ~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|))) [2022-11-18 20:33:10,980 INFO L899 garLoopResultBuilder]: For program point L5890(lines 5890 5893) no Hoare annotation was computed. [2022-11-18 20:33:10,983 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-18 20:33:10,985 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:33:10,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:10,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:10,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:10,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,006 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,006 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,006 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,028 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,030 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,030 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,030 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,032 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,033 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,033 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,033 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,035 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,035 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,035 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,036 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,036 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,036 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,037 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,038 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,041 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,042 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,042 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:33:11 BoogieIcfgContainer [2022-11-18 20:33:11,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:33:11,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:33:11,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:33:11,056 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:33:11,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:32:40" (3/4) ... [2022-11-18 20:33:11,060 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:33:11,067 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usbnet_disconnect [2022-11-18 20:33:11,068 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure put_unaligned_le16 [2022-11-18 20:33:11,068 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_push [2022-11-18 20:33:11,068 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_set_remove [2022-11-18 20:33:11,068 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2022-11-18 20:33:11,068 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_clone [2022-11-18 20:33:11,068 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-18 20:33:11,068 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free [2022-11-18 20:33:11,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-11-18 20:33:11,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_put [2022-11-18 20:33:11,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure eem_rx_fixup [2022-11-18 20:33:11,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-18 20:33:11,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-18 20:33:11,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure crc32_le [2022-11-18 20:33:11,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_pull [2022-11-18 20:33:11,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-11-18 20:33:11,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-18 20:33:11,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_trim [2022-11-18 20:33:11,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_kfree_skb_any [2022-11-18 20:33:11,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure eem_tx_fixup [2022-11-18 20:33:11,071 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2022-11-18 20:33:11,096 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 153 nodes and edges [2022-11-18 20:33:11,098 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2022-11-18 20:33:11,100 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-18 20:33:11,102 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-18 20:33:11,104 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:33:11,105 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:33:11,135 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,136 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$)) || !(last_index == 0) [2022-11-18 20:33:11,139 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\result == 0) && last_index == 0 [2022-11-18 20:33:11,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == deleted_index + 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 <= i) && \old(last_index) == last_index) [2022-11-18 20:33:11,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) [2022-11-18 20:33:11,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(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) [2022-11-18 20:33:11,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(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) [2022-11-18 20:33:11,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-11-18 20:33:11,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(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) [2022-11-18 20:33:11,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(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) [2022-11-18 20:33:11,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(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) [2022-11-18 20:33:11,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(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) [2022-11-18 20:33:11,277 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:33:11,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:33:11,278 INFO L158 Benchmark]: Toolchain (without parser) took 35376.55ms. Allocated memory was 125.8MB in the beginning and 450.9MB in the end (delta: 325.1MB). Free memory was 81.4MB in the beginning and 356.9MB in the end (delta: -275.5MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2022-11-18 20:33:11,278 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory was 106.5MB in the beginning and 106.4MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:33:11,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1624.52ms. Allocated memory is still 125.8MB. Free memory was 81.2MB in the beginning and 54.4MB in the end (delta: 26.7MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-11-18 20:33:11,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 199.05ms. Allocated memory was 125.8MB in the beginning and 195.0MB in the end (delta: 69.2MB). Free memory was 54.4MB in the beginning and 147.2MB in the end (delta: -92.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 20:33:11,279 INFO L158 Benchmark]: Boogie Preprocessor took 148.47ms. Allocated memory is still 195.0MB. Free memory was 147.2MB in the beginning and 139.8MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:33:11,280 INFO L158 Benchmark]: RCFGBuilder took 2764.08ms. Allocated memory is still 195.0MB. Free memory was 138.8MB in the beginning and 109.0MB in the end (delta: 29.8MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2022-11-18 20:33:11,280 INFO L158 Benchmark]: TraceAbstraction took 30410.96ms. Allocated memory was 195.0MB in the beginning and 450.9MB in the end (delta: 255.9MB). Free memory was 108.0MB in the beginning and 376.8MB in the end (delta: -268.8MB). Peak memory consumption was 243.2MB. Max. memory is 16.1GB. [2022-11-18 20:33:11,281 INFO L158 Benchmark]: Witness Printer took 221.83ms. Allocated memory is still 450.9MB. Free memory was 376.8MB in the beginning and 356.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-18 20:33:11,283 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.18ms. Allocated memory is still 125.8MB. Free memory was 106.5MB in the beginning and 106.4MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1624.52ms. Allocated memory is still 125.8MB. Free memory was 81.2MB in the beginning and 54.4MB in the end (delta: 26.7MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 199.05ms. Allocated memory was 125.8MB in the beginning and 195.0MB in the end (delta: 69.2MB). Free memory was 54.4MB in the beginning and 147.2MB in the end (delta: -92.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.47ms. Allocated memory is still 195.0MB. Free memory was 147.2MB in the beginning and 139.8MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2764.08ms. Allocated memory is still 195.0MB. Free memory was 138.8MB in the beginning and 109.0MB in the end (delta: 29.8MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. * TraceAbstraction took 30410.96ms. Allocated memory was 195.0MB in the beginning and 450.9MB in the end (delta: 255.9MB). Free memory was 108.0MB in the beginning and 376.8MB in the end (delta: -268.8MB). Peak memory consumption was 243.2MB. Max. memory is 16.1GB. * Witness Printer took 221.83ms. Allocated memory is still 450.9MB. Free memory was 376.8MB in the beginning and 356.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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 - 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: 5681]: 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 22 procedures, 324 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4583 SdHoareTripleChecker+Valid, 17.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4407 mSDsluCounter, 8278 SdHoareTripleChecker+Invalid, 16.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6385 mSDsCounter, 1361 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4479 IncrementalHoareTripleChecker+Invalid, 5840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1361 mSolverCounterUnsat, 1893 mSDtfsCounter, 4479 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2480occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 6 MinimizatonAttempts, 1667 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 130 LocationsWithAnnotation, 3362 PreInvPairs, 4034 NumberOfFragments, 1009 HoareAnnotationTreeSize, 3362 FomulaSimplifications, 45204 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 130 FomulaSimplificationsInter, 47319 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 804 ConstructedInterpolants, 0 QuantifiedInterpolants, 1857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 388/388 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: 5559]: Loop Invariant [2022-11-18 20:33:11,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(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) - InvariantResult [Line: 6102]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 6663]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 6123]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5486]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5732]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6632]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6601]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 6365]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5952]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6615]: Loop Invariant [2022-11-18 20:33:11,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,298 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$)) || !(last_index == 0) - InvariantResult [Line: 6638]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 5775]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5521]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5509]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6377]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 0 && last_index == 0 - InvariantResult [Line: 6659]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 5724]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6135]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 6645]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && last_index == 0 - InvariantResult [Line: 5755]: Loop Invariant Derived loop invariant: !(last_index == 0) - InvariantResult [Line: 6467]: Loop Invariant Derived loop invariant: !(\result == 0) && last_index == 0 - InvariantResult [Line: 6135]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6351]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && last_index == 0 - InvariantResult [Line: 5539]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 5501]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5762]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 5609]: Loop Invariant [2022-11-18 20:33:11,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(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) - InvariantResult [Line: 6114]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && last_index == 0 - InvariantResult [Line: 5493]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5515]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6652]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5740]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5821]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6589]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6077]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && last_index == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6432]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) - InvariantResult [Line: 5603]: Loop Invariant [2022-11-18 20:33:11,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(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) - InvariantResult [Line: 6418]: Loop Invariant [2022-11-18 20:33:11,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(\old(last_index) == 0) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == deleted_index + 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 <= i) && \old(last_index) == last_index) - InvariantResult [Line: 6605]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5841]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 5684]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6667]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5942]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5875]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6635]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5553]: Loop Invariant [2022-11-18 20:33:11,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(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) - InvariantResult [Line: 6670]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5533]: Loop Invariant [2022-11-18 20:33:11,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(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) - InvariantResult [Line: 6085]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 6674]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6525]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 0 && last_index == 0 - InvariantResult [Line: 5585]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5942]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6649]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5817]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5579]: Loop Invariant [2022-11-18 20:33:11,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:33:11,330 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:33:11,330 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(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) RESULT: Ultimate proved your program to be correct! [2022-11-18 20:33:11,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca8825d-a993-423a-9468-febbb6a8ca82/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