./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5ad15ea2ee4e38087fdbbd25111673bb935102e85f8e91f44e32009dacc41114 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:10:27,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:10:27,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:10:27,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:10:27,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:10:27,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:10:27,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:10:27,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:10:27,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:10:27,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:10:27,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:10:27,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:10:27,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:10:27,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:10:27,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:10:27,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:10:27,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:10:27,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:10:27,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:10:27,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:10:27,530 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:10:27,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:10:27,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:10:27,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:10:27,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:10:27,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:10:27,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:10:27,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:10:27,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:10:27,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:10:27,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:10:27,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:10:27,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:10:27,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:10:27,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:10:27,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:10:27,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:10:27,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:10:27,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:10:27,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:10:27,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:10:27,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:10:27,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:10:27,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:10:27,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:10:27,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:10:27,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:10:27,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:10:27,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:10:27,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:10:27,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:10:27,577 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:10:27,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:10:27,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:10:27,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:10:27,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:10:27,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:10:27,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:10:27,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:10:27,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:10:27,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:10:27,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:10:27,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:10:27,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:10:27,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:10:27,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:10:27,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:10:27,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:10:27,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:10:27,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:10:27,580 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:10:27,581 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:10:27,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:10:27,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ad15ea2ee4e38087fdbbd25111673bb935102e85f8e91f44e32009dacc41114 [2022-07-14 00:10:27,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:10:27,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:10:27,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:10:27,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:10:27,847 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:10:27,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../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-07-14 00:10:27,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7aef8c35/18029b7ddf6745fea8702910d477d03f/FLAG534f01e99 [2022-07-14 00:10:28,592 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:10:28,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/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-07-14 00:10:28,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7aef8c35/18029b7ddf6745fea8702910d477d03f/FLAG534f01e99 [2022-07-14 00:10:28,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7aef8c35/18029b7ddf6745fea8702910d477d03f [2022-07-14 00:10:28,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:10:28,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:10:28,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:10:28,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:10:28,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:10:28,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:10:28" (1/1) ... [2022-07-14 00:10:28,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6049eee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:28, skipping insertion in model container [2022-07-14 00:10:28,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:10:28" (1/1) ... [2022-07-14 00:10:28,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:10:29,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:10:29,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-07-14 00:10:29,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:10:30,019 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:10:30,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-07-14 00:10:30,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:10:30,258 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:10:30,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30 WrapperNode [2022-07-14 00:10:30,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:10:30,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:10:30,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:10:30,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:10:30,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (1/1) ... [2022-07-14 00:10:30,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (1/1) ... [2022-07-14 00:10:30,398 INFO L137 Inliner]: procedures = 125, calls = 327, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1066 [2022-07-14 00:10:30,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:10:30,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:10:30,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:10:30,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:10:30,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (1/1) ... [2022-07-14 00:10:30,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (1/1) ... [2022-07-14 00:10:30,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (1/1) ... [2022-07-14 00:10:30,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (1/1) ... [2022-07-14 00:10:30,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (1/1) ... [2022-07-14 00:10:30,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (1/1) ... [2022-07-14 00:10:30,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (1/1) ... [2022-07-14 00:10:30,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:10:30,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:10:30,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:10:30,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:10:30,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (1/1) ... [2022-07-14 00:10:30,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:10:30,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:10:30,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 00:10:30,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 00:10:30,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 00:10:30,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 00:10:30,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 00:10:30,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:10:30,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:10:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:10:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-07-14 00:10:30,634 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-07-14 00:10:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-14 00:10:30,634 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-14 00:10:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure skb_clone [2022-07-14 00:10:30,635 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_clone [2022-07-14 00:10:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-14 00:10:30,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-14 00:10:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:10:30,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:10:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-14 00:10:30,637 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-14 00:10:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:10:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:10:30,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:10:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-14 00:10:30,638 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-14 00:10:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 00:10:30,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 00:10:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure put_unaligned_le16 [2022-07-14 00:10:30,639 INFO L138 BoogieDeclarations]: Found implementation of procedure put_unaligned_le16 [2022-07-14 00:10:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 00:10:30,639 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 00:10:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:10:30,639 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:10:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure eem_rx_fixup [2022-07-14 00:10:30,640 INFO L138 BoogieDeclarations]: Found implementation of procedure eem_rx_fixup [2022-07-14 00:10:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:10:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-14 00:10:30,640 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-14 00:10:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-14 00:10:30,640 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-14 00:10:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:10:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:10:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:10:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:10:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-14 00:10:30,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-14 00:10:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-14 00:10:30,642 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-14 00:10:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:10:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:10:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-14 00:10:30,643 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-14 00:10:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:10:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 00:10:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 00:10:30,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 00:10:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:10:30,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:10:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure eem_tx_fixup [2022-07-14 00:10:30,646 INFO L138 BoogieDeclarations]: Found implementation of procedure eem_tx_fixup [2022-07-14 00:10:31,011 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:10:31,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:10:31,087 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:10:32,427 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:10:32,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:10:32,443 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 00:10:32,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:10:32 BoogieIcfgContainer [2022-07-14 00:10:32,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:10:32,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:10:32,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:10:32,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:10:32,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:10:28" (1/3) ... [2022-07-14 00:10:32,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b455664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:10:32, skipping insertion in model container [2022-07-14 00:10:32,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:10:30" (2/3) ... [2022-07-14 00:10:32,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b455664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:10:32, skipping insertion in model container [2022-07-14 00:10:32,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:10:32" (3/3) ... [2022-07-14 00:10:32,457 INFO L111 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-07-14 00:10:32,471 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:10:32,472 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:10:32,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:10:32,554 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a5dddad, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50df5706 [2022-07-14 00:10:32,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:10:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 331 states, 260 states have (on average 1.4076923076923078) internal successors, (366), 269 states have internal predecessors, (366), 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-07-14 00:10:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 00:10:32,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:10:32,573 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-07-14 00:10:32,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:10:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:10:32,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2123580828, now seen corresponding path program 1 times [2022-07-14 00:10:32,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:10:32,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878974193] [2022-07-14 00:10:32,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:10:32,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:10:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:32,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:10:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:33,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:10:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:10:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:10:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 00:10:33,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:10:33,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878974193] [2022-07-14 00:10:33,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878974193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:10:33,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:10:33,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:10:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274697505] [2022-07-14 00:10:33,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:10:33,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:10:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:10:33,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:10:33,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:10:33,158 INFO L87 Difference]: Start difference. First operand has 331 states, 260 states have (on average 1.4076923076923078) internal successors, (366), 269 states have internal predecessors, (366), 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-07-14 00:10:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:10:35,587 INFO L93 Difference]: Finished difference Result 1152 states and 1717 transitions. [2022-07-14 00:10:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:10:35,590 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-07-14 00:10:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:10:35,607 INFO L225 Difference]: With dead ends: 1152 [2022-07-14 00:10:35,608 INFO L226 Difference]: Without dead ends: 762 [2022-07-14 00:10:35,617 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-07-14 00:10:35,620 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 960 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:10:35,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 1182 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 00:10:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-07-14 00:10:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 553. [2022-07-14 00:10:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 449 states have (on average 1.3407572383073496) internal successors, (602), 453 states have internal predecessors, (602), 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-07-14 00:10:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 737 transitions. [2022-07-14 00:10:35,721 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 737 transitions. Word has length 42 [2022-07-14 00:10:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:10:35,722 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 737 transitions. [2022-07-14 00:10:35,722 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-07-14 00:10:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 737 transitions. [2022-07-14 00:10:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 00:10:35,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:10:35,726 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-07-14 00:10:35,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:10:35,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:10:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:10:35,728 INFO L85 PathProgramCache]: Analyzing trace with hash 653867414, now seen corresponding path program 1 times [2022-07-14 00:10:35,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:10:35,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794381203] [2022-07-14 00:10:35,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:10:35,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:10:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:35,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:10:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:35,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:10:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:35,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:10:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:35,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:10:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:35,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:10:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 00:10:35,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:10:35,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794381203] [2022-07-14 00:10:35,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794381203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:10:35,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:10:35,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:10:35,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248014759] [2022-07-14 00:10:35,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:10:35,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:10:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:10:35,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:10:35,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:10:35,970 INFO L87 Difference]: Start difference. First operand 553 states and 737 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-07-14 00:10:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:10:38,314 INFO L93 Difference]: Finished difference Result 1497 states and 2083 transitions. [2022-07-14 00:10:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:10:38,315 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-07-14 00:10:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:10:38,326 INFO L225 Difference]: With dead ends: 1497 [2022-07-14 00:10:38,326 INFO L226 Difference]: Without dead ends: 1488 [2022-07-14 00:10:38,328 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-07-14 00:10:38,329 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 920 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:10:38,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 1682 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 00:10:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-07-14 00:10:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1219. [2022-07-14 00:10:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 998 states have (on average 1.3507014028056112) internal successors, (1348), 1008 states have internal predecessors, (1348), 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-07-14 00:10:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1657 transitions. [2022-07-14 00:10:38,403 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1657 transitions. Word has length 52 [2022-07-14 00:10:38,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:10:38,403 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1657 transitions. [2022-07-14 00:10:38,403 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-07-14 00:10:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1657 transitions. [2022-07-14 00:10:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 00:10:38,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:10:38,434 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-07-14 00:10:38,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:10:38,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:10:38,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:10:38,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2008058537, now seen corresponding path program 1 times [2022-07-14 00:10:38,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:10:38,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324789892] [2022-07-14 00:10:38,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:10:38,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:10:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:10:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:10:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:10:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:10:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:10:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 00:10:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:10:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 00:10:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:10:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:10:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:10:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:10:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 00:10:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 00:10:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 00:10:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-14 00:10:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:10:38,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324789892] [2022-07-14 00:10:38,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324789892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:10:38,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:10:38,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:10:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354280014] [2022-07-14 00:10:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:10:38,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:10:38,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:10:38,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:10:38,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:10:38,770 INFO L87 Difference]: Start difference. First operand 1219 states and 1657 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-07-14 00:10:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:10:42,197 INFO L93 Difference]: Finished difference Result 2919 states and 4033 transitions. [2022-07-14 00:10:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:10:42,198 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-07-14 00:10:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:10:42,208 INFO L225 Difference]: With dead ends: 2919 [2022-07-14 00:10:42,208 INFO L226 Difference]: Without dead ends: 1716 [2022-07-14 00:10:42,213 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-07-14 00:10:42,214 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 471 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:10:42,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1477 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-14 00:10:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-07-14 00:10:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1448. [2022-07-14 00:10:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1200 states have (on average 1.3708333333333333) internal successors, (1645), 1212 states have internal predecessors, (1645), 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-07-14 00:10:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1984 transitions. [2022-07-14 00:10:42,280 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1984 transitions. Word has length 162 [2022-07-14 00:10:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:10:42,281 INFO L495 AbstractCegarLoop]: Abstraction has 1448 states and 1984 transitions. [2022-07-14 00:10:42,281 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-07-14 00:10:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1984 transitions. [2022-07-14 00:10:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-14 00:10:42,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:10:42,286 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-07-14 00:10:42,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:10:42,286 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:10:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:10:42,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1866479413, now seen corresponding path program 1 times [2022-07-14 00:10:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:10:42,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68863039] [2022-07-14 00:10:42,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:10:42,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:10:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:10:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:10:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:10:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:10:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:10:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:10:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:10:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:10:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 00:10:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:10:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 00:10:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:10:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:10:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:10:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:10:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 00:10:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 00:10:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-14 00:10:42,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:10:42,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68863039] [2022-07-14 00:10:42,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68863039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:10:42,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:10:42,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:10:42,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884584002] [2022-07-14 00:10:42,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:10:42,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:10:42,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:10:42,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:10:42,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:10:42,626 INFO L87 Difference]: Start difference. First operand 1448 states and 1984 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-07-14 00:10:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:10:45,176 INFO L93 Difference]: Finished difference Result 4491 states and 6219 transitions. [2022-07-14 00:10:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:10:45,177 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-07-14 00:10:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:10:45,192 INFO L225 Difference]: With dead ends: 4491 [2022-07-14 00:10:45,192 INFO L226 Difference]: Without dead ends: 3070 [2022-07-14 00:10:45,197 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-07-14 00:10:45,204 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 967 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:10:45,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1488 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-14 00:10:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2022-07-14 00:10:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 2556. [2022-07-14 00:10:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2114 states have (on average 1.3571428571428572) internal successors, (2869), 2138 states have internal predecessors, (2869), 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-07-14 00:10:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3460 transitions. [2022-07-14 00:10:45,318 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3460 transitions. Word has length 184 [2022-07-14 00:10:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:10:45,319 INFO L495 AbstractCegarLoop]: Abstraction has 2556 states and 3460 transitions. [2022-07-14 00:10:45,319 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-07-14 00:10:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3460 transitions. [2022-07-14 00:10:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-14 00:10:45,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:10:45,328 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-07-14 00:10:45,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:10:45,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:10:45,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:10:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1671695385, now seen corresponding path program 1 times [2022-07-14 00:10:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:10:45,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143318329] [2022-07-14 00:10:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:10:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:10:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:10:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:10:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:10:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:10:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:10:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:10:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:10:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 00:10:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 00:10:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:10:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 00:10:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:10:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:10:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:10:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:10:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 00:10:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 00:10:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-14 00:10:45,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:10:45,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143318329] [2022-07-14 00:10:45,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143318329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:10:45,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:10:45,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:10:45,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784010593] [2022-07-14 00:10:45,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:10:45,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:10:45,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:10:45,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:10:45,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:10:45,715 INFO L87 Difference]: Start difference. First operand 2556 states and 3460 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-07-14 00:10:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:10:48,128 INFO L93 Difference]: Finished difference Result 4500 states and 6218 transitions. [2022-07-14 00:10:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:10:48,129 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-07-14 00:10:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:10:48,145 INFO L225 Difference]: With dead ends: 4500 [2022-07-14 00:10:48,146 INFO L226 Difference]: Without dead ends: 3069 [2022-07-14 00:10:48,151 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-07-14 00:10:48,152 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 368 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:10:48,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1320 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-14 00:10:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-07-14 00:10:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2564. [2022-07-14 00:10:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2122 states have (on average 1.3557964184731386) internal successors, (2877), 2146 states have internal predecessors, (2877), 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-07-14 00:10:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3468 transitions. [2022-07-14 00:10:48,311 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3468 transitions. Word has length 184 [2022-07-14 00:10:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:10:48,312 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3468 transitions. [2022-07-14 00:10:48,312 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-07-14 00:10:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3468 transitions. [2022-07-14 00:10:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-14 00:10:48,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:10:48,317 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-07-14 00:10:48,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:10:48,317 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:10:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:10:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1475470648, now seen corresponding path program 1 times [2022-07-14 00:10:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:10:48,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382586311] [2022-07-14 00:10:48,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:10:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:10:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:10:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:10:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:10:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:10:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:10:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:10:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:10:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 00:10:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 00:10:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:10:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 00:10:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:10:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:10:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:10:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:10:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 00:10:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:10:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:10:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:10:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-14 00:10:48,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:10:48,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382586311] [2022-07-14 00:10:48,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382586311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:10:48,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:10:48,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 00:10:48,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768443286] [2022-07-14 00:10:48,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:10:48,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 00:10:48,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:10:48,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 00:10:48,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:10:48,797 INFO L87 Difference]: Start difference. First operand 2564 states and 3468 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-07-14 00:10:51,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:10:52,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:10:52,857 INFO L93 Difference]: Finished difference Result 4039 states and 5526 transitions. [2022-07-14 00:10:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:10:52,859 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-07-14 00:10:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:10:52,861 INFO L225 Difference]: With dead ends: 4039 [2022-07-14 00:10:52,861 INFO L226 Difference]: Without dead ends: 0 [2022-07-14 00:10:52,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:10:52,871 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 996 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:10:52,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1463 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-14 00:10:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-14 00:10:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-14 00:10:52,873 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-07-14 00:10:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 00:10:52,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2022-07-14 00:10:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:10:52,874 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 00:10:52,874 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-07-14 00:10:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-14 00:10:52,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-14 00:10:52,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-14 00:10:52,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:10:52,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-14 00:10:57,700 INFO L902 garLoopResultBuilder]: At program point skb_putENTRY(lines 6624 6628) the Hoare annotation is: true [2022-07-14 00:10:57,700 INFO L899 garLoopResultBuilder]: For program point skb_putFINAL(lines 6624 6628) no Hoare annotation was computed. [2022-07-14 00:10:57,700 INFO L899 garLoopResultBuilder]: For program point skb_putEXIT(lines 6624 6628) no Hoare annotation was computed. [2022-07-14 00:10:57,700 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 5677 5683) no Hoare annotation was computed. [2022-07-14 00:10:57,700 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 5677 5683) the Hoare annotation is: true [2022-07-14 00:10:57,700 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5681) no Hoare annotation was computed. [2022-07-14 00:10:57,700 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 5677 5683) no Hoare annotation was computed. [2022-07-14 00:10:57,700 INFO L899 garLoopResultBuilder]: For program point L6619-1(line 6619) no Hoare annotation was computed. [2022-07-14 00:10:57,701 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-07-14 00:10:57,701 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-07-14 00:10:57,701 INFO L899 garLoopResultBuilder]: For program point skb_pullFINAL(lines 6618 6620) no Hoare annotation was computed. [2022-07-14 00:10:57,701 INFO L899 garLoopResultBuilder]: For program point skb_pullEXIT(lines 6618 6620) no Hoare annotation was computed. [2022-07-14 00:10:57,701 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5684 5690) no Hoare annotation was computed. [2022-07-14 00:10:57,701 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5684 5690) the Hoare annotation is: true [2022-07-14 00:10:57,701 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 5691 5696) no Hoare annotation was computed. [2022-07-14 00:10:57,702 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 5691 5696) the Hoare annotation is: true [2022-07-14 00:10:57,702 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 5691 5696) no Hoare annotation was computed. [2022-07-14 00:10:57,702 INFO L902 garLoopResultBuilder]: At program point usbnet_disconnectENTRY(lines 6655 6657) the Hoare annotation is: true [2022-07-14 00:10:57,702 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectFINAL(lines 6655 6657) no Hoare annotation was computed. [2022-07-14 00:10:57,702 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectEXIT(lines 6655 6657) no Hoare annotation was computed. [2022-07-14 00:10:57,702 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-07-14 00:10:57,702 INFO L899 garLoopResultBuilder]: For program point put_unaligned_le16FINAL(lines 5748 5754) no Hoare annotation was computed. [2022-07-14 00:10:57,702 INFO L899 garLoopResultBuilder]: For program point put_unaligned_le16EXIT(lines 5748 5754) no Hoare annotation was computed. [2022-07-14 00:10:57,703 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-07-14 00:10:57,703 INFO L899 garLoopResultBuilder]: For program point skb_pushFINAL(lines 6621 6623) no Hoare annotation was computed. [2022-07-14 00:10:57,703 INFO L899 garLoopResultBuilder]: For program point L6622-1(line 6622) no Hoare annotation was computed. [2022-07-14 00:10:57,703 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-07-14 00:10:57,703 INFO L899 garLoopResultBuilder]: For program point skb_pushEXIT(lines 6621 6623) no Hoare annotation was computed. [2022-07-14 00:10:57,703 INFO L899 garLoopResultBuilder]: For program point L6433-1(lines 6433 6436) no Hoare annotation was computed. [2022-07-14 00:10:57,703 INFO L899 garLoopResultBuilder]: For program point L6433(lines 6433 6436) no Hoare annotation was computed. [2022-07-14 00:10:57,704 INFO L899 garLoopResultBuilder]: For program point L6423(lines 6423 6427) no Hoare annotation was computed. [2022-07-14 00:10:57,704 INFO L899 garLoopResultBuilder]: For program point L6419-1(lines 6419 6422) no Hoare annotation was computed. [2022-07-14 00:10:57,704 INFO L899 garLoopResultBuilder]: For program point L6419(lines 6419 6422) no Hoare annotation was computed. [2022-07-14 00:10:57,704 INFO L895 garLoopResultBuilder]: At program point L6432-2(lines 6432 6439) the Hoare annotation is: (not (= |old(~last_index~0)| 0)) [2022-07-14 00:10:57,704 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-07-14 00:10:57,704 INFO L899 garLoopResultBuilder]: For program point L6432-3(lines 6432 6439) no Hoare annotation was computed. [2022-07-14 00:10:57,704 INFO L899 garLoopResultBuilder]: For program point L6430-1(lines 6411 6445) no Hoare annotation was computed. [2022-07-14 00:10:57,705 INFO L899 garLoopResultBuilder]: For program point L6418-3(lines 6415 6444) no Hoare annotation was computed. [2022-07-14 00:10:57,705 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-07-14 00:10:57,705 INFO L899 garLoopResultBuilder]: For program point ldv_set_removeEXIT(lines 6411 6445) no Hoare annotation was computed. [2022-07-14 00:10:57,705 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2022-07-14 00:10:57,705 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-14 00:10:57,705 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-07-14 00:10:57,705 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2022-07-14 00:10:57,706 INFO L899 garLoopResultBuilder]: For program point skb_cloneFINAL(lines 6612 6614) no Hoare annotation was computed. [2022-07-14 00:10:57,706 INFO L899 garLoopResultBuilder]: For program point skb_cloneEXIT(lines 6612 6614) no Hoare annotation was computed. [2022-07-14 00:10:57,706 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-07-14 00:10:57,706 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-07-14 00:10:57,706 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-07-14 00:10:57,706 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5624 5626) the Hoare annotation is: true [2022-07-14 00:10:57,706 INFO L899 garLoopResultBuilder]: For program point L5625-2(lines 5624 5626) no Hoare annotation was computed. [2022-07-14 00:10:57,707 INFO L899 garLoopResultBuilder]: For program point L5625(line 5625) no Hoare annotation was computed. [2022-07-14 00:10:57,707 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5624 5626) no Hoare annotation was computed. [2022-07-14 00:10:57,707 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-07-14 00:10:57,707 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeFINAL(lines 6532 6538) no Hoare annotation was computed. [2022-07-14 00:10:57,707 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-07-14 00:10:57,707 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeEXIT(lines 6532 6538) no Hoare annotation was computed. [2022-07-14 00:10:57,707 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 6641 6643) no Hoare annotation was computed. [2022-07-14 00:10:57,708 INFO L902 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 6641 6643) the Hoare annotation is: true [2022-07-14 00:10:57,708 INFO L899 garLoopResultBuilder]: For program point usb_free_urbFINAL(lines 6641 6643) no Hoare annotation was computed. [2022-07-14 00:10:57,708 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-07-14 00:10:57,708 INFO L899 garLoopResultBuilder]: For program point L6031-1(line 6031) no Hoare annotation was computed. [2022-07-14 00:10:57,708 INFO L895 garLoopResultBuilder]: At program point eem_rx_fixupENTRY(lines 5926 6059) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))) [2022-07-14 00:10:57,708 INFO L899 garLoopResultBuilder]: For program point L5833(line 5833) no Hoare annotation was computed. [2022-07-14 00:10:57,708 INFO L899 garLoopResultBuilder]: For program point L6032(line 6032) no Hoare annotation was computed. [2022-07-14 00:10:57,709 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-07-14 00:10:57,709 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-07-14 00:10:57,709 INFO L899 garLoopResultBuilder]: For program point L5951-1(line 5951) no Hoare annotation was computed. [2022-07-14 00:10:57,709 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-07-14 00:10:57,709 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-07-14 00:10:57,709 INFO L899 garLoopResultBuilder]: For program point L6051(line 6051) no Hoare annotation was computed. [2022-07-14 00:10:57,709 INFO L899 garLoopResultBuilder]: For program point L6018(lines 6018 6028) no Hoare annotation was computed. [2022-07-14 00:10:57,709 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-07-14 00:10:57,710 INFO L899 garLoopResultBuilder]: For program point L5985(line 5985) no Hoare annotation was computed. [2022-07-14 00:10:57,710 INFO L899 garLoopResultBuilder]: For program point L5952(lines 5952 6049) no Hoare annotation was computed. [2022-07-14 00:10:57,710 INFO L899 garLoopResultBuilder]: For program point L6018-2(lines 6003 6049) no Hoare annotation was computed. [2022-07-14 00:10:57,710 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-07-14 00:10:57,710 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-07-14 00:10:57,710 INFO L899 garLoopResultBuilder]: For program point L5969-2(line 5969) no Hoare annotation was computed. [2022-07-14 00:10:57,710 INFO L899 garLoopResultBuilder]: For program point L5969(line 5969) no Hoare annotation was computed. [2022-07-14 00:10:57,711 INFO L899 garLoopResultBuilder]: For program point L5969-6(line 5969) no Hoare annotation was computed. [2022-07-14 00:10:57,711 INFO L899 garLoopResultBuilder]: For program point L5969-4(line 5969) no Hoare annotation was computed. [2022-07-14 00:10:57,711 INFO L899 garLoopResultBuilder]: For program point eem_rx_fixupEXIT(lines 5926 6059) no Hoare annotation was computed. [2022-07-14 00:10:57,711 INFO L899 garLoopResultBuilder]: For program point L5969-8(line 5969) no Hoare annotation was computed. [2022-07-14 00:10:57,711 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-07-14 00:10:57,711 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-07-14 00:10:57,711 INFO L899 garLoopResultBuilder]: For program point L5953(lines 5953 5968) no Hoare annotation was computed. [2022-07-14 00:10:57,712 INFO L899 garLoopResultBuilder]: For program point L5986-1(line 5986) no Hoare annotation was computed. [2022-07-14 00:10:57,712 INFO L899 garLoopResultBuilder]: For program point L5970(lines 5970 6001) no Hoare annotation was computed. [2022-07-14 00:10:57,712 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-07-14 00:10:57,712 INFO L899 garLoopResultBuilder]: For program point L6053(lines 6053 6056) no Hoare annotation was computed. [2022-07-14 00:10:57,712 INFO L899 garLoopResultBuilder]: For program point L5971(line 5971) no Hoare annotation was computed. [2022-07-14 00:10:57,712 INFO L899 garLoopResultBuilder]: For program point L6037(lines 6003 6049) no Hoare annotation was computed. [2022-07-14 00:10:57,712 INFO L899 garLoopResultBuilder]: For program point L6004(lines 6004 6007) no Hoare annotation was computed. [2022-07-14 00:10:57,713 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-07-14 00:10:57,713 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-07-14 00:10:57,713 INFO L899 garLoopResultBuilder]: For program point L6021-1(line 6021) no Hoare annotation was computed. [2022-07-14 00:10:57,713 INFO L899 garLoopResultBuilder]: For program point L5823(lines 5823 5826) no Hoare annotation was computed. [2022-07-14 00:10:57,713 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-07-14 00:10:57,713 INFO L899 garLoopResultBuilder]: For program point L5972-2(line 5972) no Hoare annotation was computed. [2022-07-14 00:10:57,713 INFO L899 garLoopResultBuilder]: For program point L5972(line 5972) no Hoare annotation was computed. [2022-07-14 00:10:57,713 INFO L899 garLoopResultBuilder]: For program point L5972-6(line 5972) no Hoare annotation was computed. [2022-07-14 00:10:57,714 INFO L899 garLoopResultBuilder]: For program point L5972-4(line 5972) no Hoare annotation was computed. [2022-07-14 00:10:57,714 INFO L899 garLoopResultBuilder]: For program point L5972-8(line 5972) no Hoare annotation was computed. [2022-07-14 00:10:57,714 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-07-14 00:10:57,714 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-07-14 00:10:57,714 INFO L899 garLoopResultBuilder]: For program point L6633-1(line 6633) no Hoare annotation was computed. [2022-07-14 00:10:57,714 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-07-14 00:10:57,714 INFO L899 garLoopResultBuilder]: For program point L5989(line 5989) no Hoare annotation was computed. [2022-07-14 00:10:57,714 INFO L899 garLoopResultBuilder]: For program point L6022-1(lines 6022 6023) no Hoare annotation was computed. [2022-07-14 00:10:57,715 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-07-14 00:10:57,715 INFO L899 garLoopResultBuilder]: For program point L5973(lines 5973 5976) no Hoare annotation was computed. [2022-07-14 00:10:57,715 INFO L899 garLoopResultBuilder]: For program point eem_rx_fixupFINAL(lines 5926 6059) no Hoare annotation was computed. [2022-07-14 00:10:57,715 INFO L899 garLoopResultBuilder]: For program point L6024(lines 6024 6027) no Hoare annotation was computed. [2022-07-14 00:10:57,715 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-07-14 00:10:57,715 INFO L899 garLoopResultBuilder]: For program point L6008-2(line 6008) no Hoare annotation was computed. [2022-07-14 00:10:57,715 INFO L899 garLoopResultBuilder]: For program point L6008(line 6008) no Hoare annotation was computed. [2022-07-14 00:10:57,715 INFO L899 garLoopResultBuilder]: For program point L6008-6(line 6008) no Hoare annotation was computed. [2022-07-14 00:10:57,716 INFO L899 garLoopResultBuilder]: For program point L6008-4(line 6008) no Hoare annotation was computed. [2022-07-14 00:10:57,716 INFO L899 garLoopResultBuilder]: For program point L6008-8(line 6008) no Hoare annotation was computed. [2022-07-14 00:10:57,716 INFO L899 garLoopResultBuilder]: For program point L5992-2(line 5992) no Hoare annotation was computed. [2022-07-14 00:10:57,716 INFO L899 garLoopResultBuilder]: For program point L5992(line 5992) no Hoare annotation was computed. [2022-07-14 00:10:57,716 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-07-14 00:10:57,716 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-07-14 00:10:57,716 INFO L899 garLoopResultBuilder]: For program point L6009(lines 6009 6012) no Hoare annotation was computed. [2022-07-14 00:10:57,717 INFO L899 garLoopResultBuilder]: For program point L6042-1(line 6042) no Hoare annotation was computed. [2022-07-14 00:10:57,717 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-07-14 00:10:57,717 INFO L899 garLoopResultBuilder]: For program point L5960-1(line 5960) no Hoare annotation was computed. [2022-07-14 00:10:57,717 INFO L899 garLoopResultBuilder]: For program point L5993(line 5993) no Hoare annotation was computed. [2022-07-14 00:10:57,717 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-07-14 00:10:57,717 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-07-14 00:10:57,717 INFO L899 garLoopResultBuilder]: For program point L6043(lines 6043 6048) no Hoare annotation was computed. [2022-07-14 00:10:57,718 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-07-14 00:10:57,718 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-07-14 00:10:57,718 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-07-14 00:10:57,718 INFO L899 garLoopResultBuilder]: For program point L5977-1(line 5977) no Hoare annotation was computed. [2022-07-14 00:10:57,718 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-07-14 00:10:57,718 INFO L899 garLoopResultBuilder]: For program point L5961(lines 5961 5965) no Hoare annotation was computed. [2022-07-14 00:10:57,718 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-07-14 00:10:57,718 INFO L899 garLoopResultBuilder]: For program point L5978-1(lines 5978 5979) no Hoare annotation was computed. [2022-07-14 00:10:57,719 INFO L899 garLoopResultBuilder]: For program point L5995(line 5995) no Hoare annotation was computed. [2022-07-14 00:10:57,719 INFO L899 garLoopResultBuilder]: For program point L5830(lines 5830 5837) no Hoare annotation was computed. [2022-07-14 00:10:57,719 INFO L899 garLoopResultBuilder]: For program point L5995-2(line 5995) no Hoare annotation was computed. [2022-07-14 00:10:57,719 INFO L899 garLoopResultBuilder]: For program point L5946(lines 5946 5949) no Hoare annotation was computed. [2022-07-14 00:10:57,719 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-07-14 00:10:57,719 INFO L899 garLoopResultBuilder]: For program point L5996-2(line 5996) no Hoare annotation was computed. [2022-07-14 00:10:57,719 INFO L895 garLoopResultBuilder]: At program point L6029(lines 6029 6036) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-14 00:10:57,719 INFO L899 garLoopResultBuilder]: For program point L5996(line 5996) no Hoare annotation was computed. [2022-07-14 00:10:57,719 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-07-14 00:10:57,719 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-07-14 00:10:57,719 INFO L899 garLoopResultBuilder]: For program point L6013(lines 6013 6016) no Hoare annotation was computed. [2022-07-14 00:10:57,719 INFO L899 garLoopResultBuilder]: For program point L5980(lines 5980 5983) no Hoare annotation was computed. [2022-07-14 00:10:57,719 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-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point L5997(line 5997) no Hoare annotation was computed. [2022-07-14 00:10:57,720 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-07-14 00:10:57,720 INFO L902 garLoopResultBuilder]: At program point L5639(line 5639) the Hoare annotation is: true [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point L5639-1(line 5639) no Hoare annotation was computed. [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5627 5643) no Hoare annotation was computed. [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point L5634(lines 5634 5641) no Hoare annotation was computed. [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5627 5643) no Hoare annotation was computed. [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point crc32_leEXIT(lines 6597 6599) no Hoare annotation was computed. [2022-07-14 00:10:57,720 INFO L902 garLoopResultBuilder]: At program point crc32_leENTRY(lines 6597 6599) the Hoare annotation is: true [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point crc32_leFINAL(lines 6597 6599) no Hoare annotation was computed. [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point L5656-1(line 5656) no Hoare annotation was computed. [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 5644 5660) no Hoare annotation was computed. [2022-07-14 00:10:57,720 INFO L902 garLoopResultBuilder]: At program point L5656(line 5656) the Hoare annotation is: true [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point L5651(lines 5651 5658) no Hoare annotation was computed. [2022-07-14 00:10:57,720 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-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 5644 5660) no Hoare annotation was computed. [2022-07-14 00:10:57,720 INFO L899 garLoopResultBuilder]: For program point skb_trimEXIT(lines 6629 6631) no Hoare annotation was computed. [2022-07-14 00:10:57,721 INFO L902 garLoopResultBuilder]: At program point skb_trimENTRY(lines 6629 6631) the Hoare annotation is: true [2022-07-14 00:10:57,721 INFO L899 garLoopResultBuilder]: For program point skb_trimFINAL(lines 6629 6631) no Hoare annotation was computed. [2022-07-14 00:10:57,721 INFO L895 garLoopResultBuilder]: At program point L6675(lines 6674 6676) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,721 INFO L899 garLoopResultBuilder]: For program point L6229(lines 6229 6243) no Hoare annotation was computed. [2022-07-14 00:10:57,721 INFO L899 garLoopResultBuilder]: For program point L6279(line 6279) no Hoare annotation was computed. [2022-07-14 00:10:57,721 INFO L902 garLoopResultBuilder]: At program point L6246(line 6246) the Hoare annotation is: true [2022-07-14 00:10:57,721 INFO L899 garLoopResultBuilder]: For program point L6180(lines 6180 6187) no Hoare annotation was computed. [2022-07-14 00:10:57,721 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-14 00:10:57,721 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-07-14 00:10:57,721 INFO L895 garLoopResultBuilder]: At program point L6263(line 6263) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,722 INFO L899 garLoopResultBuilder]: For program point L6263-1(line 6263) no Hoare annotation was computed. [2022-07-14 00:10:57,722 INFO L899 garLoopResultBuilder]: For program point L6280-2(lines 6255 6301) no Hoare annotation was computed. [2022-07-14 00:10:57,722 INFO L899 garLoopResultBuilder]: For program point L6280(lines 6280 6284) no Hoare annotation was computed. [2022-07-14 00:10:57,722 INFO L902 garLoopResultBuilder]: At program point L6313(lines 6123 6315) the Hoare annotation is: true [2022-07-14 00:10:57,722 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-07-14 00:10:57,722 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-07-14 00:10:57,722 INFO L899 garLoopResultBuilder]: For program point L6231(lines 6231 6236) no Hoare annotation was computed. [2022-07-14 00:10:57,722 INFO L899 garLoopResultBuilder]: For program point L6165(line 6165) no Hoare annotation was computed. [2022-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6231-2(lines 6229 6242) no Hoare annotation was computed. [2022-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6182(lines 6182 6185) no Hoare annotation was computed. [2022-07-14 00:10:57,723 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-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6281-1(line 6281) no Hoare annotation was computed. [2022-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6149(lines 6149 6308) no Hoare annotation was computed. [2022-07-14 00:10:57,723 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-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2022-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6166(lines 6166 6171) no Hoare annotation was computed. [2022-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6166-2(lines 6153 6211) no Hoare annotation was computed. [2022-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6150(line 6150) no Hoare annotation was computed. [2022-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6216(line 6216) no Hoare annotation was computed. [2022-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6299(line 6299) no Hoare annotation was computed. [2022-07-14 00:10:57,723 INFO L895 garLoopResultBuilder]: At program point L6167(line 6167) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,723 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-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6167-1(line 6167) no Hoare annotation was computed. [2022-07-14 00:10:57,723 INFO L899 garLoopResultBuilder]: For program point L6200(lines 6200 6207) no Hoare annotation was computed. [2022-07-14 00:10:57,724 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-07-14 00:10:57,724 INFO L899 garLoopResultBuilder]: For program point L6151(lines 6151 6214) no Hoare annotation was computed. [2022-07-14 00:10:57,724 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-07-14 00:10:57,724 INFO L899 garLoopResultBuilder]: For program point L6217(lines 6217 6250) no Hoare annotation was computed. [2022-07-14 00:10:57,724 INFO L899 garLoopResultBuilder]: For program point L6118-1(line 6118) no Hoare annotation was computed. [2022-07-14 00:10:57,724 INFO L902 garLoopResultBuilder]: At program point L6300(line 6300) the Hoare annotation is: true [2022-07-14 00:10:57,724 INFO L895 garLoopResultBuilder]: At program point L6664(lines 6663 6665) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,724 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-14 00:10:57,724 INFO L899 garLoopResultBuilder]: For program point L6202(lines 6202 6205) no Hoare annotation was computed. [2022-07-14 00:10:57,724 INFO L899 garLoopResultBuilder]: For program point L6268(line 6268) no Hoare annotation was computed. [2022-07-14 00:10:57,724 INFO L899 garLoopResultBuilder]: For program point L6136-1(line 6136) no Hoare annotation was computed. [2022-07-14 00:10:57,724 INFO L899 garLoopResultBuilder]: For program point L6582(lines 6582 6585) no Hoare annotation was computed. [2022-07-14 00:10:57,725 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-07-14 00:10:57,725 INFO L899 garLoopResultBuilder]: For program point L6219(lines 6219 6247) no Hoare annotation was computed. [2022-07-14 00:10:57,725 INFO L899 garLoopResultBuilder]: For program point L6252(line 6252) no Hoare annotation was computed. [2022-07-14 00:10:57,725 INFO L899 garLoopResultBuilder]: For program point L6153(lines 6153 6211) no Hoare annotation was computed. [2022-07-14 00:10:57,725 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-07-14 00:10:57,725 INFO L899 garLoopResultBuilder]: For program point L6269(lines 6269 6277) no Hoare annotation was computed. [2022-07-14 00:10:57,725 INFO L895 garLoopResultBuilder]: At program point L6286(line 6286) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,725 INFO L899 garLoopResultBuilder]: For program point L6154(line 6154) no Hoare annotation was computed. [2022-07-14 00:10:57,726 INFO L899 garLoopResultBuilder]: For program point L6253(lines 6253 6304) no Hoare annotation was computed. [2022-07-14 00:10:57,726 INFO L899 garLoopResultBuilder]: For program point L6286-1(line 6286) no Hoare annotation was computed. [2022-07-14 00:10:57,726 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-07-14 00:10:57,726 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-07-14 00:10:57,726 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-07-14 00:10:57,726 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-07-14 00:10:57,726 INFO L902 garLoopResultBuilder]: At program point L6584-1(lines 6577 6588) the Hoare annotation is: true [2022-07-14 00:10:57,726 INFO L899 garLoopResultBuilder]: For program point L6138-1(line 6138) no Hoare annotation was computed. [2022-07-14 00:10:57,727 INFO L895 garLoopResultBuilder]: At program point L6584(line 6584) the Hoare annotation is: false [2022-07-14 00:10:57,727 INFO L899 garLoopResultBuilder]: For program point L6155(lines 6155 6163) no Hoare annotation was computed. [2022-07-14 00:10:57,727 INFO L899 garLoopResultBuilder]: For program point L6221(lines 6221 6226) no Hoare annotation was computed. [2022-07-14 00:10:57,727 INFO L895 garLoopResultBuilder]: At program point L6089(lines 6085 6091) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,727 INFO L895 garLoopResultBuilder]: At program point L6370(lines 6365 6372) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,727 INFO L899 garLoopResultBuilder]: For program point L6271(lines 6271 6275) no Hoare annotation was computed. [2022-07-14 00:10:57,727 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-14 00:10:57,727 INFO L899 garLoopResultBuilder]: For program point L6255(lines 6255 6301) no Hoare annotation was computed. [2022-07-14 00:10:57,728 INFO L895 garLoopResultBuilder]: At program point L6602(lines 6601 6603) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,728 INFO L899 garLoopResultBuilder]: For program point L6189(line 6189) no Hoare annotation was computed. [2022-07-14 00:10:57,728 INFO L895 garLoopResultBuilder]: At program point L6668(lines 6667 6669) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,728 INFO L895 garLoopResultBuilder]: At program point L6470(lines 6467 6472) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|) (= ~last_index~0 0)) [2022-07-14 00:10:57,728 INFO L895 garLoopResultBuilder]: At program point L6239(lines 6135 6314) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,728 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-07-14 00:10:57,728 INFO L899 garLoopResultBuilder]: For program point L6107-1(line 6107) no Hoare annotation was computed. [2022-07-14 00:10:57,728 INFO L895 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,729 INFO L899 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2022-07-14 00:10:57,729 INFO L899 garLoopResultBuilder]: For program point L6190(lines 6190 6197) no Hoare annotation was computed. [2022-07-14 00:10:57,729 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-14 00:10:57,729 INFO L899 garLoopResultBuilder]: For program point L6157(lines 6157 6161) no Hoare annotation was computed. [2022-07-14 00:10:57,729 INFO L895 garLoopResultBuilder]: At program point L6636(lines 6635 6637) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,729 INFO L899 garLoopResultBuilder]: For program point L6306(line 6306) no Hoare annotation was computed. [2022-07-14 00:10:57,729 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-07-14 00:10:57,729 INFO L899 garLoopResultBuilder]: For program point L6141-1(line 6141) no Hoare annotation was computed. [2022-07-14 00:10:57,729 INFO L899 garLoopResultBuilder]: For program point L6257-2(lines 6255 6301) no Hoare annotation was computed. [2022-07-14 00:10:57,730 INFO L899 garLoopResultBuilder]: For program point L6257(lines 6257 6261) no Hoare annotation was computed. [2022-07-14 00:10:57,730 INFO L902 garLoopResultBuilder]: At program point L6307(line 6307) the Hoare annotation is: true [2022-07-14 00:10:57,730 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-07-14 00:10:57,730 INFO L899 garLoopResultBuilder]: For program point L6142-1(line 6142) no Hoare annotation was computed. [2022-07-14 00:10:57,730 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-07-14 00:10:57,730 INFO L899 garLoopResultBuilder]: For program point L6109-1(line 6109) no Hoare annotation was computed. [2022-07-14 00:10:57,730 INFO L899 garLoopResultBuilder]: For program point L6291(line 6291) no Hoare annotation was computed. [2022-07-14 00:10:57,731 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-07-14 00:10:57,731 INFO L899 garLoopResultBuilder]: For program point L6258-1(line 6258) no Hoare annotation was computed. [2022-07-14 00:10:57,731 INFO L899 garLoopResultBuilder]: For program point L6192(lines 6192 6195) no Hoare annotation was computed. [2022-07-14 00:10:57,731 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-14 00:10:57,731 INFO L899 garLoopResultBuilder]: For program point L6209(line 6209) no Hoare annotation was computed. [2022-07-14 00:10:57,731 INFO L899 garLoopResultBuilder]: For program point L6292(lines 6292 6297) no Hoare annotation was computed. [2022-07-14 00:10:57,731 INFO L895 garLoopResultBuilder]: At program point L6606(lines 6605 6607) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,731 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-07-14 00:10:57,731 INFO L902 garLoopResultBuilder]: At program point L6210(line 6210) the Hoare annotation is: true [2022-07-14 00:10:57,732 INFO L895 garLoopResultBuilder]: At program point L6309(lines 6135 6314) the Hoare annotation is: (= ~last_index~0 0) [2022-07-14 00:10:57,732 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-07-14 00:10:57,732 INFO L899 garLoopResultBuilder]: For program point L5848(lines 5848 5854) no Hoare annotation was computed. [2022-07-14 00:10:57,732 INFO L899 garLoopResultBuilder]: For program point L6228(line 6228) no Hoare annotation was computed. [2022-07-14 00:10:57,732 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-07-14 00:10:57,732 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-07-14 00:10:57,732 INFO L899 garLoopResultBuilder]: For program point L6179(line 6179) no Hoare annotation was computed. [2022-07-14 00:10:57,733 INFO L899 garLoopResultBuilder]: For program point L6245(line 6245) no Hoare annotation was computed. [2022-07-14 00:10:57,733 INFO L902 garLoopResultBuilder]: At program point L6590(lines 6589 6591) the Hoare annotation is: true [2022-07-14 00:10:57,733 INFO L902 garLoopResultBuilder]: At program point dev_kfree_skb_anyENTRY(lines 5716 5722) the Hoare annotation is: true [2022-07-14 00:10:57,733 INFO L899 garLoopResultBuilder]: For program point dev_kfree_skb_anyEXIT(lines 5716 5722) no Hoare annotation was computed. [2022-07-14 00:10:57,733 INFO L899 garLoopResultBuilder]: For program point dev_kfree_skb_anyFINAL(lines 5716 5722) no Hoare annotation was computed. [2022-07-14 00:10:57,733 INFO L899 garLoopResultBuilder]: For program point L5568(lines 5568 5572) no Hoare annotation was computed. [2022-07-14 00:10:57,733 INFO L899 garLoopResultBuilder]: For program point eem_tx_fixupEXIT(lines 5860 5925) no Hoare annotation was computed. [2022-07-14 00:10:57,733 INFO L895 garLoopResultBuilder]: At program point L5759(lines 5755 5761) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-14 00:10:57,734 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-07-14 00:10:57,734 INFO L899 garLoopResultBuilder]: For program point L5916-1(line 5916) no Hoare annotation was computed. [2022-07-14 00:10:57,734 INFO L895 garLoopResultBuilder]: At program point L5916(line 5916) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-14 00:10:57,734 INFO L899 garLoopResultBuilder]: For program point L5908-1(line 5908) no Hoare annotation was computed. [2022-07-14 00:10:57,734 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-07-14 00:10:57,734 INFO L895 garLoopResultBuilder]: At program point L5917(line 5917) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-14 00:10:57,734 INFO L899 garLoopResultBuilder]: For program point L5917-1(lines 5875 5924) no Hoare annotation was computed. [2022-07-14 00:10:57,734 INFO L899 garLoopResultBuilder]: For program point L5918(lines 5918 5922) no Hoare annotation was computed. [2022-07-14 00:10:57,735 INFO L899 garLoopResultBuilder]: For program point L5885-2(lines 5885 5902) no Hoare annotation was computed. [2022-07-14 00:10:57,735 INFO L899 garLoopResultBuilder]: For program point L5885(lines 5885 5902) no Hoare annotation was computed. [2022-07-14 00:10:57,735 INFO L902 garLoopResultBuilder]: At program point L5910(lines 5875 5924) the Hoare annotation is: true [2022-07-14 00:10:57,735 INFO L899 garLoopResultBuilder]: For program point L5894(lines 5894 5900) no Hoare annotation was computed. [2022-07-14 00:10:57,735 INFO L895 garLoopResultBuilder]: At program point L5919(line 5919) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-14 00:10:57,735 INFO L899 garLoopResultBuilder]: For program point L5919-1(line 5919) no Hoare annotation was computed. [2022-07-14 00:10:57,735 INFO L902 garLoopResultBuilder]: At program point L5597(lines 5592 5599) the Hoare annotation is: true [2022-07-14 00:10:57,735 INFO L902 garLoopResultBuilder]: At program point L5911(line 5911) the Hoare annotation is: true [2022-07-14 00:10:57,735 INFO L899 garLoopResultBuilder]: For program point L5911-1(line 5911) no Hoare annotation was computed. [2022-07-14 00:10:57,736 INFO L902 garLoopResultBuilder]: At program point L5589(lines 5585 5591) the Hoare annotation is: true [2022-07-14 00:10:57,736 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-07-14 00:10:57,736 INFO L899 garLoopResultBuilder]: For program point L5614(line 5614) no Hoare annotation was computed. [2022-07-14 00:10:57,736 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-07-14 00:10:57,736 INFO L899 garLoopResultBuilder]: For program point L5614-2(line 5614) no Hoare annotation was computed. [2022-07-14 00:10:57,736 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-07-14 00:10:57,736 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-14 00:10:57,737 INFO L895 garLoopResultBuilder]: At program point L5920(line 5920) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-14 00:10:57,737 INFO L899 garLoopResultBuilder]: For program point eem_tx_fixupFINAL(lines 5860 5925) no Hoare annotation was computed. [2022-07-14 00:10:57,737 INFO L902 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: true [2022-07-14 00:10:57,737 INFO L899 garLoopResultBuilder]: For program point L5565(lines 5565 5575) no Hoare annotation was computed. [2022-07-14 00:10:57,737 INFO L899 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2022-07-14 00:10:57,737 INFO L899 garLoopResultBuilder]: For program point L5565-1(lines 5565 5575) no Hoare annotation was computed. [2022-07-14 00:10:57,737 INFO L895 garLoopResultBuilder]: At program point L5912-2(line 5912) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-14 00:10:57,737 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-07-14 00:10:57,738 INFO L899 garLoopResultBuilder]: For program point L5912(line 5912) no Hoare annotation was computed. [2022-07-14 00:10:57,738 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-07-14 00:10:57,738 INFO L899 garLoopResultBuilder]: For program point L5904(lines 5904 5907) no Hoare annotation was computed. [2022-07-14 00:10:57,738 INFO L899 garLoopResultBuilder]: For program point L5880-2(lines 5880 5883) no Hoare annotation was computed. [2022-07-14 00:10:57,738 INFO L899 garLoopResultBuilder]: For program point L5913(line 5913) no Hoare annotation was computed. [2022-07-14 00:10:57,738 INFO L899 garLoopResultBuilder]: For program point L5880(lines 5880 5883) no Hoare annotation was computed. [2022-07-14 00:10:57,738 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-07-14 00:10:57,738 INFO L899 garLoopResultBuilder]: For program point L6616-1(line 6616) no Hoare annotation was computed. [2022-07-14 00:10:57,739 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-07-14 00:10:57,739 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-07-14 00:10:57,739 INFO L899 garLoopResultBuilder]: For program point L5890(lines 5890 5893) no Hoare annotation was computed. [2022-07-14 00:10:57,741 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-14 00:10:57,743 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 00:10:57,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:57,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:57,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 12:10:57 BoogieIcfgContainer [2022-07-14 00:10:57,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 00:10:57,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 00:10:57,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 00:10:57,780 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 00:10:57,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:10:32" (3/4) ... [2022-07-14 00:10:57,783 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-14 00:10:57,789 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usbnet_disconnect [2022-07-14 00:10:57,789 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure put_unaligned_le16 [2022-07-14 00:10:57,789 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_push [2022-07-14 00:10:57,789 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_set_remove [2022-07-14 00:10:57,790 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2022-07-14 00:10:57,790 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_clone [2022-07-14 00:10:57,790 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-14 00:10:57,790 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free [2022-07-14 00:10:57,790 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-07-14 00:10:57,790 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_put [2022-07-14 00:10:57,790 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eem_rx_fixup [2022-07-14 00:10:57,790 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-14 00:10:57,790 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-07-14 00:10:57,791 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure crc32_le [2022-07-14 00:10:57,791 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_pull [2022-07-14 00:10:57,791 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-07-14 00:10:57,791 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-07-14 00:10:57,791 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_trim [2022-07-14 00:10:57,791 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_kfree_skb_any [2022-07-14 00:10:57,792 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eem_tx_fixup [2022-07-14 00:10:57,792 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2022-07-14 00:10:57,825 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 141 nodes and edges [2022-07-14 00:10:57,827 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2022-07-14 00:10:57,829 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-14 00:10:57,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-14 00:10:57,835 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-14 00:10:57,866 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,866 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-07-14 00:10:57,869 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1 <= \result && last_index == 0 [2022-07-14 00:10:57,870 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,873 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,873 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,876 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,876 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,877 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-07-14 00:10:57,877 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) [2022-07-14 00:10:57,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,879 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,880 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,880 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,880 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,880 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,881 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-07-14 00:10:57,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,881 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-07-14 00:10:57,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-14 00:10:57,882 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-07-14 00:10:57,882 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-07-14 00:10:57,882 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-07-14 00:10:57,882 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-07-14 00:10:58,007 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 00:10:58,007 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 00:10:58,008 INFO L158 Benchmark]: Toolchain (without parser) took 29107.26ms. Allocated memory was 92.3MB in the beginning and 362.8MB in the end (delta: 270.5MB). Free memory was 50.9MB in the beginning and 287.5MB in the end (delta: -236.6MB). Peak memory consumption was 194.3MB. Max. memory is 16.1GB. [2022-07-14 00:10:58,008 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 92.3MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 00:10:58,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1358.80ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 50.6MB in the beginning and 54.6MB in the end (delta: -4.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2022-07-14 00:10:58,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.68ms. Allocated memory is still 111.1MB. Free memory was 54.6MB in the beginning and 47.1MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 00:10:58,009 INFO L158 Benchmark]: Boogie Preprocessor took 149.11ms. Allocated memory is still 111.1MB. Free memory was 47.1MB in the beginning and 59.8MB in the end (delta: -12.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2022-07-14 00:10:58,010 INFO L158 Benchmark]: RCFGBuilder took 1896.41ms. Allocated memory was 111.1MB in the beginning and 195.0MB in the end (delta: 83.9MB). Free memory was 59.8MB in the beginning and 121.6MB in the end (delta: -61.8MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2022-07-14 00:10:58,010 INFO L158 Benchmark]: TraceAbstraction took 25327.98ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 120.5MB in the beginning and 70.5MB in the end (delta: 50.0MB). Peak memory consumption was 168.6MB. Max. memory is 16.1GB. [2022-07-14 00:10:58,011 INFO L158 Benchmark]: Witness Printer took 228.05ms. Allocated memory was 302.0MB in the beginning and 362.8MB in the end (delta: 60.8MB). Free memory was 70.5MB in the beginning and 287.5MB in the end (delta: -217.0MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2022-07-14 00:10:58,013 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.29ms. Allocated memory is still 92.3MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1358.80ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 50.6MB in the beginning and 54.6MB in the end (delta: -4.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.68ms. Allocated memory is still 111.1MB. Free memory was 54.6MB in the beginning and 47.1MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 149.11ms. Allocated memory is still 111.1MB. Free memory was 47.1MB in the beginning and 59.8MB in the end (delta: -12.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1896.41ms. Allocated memory was 111.1MB in the beginning and 195.0MB in the end (delta: 83.9MB). Free memory was 59.8MB in the beginning and 121.6MB in the end (delta: -61.8MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * TraceAbstraction took 25327.98ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 120.5MB in the beginning and 70.5MB in the end (delta: 50.0MB). Peak memory consumption was 168.6MB. Max. memory is 16.1GB. * Witness Printer took 228.05ms. Allocated memory was 302.0MB in the beginning and 362.8MB in the end (delta: 60.8MB). Free memory was 70.5MB in the beginning and 287.5MB in the end (delta: -217.0MB). Peak memory consumption was 4.3MB. 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, 332 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4857 SdHoareTripleChecker+Valid, 16.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4682 mSDsluCounter, 8612 SdHoareTripleChecker+Invalid, 15.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6253 mSDsCounter, 1566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3970 IncrementalHoareTripleChecker+Invalid, 5536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1566 mSolverCounterUnsat, 2359 mSDtfsCounter, 3970 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=2564occurred 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.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 1765 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 130 LocationsWithAnnotation, 3362 PreInvPairs, 4034 NumberOfFragments, 1017 HoareAnnotationTreeSize, 3362 FomulaSimplifications, 45204 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 130 FomulaSimplificationsInter, 47346 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 804 ConstructedInterpolants, 0 QuantifiedInterpolants, 1891 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-07-14 00:10:58,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,042 WARN L418 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-07-14 00:10:58,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(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: 1 <= \result && 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-07-14 00:10:58,058 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,058 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,058 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,058 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,061 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,061 WARN L418 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-07-14 00:10:58,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,068 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,068 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,068 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,068 WARN L418 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-07-14 00:10:58,069 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,069 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,069 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,069 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,070 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,070 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,070 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,070 WARN L418 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-07-14 00:10:58,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,073 WARN L418 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-07-14 00:10:58,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,075 WARN L418 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-07-14 00:10:58,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,078 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,078 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,078 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-14 00:10:58,078 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-14 00:10:58,078 WARN L418 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-07-14 00:10:58,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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