./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.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 6b3de547936c1646f60b80d97a1625774e2d4a48db257d02bb1b2f3a0d43e91e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:55:36,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:55:36,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:55:36,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:55:36,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:55:36,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:55:36,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:55:36,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:55:36,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:55:36,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:55:36,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:55:36,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:55:36,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:55:36,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:55:36,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:55:36,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:55:36,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:55:36,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:55:36,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:55:36,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:55:36,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:55:36,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:55:36,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:55:36,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:55:36,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:55:36,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:55:36,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:55:36,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:55:36,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:55:36,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:55:36,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:55:36,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:55:36,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:55:36,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:55:36,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:55:36,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:55:36,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:55:36,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:55:36,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:55:36,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:55:36,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:55:36,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:55:36,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:55:36,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:55:36,849 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:55:36,849 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:55:36,849 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:55:36,850 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:55:36,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:55:36,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:55:36,850 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:55:36,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:55:36,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:55:36,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:55:36,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:55:36,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:55:36,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:55:36,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:55:36,852 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:55:36,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:55:36,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:55:36,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:55:36,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:55:36,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:55:36,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:55:36,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:55:36,853 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:55:36,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:55:36,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:55:36,855 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:55:36,855 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:55:36,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:55:36,855 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 -> 6b3de547936c1646f60b80d97a1625774e2d4a48db257d02bb1b2f3a0d43e91e [2022-02-20 21:55:37,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:55:37,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:55:37,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:55:37,053 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:55:37,053 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:55:37,054 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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-02-20 21:55:37,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffcac802/54ac4449e00d470f8dafbf2f61b47296/FLAG42e788593 [2022-02-20 21:55:37,651 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:55:37,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-02-20 21:55:37,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffcac802/54ac4449e00d470f8dafbf2f61b47296/FLAG42e788593 [2022-02-20 21:55:38,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffcac802/54ac4449e00d470f8dafbf2f61b47296 [2022-02-20 21:55:38,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:55:38,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:55:38,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:55:38,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:55:38,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:55:38,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:55:38" (1/1) ... [2022-02-20 21:55:38,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@490ff984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:38, skipping insertion in model container [2022-02-20 21:55:38,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:55:38" (1/1) ... [2022-02-20 21:55:38,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:55:38,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:55:38,802 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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i[154748,154761] [2022-02-20 21:55:39,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:55:39,231 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:55:39,319 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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i[154748,154761] [2022-02-20 21:55:39,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:55:39,518 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:55:39,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39 WrapperNode [2022-02-20 21:55:39,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:55:39,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:55:39,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:55:39,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:55:39,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (1/1) ... [2022-02-20 21:55:39,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (1/1) ... [2022-02-20 21:55:39,721 INFO L137 Inliner]: procedures = 174, calls = 1111, calls flagged for inlining = 78, calls inlined = 75, statements flattened = 3508 [2022-02-20 21:55:39,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:55:39,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:55:39,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:55:39,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:55:39,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (1/1) ... [2022-02-20 21:55:39,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (1/1) ... [2022-02-20 21:55:39,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (1/1) ... [2022-02-20 21:55:39,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (1/1) ... [2022-02-20 21:55:39,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (1/1) ... [2022-02-20 21:55:39,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (1/1) ... [2022-02-20 21:55:39,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (1/1) ... [2022-02-20 21:55:39,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:55:39,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:55:39,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:55:39,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:55:39,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (1/1) ... [2022-02-20 21:55:39,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:55:39,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:55:39,953 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-02-20 21:55:39,971 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-02-20 21:55:39,981 INFO L130 BoogieDeclarations]: Found specification of procedure dlci_to_q922 [2022-02-20 21:55:39,982 INFO L138 BoogieDeclarations]: Found implementation of procedure dlci_to_q922 [2022-02-20 21:55:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:55:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:55:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:55:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:55:39,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:55:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure dev_queue_xmit [2022-02-20 21:55:39,983 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_queue_xmit [2022-02-20 21:55:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:55:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure state [2022-02-20 21:55:39,983 INFO L138 BoogieDeclarations]: Found implementation of procedure state [2022-02-20 21:55:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure fr_hard_header [2022-02-20 21:55:39,983 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_hard_header [2022-02-20 21:55:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure find_pvc [2022-02-20 21:55:39,984 INFO L138 BoogieDeclarations]: Found implementation of procedure find_pvc [2022-02-20 21:55:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-02-20 21:55:39,984 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-02-20 21:55:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-02-20 21:55:39,984 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-02-20 21:55:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:55:39,984 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:55:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-02-20 21:55:39,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-02-20 21:55:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-02-20 21:55:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-02-20 21:55:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_carrier [2022-02-20 21:55:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_carrier [2022-02-20 21:55:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:55:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:55:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_disconnect_2 [2022-02-20 21:55:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_disconnect_2 [2022-02-20 21:55:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2022-02-20 21:55:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2022-02-20 21:55:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:55:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:55:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:55:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:55:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure fr_rx [2022-02-20 21:55:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_rx [2022-02-20 21:55:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_ioctl [2022-02-20 21:55:39,987 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_ioctl [2022-02-20 21:55:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:55:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-02-20 21:55:39,987 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-02-20 21:55:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:55:39,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:55:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure fr_ioctl [2022-02-20 21:55:39,987 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_ioctl [2022-02-20 21:55:39,988 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-02-20 21:55:39,988 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-02-20 21:55:39,988 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-02-20 21:55:39,988 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-02-20 21:55:39,988 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-02-20 21:55:39,988 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-02-20 21:55:39,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:55:39,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:55:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_netdev_mqs [2022-02-20 21:55:39,990 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_netdev_mqs [2022-02-20 21:55:39,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 21:55:39,990 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 21:55:39,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:55:39,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:55:39,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:55:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_change_mtu [2022-02-20 21:55:39,991 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_change_mtu [2022-02-20 21:55:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-02-20 21:55:39,991 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-02-20 21:55:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-02-20 21:55:39,991 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-02-20 21:55:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure fr_log_dlci_active [2022-02-20 21:55:39,991 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_log_dlci_active [2022-02-20 21:55:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:55:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:55:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:55:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure delete_unused_pvcs [2022-02-20 21:55:39,992 INFO L138 BoogieDeclarations]: Found implementation of procedure delete_unused_pvcs [2022-02-20 21:55:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-02-20 21:55:39,992 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-02-20 21:55:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-02-20 21:55:39,993 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-02-20 21:55:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_is_used [2022-02-20 21:55:39,993 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_is_used [2022-02-20 21:55:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:55:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:55:39,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:55:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-02-20 21:55:39,993 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-02-20 21:55:39,994 INFO L130 BoogieDeclarations]: Found specification of procedure fr_set_link_state [2022-02-20 21:55:39,994 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_set_link_state [2022-02-20 21:55:39,994 INFO L130 BoogieDeclarations]: Found specification of procedure fr_lmi_send [2022-02-20 21:55:39,994 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_lmi_send [2022-02-20 21:55:39,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:55:39,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:55:39,995 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-02-20 21:55:39,995 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-02-20 21:55:39,995 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-02-20 21:55:39,995 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-02-20 21:55:39,995 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 21:55:39,996 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 21:55:39,996 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-02-20 21:55:39,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-02-20 21:55:39,996 INFO L130 BoogieDeclarations]: Found specification of procedure get_dev_p [2022-02-20 21:55:39,996 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dev_p [2022-02-20 21:55:39,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:55:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure linkwatch_fire_event [2022-02-20 21:55:39,997 INFO L138 BoogieDeclarations]: Found implementation of procedure linkwatch_fire_event [2022-02-20 21:55:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure add_pvc [2022-02-20 21:55:39,997 INFO L138 BoogieDeclarations]: Found implementation of procedure add_pvc [2022-02-20 21:55:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdevice [2022-02-20 21:55:39,997 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdevice [2022-02-20 21:55:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:55:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:55:39,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:55:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-02-20 21:55:39,998 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-02-20 21:55:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:55:39,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:55:40,478 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:55:40,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:55:40,680 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:55:42,842 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:55:42,859 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:55:42,859 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:55:42,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:55:42 BoogieIcfgContainer [2022-02-20 21:55:42,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:55:42,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:55:42,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:55:42,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:55:42,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:55:38" (1/3) ... [2022-02-20 21:55:42,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2809f115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:55:42, skipping insertion in model container [2022-02-20 21:55:42,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:39" (2/3) ... [2022-02-20 21:55:42,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2809f115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:55:42, skipping insertion in model container [2022-02-20 21:55:42,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:55:42" (3/3) ... [2022-02-20 21:55:42,874 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-02-20 21:55:42,878 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:55:42,878 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:55:42,923 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:55:42,927 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 21:55:42,928 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:55:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 1162 states, 845 states have (on average 1.3775147928994083) internal successors, (1164), 861 states have internal predecessors, (1164), 265 states have call successors, (265), 51 states have call predecessors, (265), 50 states have return successors, (261), 260 states have call predecessors, (261), 261 states have call successors, (261) [2022-02-20 21:55:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 21:55:42,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:42,969 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 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-02-20 21:55:42,969 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash 16503480, now seen corresponding path program 1 times [2022-02-20 21:55:42,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:42,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226298506] [2022-02-20 21:55:42,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {1165#true} is VALID [2022-02-20 21:55:43,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {1165#true} is VALID [2022-02-20 21:55:43,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-02-20 21:55:43,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #2977#return; {1165#true} is VALID [2022-02-20 21:55:43,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:55:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {1165#true} is VALID [2022-02-20 21:55:43,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {1165#true} is VALID [2022-02-20 21:55:43,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-02-20 21:55:43,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #2979#return; {1165#true} is VALID [2022-02-20 21:55:43,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:55:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {1165#true} is VALID [2022-02-20 21:55:43,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {1165#true} is VALID [2022-02-20 21:55:43,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-02-20 21:55:43,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #2981#return; {1165#true} is VALID [2022-02-20 21:55:43,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:55:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {1165#true} is VALID [2022-02-20 21:55:43,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {1165#true} is VALID [2022-02-20 21:55:43,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-02-20 21:55:43,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #2983#return; {1165#true} is VALID [2022-02-20 21:55:43,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {1165#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(102, 2);call #Ultimate.allocInit(23, 3);call #Ultimate.allocInit(23, 4);call #Ultimate.allocInit(1, 5);call write~init~int(0, 5, 0, 1);call #Ultimate.allocInit(2, 6);call write~init~int(32, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(1, 7);call write~init~int(0, 7, 0, 1);call #Ultimate.allocInit(1, 8);call write~init~int(0, 8, 0, 1);call #Ultimate.allocInit(5, 9);call write~init~int(32, 9, 0, 1);call write~init~int(110, 9, 1, 1);call write~init~int(101, 9, 2, 1);call write~init~int(119, 9, 3, 1);call write~init~int(0, 9, 4, 1);call #Ultimate.allocInit(1, 10);call write~init~int(0, 10, 0, 1);call #Ultimate.allocInit(7, 11);call write~init~int(97, 11, 0, 1);call write~init~int(99, 11, 1, 1);call write~init~int(116, 11, 2, 1);call write~init~int(105, 11, 3, 1);call write~init~int(118, 11, 4, 1);call write~init~int(101, 11, 5, 1);call write~init~int(0, 11, 6, 1);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(8, 13);call #Ultimate.allocInit(45, 14);call #Ultimate.allocInit(33, 15);call #Ultimate.allocInit(30, 16);call #Ultimate.allocInit(17, 17);call #Ultimate.allocInit(1, 18);call write~init~int(0, 18, 0, 1);call #Ultimate.allocInit(3, 19);call write~init~int(117, 19, 0, 1);call write~init~int(110, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(38, 21);call #Ultimate.allocInit(37, 22);call #Ultimate.allocInit(35, 23);call #Ultimate.allocInit(48, 24);call #Ultimate.allocInit(36, 25);call #Ultimate.allocInit(40, 26);call #Ultimate.allocInit(38, 27);call #Ultimate.allocInit(52, 28);call #Ultimate.allocInit(56, 29);call #Ultimate.allocInit(35, 30);call #Ultimate.allocInit(39, 31);call #Ultimate.allocInit(33, 32);call #Ultimate.allocInit(37, 33);call #Ultimate.allocInit(42, 34);call #Ultimate.allocInit(32, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(6, 37);call write~init~int(112, 37, 0, 1);call write~init~int(118, 37, 1, 1);call write~init~int(99, 37, 2, 1);call write~init~int(37, 37, 3, 1);call write~init~int(100, 37, 4, 1);call write~init~int(0, 37, 5, 1);call #Ultimate.allocInit(28, 38);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_0~0 := 0;~ldv_state_variable_3~0 := 0;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~pvc_ops_group1~0.base, ~pvc_ops_group1~0.offset := 0, 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~#pvc_ops~0.base, ~#pvc_ops~0.offset := 39, 0;call #Ultimate.allocInit(480, 39);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 8 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_open.base, #funAddr~pvc_open.offset, ~#pvc_ops~0.base, 16 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_close.base, #funAddr~pvc_close.offset, ~#pvc_ops~0.base, 24 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_xmit.base, #funAddr~pvc_xmit.offset, ~#pvc_ops~0.base, 32 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 40 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 48 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 56 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 64 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 72 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_ioctl.base, #funAddr~pvc_ioctl.offset, ~#pvc_ops~0.base, 80 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 88 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~hdlc_change_mtu.base, #funAddr~hdlc_change_mtu.offset, ~#pvc_ops~0.base, 96 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 104 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 112 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 120 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 128 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 136 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 144 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 152 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 160 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 168 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 176 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 184 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 192 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 200 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 208 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 216 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 224 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 232 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 240 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 248 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 256 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 264 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 272 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 280 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 288 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 296 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 304 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 312 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 320 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 328 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 336 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 344 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 352 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 360 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 368 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 376 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 384 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 392 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 400 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 408 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 416 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 424 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 432 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 440 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 448 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 456 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 464 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 472 + ~#pvc_ops~0.offset, 8);~#proto~0.base, ~#proto~0.offset := 40, 0;call #Ultimate.allocInit(88, 40);call write~init~$Pointer$(0, 0, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_close.base, #funAddr~fr_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_start.base, #funAddr~fr_start.offset, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_stop.base, #funAddr~fr_stop.offset, ~#proto~0.base, 24 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_destroy.base, #funAddr~fr_destroy.offset, ~#proto~0.base, 32 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_ioctl.base, #funAddr~fr_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_rx.base, #funAddr~fr_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 64 + ~#proto~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#proto~0.base, 72 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 80 + ~#proto~0.offset, 8);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 41, 0;call #Ultimate.allocInit(120, 41);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {1165#true} is VALID [2022-02-20 21:55:43,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet735#1, main_#t~ret736#1.base, main_#t~ret736#1.offset, main_#t~ret737#1.base, main_#t~ret737#1.offset, main_#t~nondet738#1, main_#t~ret739#1.base, main_#t~ret739#1.offset, main_#t~ret740#1.base, main_#t~ret740#1.offset, main_#t~nondet741#1, main_#t~switch742#1, main_#t~nondet743#1, main_#t~switch744#1, main_#t~ret745#1, main_#t~nondet746#1, main_#t~switch747#1, main_#t~ret748#1, main_#t~ret749#1, main_#t~ret750#1, main_#t~ret751#1, main_#t~ret752#1, main_#t~ret753#1, main_#t~ret754#1, main_#t~ret755#1, main_#t~ret756#1, main_#t~ret757#1, main_#t~nondet758#1, main_#t~switch759#1, main_#t~ret760#1, main_#t~ret761#1, main_#t~ret762#1, main_#t~ret763#1, main_#t~ret764#1, main_#t~ret765#1, main_#t~ret766#1, main_#t~ret767#1, main_#t~ret768#1, main_#t~ret769#1, main_#t~ret770#1, main_#t~ret771#1, main_#t~ret772#1, main_#t~ret773#1, main_#t~ret774#1, main_~ldvarg1~0#1, main_~tmp~37#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset, main_~ldvarg2~0#1, main_~tmp___2~14#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset, main_~tmp___5~8#1, main_~tmp___6~7#1, main_~tmp___7~6#1, main_~tmp___8~5#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~37#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___2~14#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset;havoc main_~tmp___5~8#1;havoc main_~tmp___6~7#1;havoc main_~tmp___7~6#1;havoc main_~tmp___8~5#1;assume -2147483648 <= main_#t~nondet735#1 && main_#t~nondet735#1 <= 2147483647;main_~tmp~37#1 := main_#t~nondet735#1;havoc main_#t~nondet735#1;main_~ldvarg1~0#1 := main_~tmp~37#1; {1165#true} is VALID [2022-02-20 21:55:43,339 INFO L272 TraceCheckUtils]: 2: Hoare triple {1165#true} call main_#t~ret736#1.base, main_#t~ret736#1.offset := ldv_zalloc(40); {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {1165#true} is VALID [2022-02-20 21:55:43,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {1165#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {1165#true} is VALID [2022-02-20 21:55:43,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-02-20 21:55:43,339 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1165#true} {1165#true} #2977#return; {1165#true} is VALID [2022-02-20 21:55:43,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {1165#true} main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset := main_#t~ret736#1.base, main_#t~ret736#1.offset;havoc main_#t~ret736#1.base, main_#t~ret736#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset; {1165#true} is VALID [2022-02-20 21:55:43,340 INFO L272 TraceCheckUtils]: 8: Hoare triple {1165#true} call main_#t~ret737#1.base, main_#t~ret737#1.offset := ldv_zalloc(232); {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {1165#true} is VALID [2022-02-20 21:55:43,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {1165#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {1165#true} is VALID [2022-02-20 21:55:43,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-02-20 21:55:43,341 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1165#true} {1165#true} #2979#return; {1165#true} is VALID [2022-02-20 21:55:43,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {1165#true} main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset := main_#t~ret737#1.base, main_#t~ret737#1.offset;havoc main_#t~ret737#1.base, main_#t~ret737#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset;assume -2147483648 <= main_#t~nondet738#1 && main_#t~nondet738#1 <= 2147483647;main_~tmp___2~14#1 := main_#t~nondet738#1;havoc main_#t~nondet738#1;main_~ldvarg2~0#1 := main_~tmp___2~14#1; {1165#true} is VALID [2022-02-20 21:55:43,342 INFO L272 TraceCheckUtils]: 14: Hoare triple {1165#true} call main_#t~ret739#1.base, main_#t~ret739#1.offset := ldv_zalloc(232); {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {1165#true} is VALID [2022-02-20 21:55:43,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {1165#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {1165#true} is VALID [2022-02-20 21:55:43,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-02-20 21:55:43,342 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1165#true} {1165#true} #2981#return; {1165#true} is VALID [2022-02-20 21:55:43,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#true} main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset := main_#t~ret739#1.base, main_#t~ret739#1.offset;havoc main_#t~ret739#1.base, main_#t~ret739#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset; {1165#true} is VALID [2022-02-20 21:55:43,343 INFO L272 TraceCheckUtils]: 20: Hoare triple {1165#true} call main_#t~ret740#1.base, main_#t~ret740#1.offset := ldv_zalloc(40); {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {1184#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {1165#true} is VALID [2022-02-20 21:55:43,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {1165#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {1165#true} is VALID [2022-02-20 21:55:43,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-02-20 21:55:43,344 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1165#true} {1165#true} #2983#return; {1165#true} is VALID [2022-02-20 21:55:43,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#true} main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset := main_#t~ret740#1.base, main_#t~ret740#1.offset;havoc main_#t~ret740#1.base, main_#t~ret740#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {1165#true} is VALID [2022-02-20 21:55:43,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#true} assume { :end_inline_ldv_set_init } true; {1165#true} is VALID [2022-02-20 21:55:43,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {1165#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {1183#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:43,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {1183#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet741#1 && main_#t~nondet741#1 <= 2147483647;main_~tmp___5~8#1 := main_#t~nondet741#1;havoc main_#t~nondet741#1;main_#t~switch742#1 := 0 == main_~tmp___5~8#1; {1183#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:43,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {1183#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch742#1;main_#t~switch742#1 := main_#t~switch742#1 || 1 == main_~tmp___5~8#1; {1183#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:43,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {1183#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch742#1; {1183#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:43,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {1183#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet743#1 && main_#t~nondet743#1 <= 2147483647;main_~tmp___6~7#1 := main_#t~nondet743#1;havoc main_#t~nondet743#1;main_#t~switch744#1 := 0 == main_~tmp___6~7#1; {1183#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:43,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {1183#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch744#1; {1183#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:43,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {1183#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_mod_exit } true;assume { :begin_inline_unregister_hdlc_protocol } true;unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset;unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset := unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset; {1166#false} is VALID [2022-02-20 21:55:43,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {1166#false} assume { :end_inline_unregister_hdlc_protocol } true; {1166#false} is VALID [2022-02-20 21:55:43,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {1166#false} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {1166#false} is VALID [2022-02-20 21:55:43,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {1166#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret787#1, ldv_check_final_state_~tmp___7~12#1;havoc ldv_check_final_state_~tmp___7~12#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {1166#false} is VALID [2022-02-20 21:55:43,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {1166#false} ldv_check_final_state_#t~ret787#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret787#1 && ldv_check_final_state_#t~ret787#1 <= 2147483647;ldv_check_final_state_~tmp___7~12#1 := ldv_check_final_state_#t~ret787#1;havoc ldv_check_final_state_#t~ret787#1; {1166#false} is VALID [2022-02-20 21:55:43,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {1166#false} assume !(0 != ldv_check_final_state_~tmp___7~12#1); {1166#false} is VALID [2022-02-20 21:55:43,349 INFO L272 TraceCheckUtils]: 39: Hoare triple {1166#false} call ldv_error(); {1166#false} is VALID [2022-02-20 21:55:43,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-02-20 21:55:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 21:55:43,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:43,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226298506] [2022-02-20 21:55:43,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226298506] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:43,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:43,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:55:43,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073881245] [2022-02-20 21:55:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:43,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 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 41 [2022-02-20 21:55:43,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:43,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:55:43,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:43,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:55:43,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:43,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:55:43,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:55:43,409 INFO L87 Difference]: Start difference. First operand has 1162 states, 845 states have (on average 1.3775147928994083) internal successors, (1164), 861 states have internal predecessors, (1164), 265 states have call successors, (265), 51 states have call predecessors, (265), 50 states have return successors, (261), 260 states have call predecessors, (261), 261 states have call successors, (261) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:55:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:53,038 INFO L93 Difference]: Finished difference Result 3724 states and 5603 transitions. [2022-02-20 21:55:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:55:53,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 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 41 [2022-02-20 21:55:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:55:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5603 transitions. [2022-02-20 21:55:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:55:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5603 transitions. [2022-02-20 21:55:53,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 5603 transitions. [2022-02-20 21:55:57,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5603 edges. 5603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:57,782 INFO L225 Difference]: With dead ends: 3724 [2022-02-20 21:55:57,782 INFO L226 Difference]: Without dead ends: 2551 [2022-02-20 21:55:57,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:55:57,807 INFO L933 BasicCegarLoop]: 1888 mSDtfsCounter, 2215 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2436 SdHoareTripleChecker+Valid, 3790 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 752 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:57,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2436 Valid, 3790 Invalid, 2244 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [752 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-02-20 21:55:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2022-02-20 21:55:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2273. [2022-02-20 21:55:57,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:57,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2551 states. Second operand has 2273 states, 1659 states have (on average 1.3664858348402653) internal successors, (2267), 1679 states have internal predecessors, (2267), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-02-20 21:55:57,979 INFO L74 IsIncluded]: Start isIncluded. First operand 2551 states. Second operand has 2273 states, 1659 states have (on average 1.3664858348402653) internal successors, (2267), 1679 states have internal predecessors, (2267), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-02-20 21:55:57,984 INFO L87 Difference]: Start difference. First operand 2551 states. Second operand has 2273 states, 1659 states have (on average 1.3664858348402653) internal successors, (2267), 1679 states have internal predecessors, (2267), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-02-20 21:55:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:58,206 INFO L93 Difference]: Finished difference Result 2551 states and 3756 transitions. [2022-02-20 21:55:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3756 transitions. [2022-02-20 21:55:58,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:58,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:58,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 2273 states, 1659 states have (on average 1.3664858348402653) internal successors, (2267), 1679 states have internal predecessors, (2267), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) Second operand 2551 states. [2022-02-20 21:55:58,235 INFO L87 Difference]: Start difference. First operand has 2273 states, 1659 states have (on average 1.3664858348402653) internal successors, (2267), 1679 states have internal predecessors, (2267), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) Second operand 2551 states. [2022-02-20 21:55:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:58,461 INFO L93 Difference]: Finished difference Result 2551 states and 3756 transitions. [2022-02-20 21:55:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3756 transitions. [2022-02-20 21:55:58,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:58,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:58,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:58,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2273 states, 1659 states have (on average 1.3664858348402653) internal successors, (2267), 1679 states have internal predecessors, (2267), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-02-20 21:55:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 3296 transitions. [2022-02-20 21:55:58,766 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 3296 transitions. Word has length 41 [2022-02-20 21:55:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:58,767 INFO L470 AbstractCegarLoop]: Abstraction has 2273 states and 3296 transitions. [2022-02-20 21:55:58,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:55:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 3296 transitions. [2022-02-20 21:55:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 21:55:58,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:58,769 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-20 21:55:58,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:55:58,769 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:58,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:58,770 INFO L85 PathProgramCache]: Analyzing trace with hash 202884705, now seen corresponding path program 1 times [2022-02-20 21:55:58,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:58,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119424874] [2022-02-20 21:55:58,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:58,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:58,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {14445#true} is VALID [2022-02-20 21:55:58,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {14445#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {14445#true} is VALID [2022-02-20 21:55:58,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {14445#true} assume true; {14445#true} is VALID [2022-02-20 21:55:58,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14445#true} {14445#true} #2977#return; {14445#true} is VALID [2022-02-20 21:55:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:55:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:58,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {14445#true} is VALID [2022-02-20 21:55:58,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {14445#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {14445#true} is VALID [2022-02-20 21:55:58,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {14445#true} assume true; {14445#true} is VALID [2022-02-20 21:55:58,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14445#true} {14445#true} #2979#return; {14445#true} is VALID [2022-02-20 21:55:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:55:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:58,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {14445#true} is VALID [2022-02-20 21:55:58,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {14445#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {14445#true} is VALID [2022-02-20 21:55:58,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {14445#true} assume true; {14445#true} is VALID [2022-02-20 21:55:58,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14445#true} {14445#true} #2981#return; {14445#true} is VALID [2022-02-20 21:55:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:55:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:58,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {14445#true} is VALID [2022-02-20 21:55:58,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {14445#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {14445#true} is VALID [2022-02-20 21:55:58,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {14445#true} assume true; {14445#true} is VALID [2022-02-20 21:55:58,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14445#true} {14445#true} #2983#return; {14445#true} is VALID [2022-02-20 21:55:58,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {14445#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(102, 2);call #Ultimate.allocInit(23, 3);call #Ultimate.allocInit(23, 4);call #Ultimate.allocInit(1, 5);call write~init~int(0, 5, 0, 1);call #Ultimate.allocInit(2, 6);call write~init~int(32, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(1, 7);call write~init~int(0, 7, 0, 1);call #Ultimate.allocInit(1, 8);call write~init~int(0, 8, 0, 1);call #Ultimate.allocInit(5, 9);call write~init~int(32, 9, 0, 1);call write~init~int(110, 9, 1, 1);call write~init~int(101, 9, 2, 1);call write~init~int(119, 9, 3, 1);call write~init~int(0, 9, 4, 1);call #Ultimate.allocInit(1, 10);call write~init~int(0, 10, 0, 1);call #Ultimate.allocInit(7, 11);call write~init~int(97, 11, 0, 1);call write~init~int(99, 11, 1, 1);call write~init~int(116, 11, 2, 1);call write~init~int(105, 11, 3, 1);call write~init~int(118, 11, 4, 1);call write~init~int(101, 11, 5, 1);call write~init~int(0, 11, 6, 1);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(8, 13);call #Ultimate.allocInit(45, 14);call #Ultimate.allocInit(33, 15);call #Ultimate.allocInit(30, 16);call #Ultimate.allocInit(17, 17);call #Ultimate.allocInit(1, 18);call write~init~int(0, 18, 0, 1);call #Ultimate.allocInit(3, 19);call write~init~int(117, 19, 0, 1);call write~init~int(110, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(38, 21);call #Ultimate.allocInit(37, 22);call #Ultimate.allocInit(35, 23);call #Ultimate.allocInit(48, 24);call #Ultimate.allocInit(36, 25);call #Ultimate.allocInit(40, 26);call #Ultimate.allocInit(38, 27);call #Ultimate.allocInit(52, 28);call #Ultimate.allocInit(56, 29);call #Ultimate.allocInit(35, 30);call #Ultimate.allocInit(39, 31);call #Ultimate.allocInit(33, 32);call #Ultimate.allocInit(37, 33);call #Ultimate.allocInit(42, 34);call #Ultimate.allocInit(32, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(6, 37);call write~init~int(112, 37, 0, 1);call write~init~int(118, 37, 1, 1);call write~init~int(99, 37, 2, 1);call write~init~int(37, 37, 3, 1);call write~init~int(100, 37, 4, 1);call write~init~int(0, 37, 5, 1);call #Ultimate.allocInit(28, 38);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_0~0 := 0;~ldv_state_variable_3~0 := 0;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~pvc_ops_group1~0.base, ~pvc_ops_group1~0.offset := 0, 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~#pvc_ops~0.base, ~#pvc_ops~0.offset := 39, 0;call #Ultimate.allocInit(480, 39);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 8 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_open.base, #funAddr~pvc_open.offset, ~#pvc_ops~0.base, 16 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_close.base, #funAddr~pvc_close.offset, ~#pvc_ops~0.base, 24 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_xmit.base, #funAddr~pvc_xmit.offset, ~#pvc_ops~0.base, 32 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 40 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 48 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 56 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 64 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 72 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_ioctl.base, #funAddr~pvc_ioctl.offset, ~#pvc_ops~0.base, 80 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 88 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~hdlc_change_mtu.base, #funAddr~hdlc_change_mtu.offset, ~#pvc_ops~0.base, 96 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 104 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 112 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 120 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 128 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 136 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 144 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 152 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 160 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 168 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 176 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 184 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 192 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 200 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 208 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 216 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 224 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 232 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 240 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 248 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 256 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 264 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 272 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 280 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 288 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 296 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 304 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 312 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 320 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 328 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 336 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 344 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 352 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 360 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 368 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 376 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 384 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 392 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 400 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 408 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 416 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 424 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 432 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 440 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 448 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 456 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 464 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 472 + ~#pvc_ops~0.offset, 8);~#proto~0.base, ~#proto~0.offset := 40, 0;call #Ultimate.allocInit(88, 40);call write~init~$Pointer$(0, 0, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_close.base, #funAddr~fr_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_start.base, #funAddr~fr_start.offset, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_stop.base, #funAddr~fr_stop.offset, ~#proto~0.base, 24 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_destroy.base, #funAddr~fr_destroy.offset, ~#proto~0.base, 32 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_ioctl.base, #funAddr~fr_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_rx.base, #funAddr~fr_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 64 + ~#proto~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#proto~0.base, 72 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 80 + ~#proto~0.offset, 8);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 41, 0;call #Ultimate.allocInit(120, 41);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {14445#true} is VALID [2022-02-20 21:55:58,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {14445#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet735#1, main_#t~ret736#1.base, main_#t~ret736#1.offset, main_#t~ret737#1.base, main_#t~ret737#1.offset, main_#t~nondet738#1, main_#t~ret739#1.base, main_#t~ret739#1.offset, main_#t~ret740#1.base, main_#t~ret740#1.offset, main_#t~nondet741#1, main_#t~switch742#1, main_#t~nondet743#1, main_#t~switch744#1, main_#t~ret745#1, main_#t~nondet746#1, main_#t~switch747#1, main_#t~ret748#1, main_#t~ret749#1, main_#t~ret750#1, main_#t~ret751#1, main_#t~ret752#1, main_#t~ret753#1, main_#t~ret754#1, main_#t~ret755#1, main_#t~ret756#1, main_#t~ret757#1, main_#t~nondet758#1, main_#t~switch759#1, main_#t~ret760#1, main_#t~ret761#1, main_#t~ret762#1, main_#t~ret763#1, main_#t~ret764#1, main_#t~ret765#1, main_#t~ret766#1, main_#t~ret767#1, main_#t~ret768#1, main_#t~ret769#1, main_#t~ret770#1, main_#t~ret771#1, main_#t~ret772#1, main_#t~ret773#1, main_#t~ret774#1, main_~ldvarg1~0#1, main_~tmp~37#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset, main_~ldvarg2~0#1, main_~tmp___2~14#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset, main_~tmp___5~8#1, main_~tmp___6~7#1, main_~tmp___7~6#1, main_~tmp___8~5#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~37#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___2~14#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset;havoc main_~tmp___5~8#1;havoc main_~tmp___6~7#1;havoc main_~tmp___7~6#1;havoc main_~tmp___8~5#1;assume -2147483648 <= main_#t~nondet735#1 && main_#t~nondet735#1 <= 2147483647;main_~tmp~37#1 := main_#t~nondet735#1;havoc main_#t~nondet735#1;main_~ldvarg1~0#1 := main_~tmp~37#1; {14445#true} is VALID [2022-02-20 21:55:58,953 INFO L272 TraceCheckUtils]: 2: Hoare triple {14445#true} call main_#t~ret736#1.base, main_#t~ret736#1.offset := ldv_zalloc(40); {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:58,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {14445#true} is VALID [2022-02-20 21:55:58,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {14445#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {14445#true} is VALID [2022-02-20 21:55:58,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {14445#true} assume true; {14445#true} is VALID [2022-02-20 21:55:58,953 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14445#true} {14445#true} #2977#return; {14445#true} is VALID [2022-02-20 21:55:58,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {14445#true} main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset := main_#t~ret736#1.base, main_#t~ret736#1.offset;havoc main_#t~ret736#1.base, main_#t~ret736#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset; {14445#true} is VALID [2022-02-20 21:55:58,954 INFO L272 TraceCheckUtils]: 8: Hoare triple {14445#true} call main_#t~ret737#1.base, main_#t~ret737#1.offset := ldv_zalloc(232); {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:58,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {14445#true} is VALID [2022-02-20 21:55:58,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {14445#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {14445#true} is VALID [2022-02-20 21:55:58,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {14445#true} assume true; {14445#true} is VALID [2022-02-20 21:55:58,956 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14445#true} {14445#true} #2979#return; {14445#true} is VALID [2022-02-20 21:55:58,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {14445#true} main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset := main_#t~ret737#1.base, main_#t~ret737#1.offset;havoc main_#t~ret737#1.base, main_#t~ret737#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset;assume -2147483648 <= main_#t~nondet738#1 && main_#t~nondet738#1 <= 2147483647;main_~tmp___2~14#1 := main_#t~nondet738#1;havoc main_#t~nondet738#1;main_~ldvarg2~0#1 := main_~tmp___2~14#1; {14445#true} is VALID [2022-02-20 21:55:58,957 INFO L272 TraceCheckUtils]: 14: Hoare triple {14445#true} call main_#t~ret739#1.base, main_#t~ret739#1.offset := ldv_zalloc(232); {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:58,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {14445#true} is VALID [2022-02-20 21:55:58,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {14445#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {14445#true} is VALID [2022-02-20 21:55:58,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {14445#true} assume true; {14445#true} is VALID [2022-02-20 21:55:58,957 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14445#true} {14445#true} #2981#return; {14445#true} is VALID [2022-02-20 21:55:58,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {14445#true} main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset := main_#t~ret739#1.base, main_#t~ret739#1.offset;havoc main_#t~ret739#1.base, main_#t~ret739#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset; {14445#true} is VALID [2022-02-20 21:55:58,958 INFO L272 TraceCheckUtils]: 20: Hoare triple {14445#true} call main_#t~ret740#1.base, main_#t~ret740#1.offset := ldv_zalloc(40); {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:58,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {14465#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {14445#true} is VALID [2022-02-20 21:55:58,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {14445#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {14445#true} is VALID [2022-02-20 21:55:58,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {14445#true} assume true; {14445#true} is VALID [2022-02-20 21:55:58,958 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14445#true} {14445#true} #2983#return; {14445#true} is VALID [2022-02-20 21:55:58,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {14445#true} main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset := main_#t~ret740#1.base, main_#t~ret740#1.offset;havoc main_#t~ret740#1.base, main_#t~ret740#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {14445#true} is VALID [2022-02-20 21:55:58,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {14445#true} assume { :end_inline_ldv_set_init } true; {14445#true} is VALID [2022-02-20 21:55:58,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {14445#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {14445#true} is VALID [2022-02-20 21:55:58,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {14445#true} assume -2147483648 <= main_#t~nondet741#1 && main_#t~nondet741#1 <= 2147483647;main_~tmp___5~8#1 := main_#t~nondet741#1;havoc main_#t~nondet741#1;main_#t~switch742#1 := 0 == main_~tmp___5~8#1; {14445#true} is VALID [2022-02-20 21:55:58,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {14445#true} assume !main_#t~switch742#1;main_#t~switch742#1 := main_#t~switch742#1 || 1 == main_~tmp___5~8#1; {14445#true} is VALID [2022-02-20 21:55:58,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {14445#true} assume main_#t~switch742#1; {14445#true} is VALID [2022-02-20 21:55:58,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {14445#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet743#1 && main_#t~nondet743#1 <= 2147483647;main_~tmp___6~7#1 := main_#t~nondet743#1;havoc main_#t~nondet743#1;main_#t~switch744#1 := 0 == main_~tmp___6~7#1; {14445#true} is VALID [2022-02-20 21:55:58,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {14445#true} assume !main_#t~switch744#1;main_#t~switch744#1 := main_#t~switch744#1 || 1 == main_~tmp___6~7#1; {14445#true} is VALID [2022-02-20 21:55:58,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {14445#true} assume main_#t~switch744#1; {14445#true} is VALID [2022-02-20 21:55:58,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {14445#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;assume { :begin_inline_register_hdlc_protocol } true;register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset;register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset := register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset; {14445#true} is VALID [2022-02-20 21:55:58,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {14445#true} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {14463#(= |ULTIMATE.start_mod_init_#res#1| 0)} is VALID [2022-02-20 21:55:58,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {14463#(= |ULTIMATE.start_mod_init_#res#1| 0)} main_#t~ret745#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret745#1 && main_#t~ret745#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret745#1;havoc main_#t~ret745#1; {14464#(= ~ldv_retval_0~0 0)} is VALID [2022-02-20 21:55:58,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {14464#(= ~ldv_retval_0~0 0)} assume !(0 == ~ldv_retval_0~0); {14446#false} is VALID [2022-02-20 21:55:58,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {14446#false} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {14446#false} is VALID [2022-02-20 21:55:58,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {14446#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret787#1, ldv_check_final_state_~tmp___7~12#1;havoc ldv_check_final_state_~tmp___7~12#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {14446#false} is VALID [2022-02-20 21:55:58,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {14446#false} ldv_check_final_state_#t~ret787#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret787#1 && ldv_check_final_state_#t~ret787#1 <= 2147483647;ldv_check_final_state_~tmp___7~12#1 := ldv_check_final_state_#t~ret787#1;havoc ldv_check_final_state_#t~ret787#1; {14446#false} is VALID [2022-02-20 21:55:58,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {14446#false} assume !(0 != ldv_check_final_state_~tmp___7~12#1); {14446#false} is VALID [2022-02-20 21:55:58,964 INFO L272 TraceCheckUtils]: 42: Hoare triple {14446#false} call ldv_error(); {14446#false} is VALID [2022-02-20 21:55:58,964 INFO L290 TraceCheckUtils]: 43: Hoare triple {14446#false} assume !false; {14446#false} is VALID [2022-02-20 21:55:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 21:55:58,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:58,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119424874] [2022-02-20 21:55:58,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119424874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:58,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:58,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:55:58,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382593137] [2022-02-20 21:55:58,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:58,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 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 44 [2022-02-20 21:55:58,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:58,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:55:58,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:58,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:55:58,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:58,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:55:58,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:55:58,998 INFO L87 Difference]: Start difference. First operand 2273 states and 3296 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:56:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:09,236 INFO L93 Difference]: Finished difference Result 4811 states and 7034 transitions. [2022-02-20 21:56:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:56:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 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 44 [2022-02-20 21:56:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:56:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4073 transitions. [2022-02-20 21:56:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:56:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4073 transitions. [2022-02-20 21:56:09,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 4073 transitions. [2022-02-20 21:56:12,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4073 edges. 4073 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:12,626 INFO L225 Difference]: With dead ends: 4811 [2022-02-20 21:56:12,626 INFO L226 Difference]: Without dead ends: 2550 [2022-02-20 21:56:12,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:56:12,634 INFO L933 BasicCegarLoop]: 2048 mSDtfsCounter, 2217 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 4233 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:12,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2397 Valid, 4233 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-02-20 21:56:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2022-02-20 21:56:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2272. [2022-02-20 21:56:12,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:12,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2550 states. Second operand has 2272 states, 1658 states have (on average 1.3648974668275031) internal successors, (2263), 1678 states have internal predecessors, (2263), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-02-20 21:56:12,714 INFO L74 IsIncluded]: Start isIncluded. First operand 2550 states. Second operand has 2272 states, 1658 states have (on average 1.3648974668275031) internal successors, (2263), 1678 states have internal predecessors, (2263), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-02-20 21:56:12,719 INFO L87 Difference]: Start difference. First operand 2550 states. Second operand has 2272 states, 1658 states have (on average 1.3648974668275031) internal successors, (2263), 1678 states have internal predecessors, (2263), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-02-20 21:56:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:12,948 INFO L93 Difference]: Finished difference Result 2550 states and 3752 transitions. [2022-02-20 21:56:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3752 transitions. [2022-02-20 21:56:12,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:12,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:12,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 2272 states, 1658 states have (on average 1.3648974668275031) internal successors, (2263), 1678 states have internal predecessors, (2263), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) Second operand 2550 states. [2022-02-20 21:56:12,982 INFO L87 Difference]: Start difference. First operand has 2272 states, 1658 states have (on average 1.3648974668275031) internal successors, (2263), 1678 states have internal predecessors, (2263), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) Second operand 2550 states. [2022-02-20 21:56:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:13,204 INFO L93 Difference]: Finished difference Result 2550 states and 3752 transitions. [2022-02-20 21:56:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3752 transitions. [2022-02-20 21:56:13,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:13,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:13,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:13,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 1658 states have (on average 1.3648974668275031) internal successors, (2263), 1678 states have internal predecessors, (2263), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-02-20 21:56:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3292 transitions. [2022-02-20 21:56:13,464 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3292 transitions. Word has length 44 [2022-02-20 21:56:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:13,465 INFO L470 AbstractCegarLoop]: Abstraction has 2272 states and 3292 transitions. [2022-02-20 21:56:13,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:56:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3292 transitions. [2022-02-20 21:56:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 21:56:13,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:13,468 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2022-02-20 21:56:13,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:56:13,468 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -94841370, now seen corresponding path program 1 times [2022-02-20 21:56:13,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:13,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066413552] [2022-02-20 21:56:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:13,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:13,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29189#true} {29189#true} #2977#return; {29189#true} is VALID [2022-02-20 21:56:13,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:56:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:13,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29189#true} {29189#true} #2979#return; {29189#true} is VALID [2022-02-20 21:56:13,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:56:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:13,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29189#true} {29189#true} #2981#return; {29189#true} is VALID [2022-02-20 21:56:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:56:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:13,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29189#true} {29189#true} #2983#return; {29189#true} is VALID [2022-02-20 21:56:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:56:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:13,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29189#true} {29207#(= ~last_index~0 0)} #3045#return; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:56:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:13,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29189#true} {29207#(= ~last_index~0 0)} #3047#return; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {29189#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(102, 2);call #Ultimate.allocInit(23, 3);call #Ultimate.allocInit(23, 4);call #Ultimate.allocInit(1, 5);call write~init~int(0, 5, 0, 1);call #Ultimate.allocInit(2, 6);call write~init~int(32, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(1, 7);call write~init~int(0, 7, 0, 1);call #Ultimate.allocInit(1, 8);call write~init~int(0, 8, 0, 1);call #Ultimate.allocInit(5, 9);call write~init~int(32, 9, 0, 1);call write~init~int(110, 9, 1, 1);call write~init~int(101, 9, 2, 1);call write~init~int(119, 9, 3, 1);call write~init~int(0, 9, 4, 1);call #Ultimate.allocInit(1, 10);call write~init~int(0, 10, 0, 1);call #Ultimate.allocInit(7, 11);call write~init~int(97, 11, 0, 1);call write~init~int(99, 11, 1, 1);call write~init~int(116, 11, 2, 1);call write~init~int(105, 11, 3, 1);call write~init~int(118, 11, 4, 1);call write~init~int(101, 11, 5, 1);call write~init~int(0, 11, 6, 1);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(8, 13);call #Ultimate.allocInit(45, 14);call #Ultimate.allocInit(33, 15);call #Ultimate.allocInit(30, 16);call #Ultimate.allocInit(17, 17);call #Ultimate.allocInit(1, 18);call write~init~int(0, 18, 0, 1);call #Ultimate.allocInit(3, 19);call write~init~int(117, 19, 0, 1);call write~init~int(110, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(38, 21);call #Ultimate.allocInit(37, 22);call #Ultimate.allocInit(35, 23);call #Ultimate.allocInit(48, 24);call #Ultimate.allocInit(36, 25);call #Ultimate.allocInit(40, 26);call #Ultimate.allocInit(38, 27);call #Ultimate.allocInit(52, 28);call #Ultimate.allocInit(56, 29);call #Ultimate.allocInit(35, 30);call #Ultimate.allocInit(39, 31);call #Ultimate.allocInit(33, 32);call #Ultimate.allocInit(37, 33);call #Ultimate.allocInit(42, 34);call #Ultimate.allocInit(32, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(6, 37);call write~init~int(112, 37, 0, 1);call write~init~int(118, 37, 1, 1);call write~init~int(99, 37, 2, 1);call write~init~int(37, 37, 3, 1);call write~init~int(100, 37, 4, 1);call write~init~int(0, 37, 5, 1);call #Ultimate.allocInit(28, 38);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_0~0 := 0;~ldv_state_variable_3~0 := 0;~proto_group0~0.base, ~proto_group0~0.offset := 0, 0;~ldv_timer_state_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~pvc_ops_group1~0.base, ~pvc_ops_group1~0.offset := 0, 0;~ldv_timer_list_1~0.base, ~ldv_timer_list_1~0.offset := 0, 0;~#pvc_ops~0.base, ~#pvc_ops~0.offset := 39, 0;call #Ultimate.allocInit(480, 39);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 8 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_open.base, #funAddr~pvc_open.offset, ~#pvc_ops~0.base, 16 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_close.base, #funAddr~pvc_close.offset, ~#pvc_ops~0.base, 24 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_xmit.base, #funAddr~pvc_xmit.offset, ~#pvc_ops~0.base, 32 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 40 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 48 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 56 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 64 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 72 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~pvc_ioctl.base, #funAddr~pvc_ioctl.offset, ~#pvc_ops~0.base, 80 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 88 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~hdlc_change_mtu.base, #funAddr~hdlc_change_mtu.offset, ~#pvc_ops~0.base, 96 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 104 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 112 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 120 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 128 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 136 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 144 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 152 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 160 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 168 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 176 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 184 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 192 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 200 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 208 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 216 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 224 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 232 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 240 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 248 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 256 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 264 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 272 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 280 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 288 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 296 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 304 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 312 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 320 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 328 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 336 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 344 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 352 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 360 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 368 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 376 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 384 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 392 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 400 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 408 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 416 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 424 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 432 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 440 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 448 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 456 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 464 + ~#pvc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pvc_ops~0.base, 472 + ~#pvc_ops~0.offset, 8);~#proto~0.base, ~#proto~0.offset := 40, 0;call #Ultimate.allocInit(88, 40);call write~init~$Pointer$(0, 0, ~#proto~0.base, ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_close.base, #funAddr~fr_close.offset, ~#proto~0.base, 8 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_start.base, #funAddr~fr_start.offset, ~#proto~0.base, 16 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_stop.base, #funAddr~fr_stop.offset, ~#proto~0.base, 24 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_destroy.base, #funAddr~fr_destroy.offset, ~#proto~0.base, 32 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_ioctl.base, #funAddr~fr_ioctl.offset, ~#proto~0.base, 40 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 48 + ~#proto~0.offset, 8);call write~init~$Pointer$(#funAddr~fr_rx.base, #funAddr~fr_rx.offset, ~#proto~0.base, 56 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 64 + ~#proto~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#proto~0.base, 72 + ~#proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#proto~0.base, 80 + ~#proto~0.offset, 8);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 41, 0;call #Ultimate.allocInit(120, 41);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {29189#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet735#1, main_#t~ret736#1.base, main_#t~ret736#1.offset, main_#t~ret737#1.base, main_#t~ret737#1.offset, main_#t~nondet738#1, main_#t~ret739#1.base, main_#t~ret739#1.offset, main_#t~ret740#1.base, main_#t~ret740#1.offset, main_#t~nondet741#1, main_#t~switch742#1, main_#t~nondet743#1, main_#t~switch744#1, main_#t~ret745#1, main_#t~nondet746#1, main_#t~switch747#1, main_#t~ret748#1, main_#t~ret749#1, main_#t~ret750#1, main_#t~ret751#1, main_#t~ret752#1, main_#t~ret753#1, main_#t~ret754#1, main_#t~ret755#1, main_#t~ret756#1, main_#t~ret757#1, main_#t~nondet758#1, main_#t~switch759#1, main_#t~ret760#1, main_#t~ret761#1, main_#t~ret762#1, main_#t~ret763#1, main_#t~ret764#1, main_#t~ret765#1, main_#t~ret766#1, main_#t~ret767#1, main_#t~ret768#1, main_#t~ret769#1, main_#t~ret770#1, main_#t~ret771#1, main_#t~ret772#1, main_#t~ret773#1, main_#t~ret774#1, main_~ldvarg1~0#1, main_~tmp~37#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset, main_~ldvarg2~0#1, main_~tmp___2~14#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset, main_~tmp___5~8#1, main_~tmp___6~7#1, main_~tmp___7~6#1, main_~tmp___8~5#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~37#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___2~14#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset;havoc main_~tmp___5~8#1;havoc main_~tmp___6~7#1;havoc main_~tmp___7~6#1;havoc main_~tmp___8~5#1;assume -2147483648 <= main_#t~nondet735#1 && main_#t~nondet735#1 <= 2147483647;main_~tmp~37#1 := main_#t~nondet735#1;havoc main_#t~nondet735#1;main_~ldvarg1~0#1 := main_~tmp~37#1; {29189#true} is VALID [2022-02-20 21:56:13,601 INFO L272 TraceCheckUtils]: 2: Hoare triple {29189#true} call main_#t~ret736#1.base, main_#t~ret736#1.offset := ldv_zalloc(40); {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:13,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,601 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29189#true} {29189#true} #2977#return; {29189#true} is VALID [2022-02-20 21:56:13,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {29189#true} main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset := main_#t~ret736#1.base, main_#t~ret736#1.offset;havoc main_#t~ret736#1.base, main_#t~ret736#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~24#1.base, main_~tmp___0~24#1.offset; {29189#true} is VALID [2022-02-20 21:56:13,602 INFO L272 TraceCheckUtils]: 8: Hoare triple {29189#true} call main_#t~ret737#1.base, main_#t~ret737#1.offset := ldv_zalloc(232); {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:13,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,603 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29189#true} {29189#true} #2979#return; {29189#true} is VALID [2022-02-20 21:56:13,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {29189#true} main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset := main_#t~ret737#1.base, main_#t~ret737#1.offset;havoc main_#t~ret737#1.base, main_#t~ret737#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~20#1.base, main_~tmp___1~20#1.offset;assume -2147483648 <= main_#t~nondet738#1 && main_#t~nondet738#1 <= 2147483647;main_~tmp___2~14#1 := main_#t~nondet738#1;havoc main_#t~nondet738#1;main_~ldvarg2~0#1 := main_~tmp___2~14#1; {29189#true} is VALID [2022-02-20 21:56:13,603 INFO L272 TraceCheckUtils]: 14: Hoare triple {29189#true} call main_#t~ret739#1.base, main_#t~ret739#1.offset := ldv_zalloc(232); {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:13,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,604 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29189#true} {29189#true} #2981#return; {29189#true} is VALID [2022-02-20 21:56:13,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {29189#true} main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset := main_#t~ret739#1.base, main_#t~ret739#1.offset;havoc main_#t~ret739#1.base, main_#t~ret739#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___3~12#1.base, main_~tmp___3~12#1.offset; {29189#true} is VALID [2022-02-20 21:56:13,605 INFO L272 TraceCheckUtils]: 20: Hoare triple {29189#true} call main_#t~ret740#1.base, main_#t~ret740#1.offset := ldv_zalloc(40); {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:13,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,605 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {29189#true} {29189#true} #2983#return; {29189#true} is VALID [2022-02-20 21:56:13,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {29189#true} main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset := main_#t~ret740#1.base, main_#t~ret740#1.offset;havoc main_#t~ret740#1.base, main_#t~ret740#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___4~9#1.base, main_~tmp___4~9#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {29207#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {29207#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {29207#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet741#1 && main_#t~nondet741#1 <= 2147483647;main_~tmp___5~8#1 := main_#t~nondet741#1;havoc main_#t~nondet741#1;main_#t~switch742#1 := 0 == main_~tmp___5~8#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {29207#(= ~last_index~0 0)} assume !main_#t~switch742#1;main_#t~switch742#1 := main_#t~switch742#1 || 1 == main_~tmp___5~8#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {29207#(= ~last_index~0 0)} assume main_#t~switch742#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {29207#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet743#1 && main_#t~nondet743#1 <= 2147483647;main_~tmp___6~7#1 := main_#t~nondet743#1;havoc main_#t~nondet743#1;main_#t~switch744#1 := 0 == main_~tmp___6~7#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {29207#(= ~last_index~0 0)} assume !main_#t~switch744#1;main_#t~switch744#1 := main_#t~switch744#1 || 1 == main_~tmp___6~7#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {29207#(= ~last_index~0 0)} assume main_#t~switch744#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {29207#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_mod_init } true;havoc mod_init_#res#1;assume { :begin_inline_register_hdlc_protocol } true;register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset;register_hdlc_protocol_~arg0#1.base, register_hdlc_protocol_~arg0#1.offset := register_hdlc_protocol_#in~arg0#1.base, register_hdlc_protocol_#in~arg0#1.offset; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {29207#(= ~last_index~0 0)} assume { :end_inline_register_hdlc_protocol } true;mod_init_#res#1 := 0; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {29207#(= ~last_index~0 0)} main_#t~ret745#1 := mod_init_#res#1;assume { :end_inline_mod_init } true;assume -2147483648 <= main_#t~ret745#1 && main_#t~ret745#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret745#1;havoc main_#t~ret745#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {29207#(= ~last_index~0 0)} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_hdlc_proto_2 } true;havoc ldv_initialize_hdlc_proto_2_#t~ret734#1.base, ldv_initialize_hdlc_proto_2_#t~ret734#1.offset, ldv_initialize_hdlc_proto_2_~tmp~36#1.base, ldv_initialize_hdlc_proto_2_~tmp~36#1.offset;havoc ldv_initialize_hdlc_proto_2_~tmp~36#1.base, ldv_initialize_hdlc_proto_2_~tmp~36#1.offset; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,610 INFO L272 TraceCheckUtils]: 38: Hoare triple {29207#(= ~last_index~0 0)} call ldv_initialize_hdlc_proto_2_#t~ret734#1.base, ldv_initialize_hdlc_proto_2_#t~ret734#1.offset := ldv_zalloc(3264); {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:13,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,611 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29189#true} {29207#(= ~last_index~0 0)} #3045#return; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {29207#(= ~last_index~0 0)} ldv_initialize_hdlc_proto_2_~tmp~36#1.base, ldv_initialize_hdlc_proto_2_~tmp~36#1.offset := ldv_initialize_hdlc_proto_2_#t~ret734#1.base, ldv_initialize_hdlc_proto_2_#t~ret734#1.offset;havoc ldv_initialize_hdlc_proto_2_#t~ret734#1.base, ldv_initialize_hdlc_proto_2_#t~ret734#1.offset;~proto_group0~0.base, ~proto_group0~0.offset := ldv_initialize_hdlc_proto_2_~tmp~36#1.base, ldv_initialize_hdlc_proto_2_~tmp~36#1.offset; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {29207#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize_hdlc_proto_2 } true;~ldv_state_variable_3~0 := 1;assume { :begin_inline_ldv_net_device_ops_3 } true;havoc ldv_net_device_ops_3_#t~ret728#1.base, ldv_net_device_ops_3_#t~ret728#1.offset, ldv_net_device_ops_3_~tmp~35#1.base, ldv_net_device_ops_3_~tmp~35#1.offset;havoc ldv_net_device_ops_3_~tmp~35#1.base, ldv_net_device_ops_3_~tmp~35#1.offset; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,613 INFO L272 TraceCheckUtils]: 45: Hoare triple {29207#(= ~last_index~0 0)} call ldv_net_device_ops_3_#t~ret728#1.base, ldv_net_device_ops_3_#t~ret728#1.offset := ldv_zalloc(3264); {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:13,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {29218#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~7#1.base, ~tmp~7#1.offset;havoc ~tmp___0~4#1;assume -2147483648 <= #t~nondet73#1 && #t~nondet73#1 <= 2147483647;~tmp___0~4#1 := #t~nondet73#1;havoc #t~nondet73#1; {29189#true} is VALID [2022-02-20 21:56:13,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {29189#true} assume 0 != ~tmp___0~4#1;#res#1.base, #res#1.offset := 0, 0; {29189#true} is VALID [2022-02-20 21:56:13,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {29189#true} assume true; {29189#true} is VALID [2022-02-20 21:56:13,614 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29189#true} {29207#(= ~last_index~0 0)} #3047#return; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,614 INFO L290 TraceCheckUtils]: 50: Hoare triple {29207#(= ~last_index~0 0)} ldv_net_device_ops_3_~tmp~35#1.base, ldv_net_device_ops_3_~tmp~35#1.offset := ldv_net_device_ops_3_#t~ret728#1.base, ldv_net_device_ops_3_#t~ret728#1.offset;havoc ldv_net_device_ops_3_#t~ret728#1.base, ldv_net_device_ops_3_#t~ret728#1.offset;~pvc_ops_group1~0.base, ~pvc_ops_group1~0.offset := ldv_net_device_ops_3_~tmp~35#1.base, ldv_net_device_ops_3_~tmp~35#1.offset; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,614 INFO L290 TraceCheckUtils]: 51: Hoare triple {29207#(= ~last_index~0 0)} assume { :end_inline_ldv_net_device_ops_3 } true; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,615 INFO L290 TraceCheckUtils]: 52: Hoare triple {29207#(= ~last_index~0 0)} assume !(0 != ~ldv_retval_0~0); {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,615 INFO L290 TraceCheckUtils]: 53: Hoare triple {29207#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet741#1 && main_#t~nondet741#1 <= 2147483647;main_~tmp___5~8#1 := main_#t~nondet741#1;havoc main_#t~nondet741#1;main_#t~switch742#1 := 0 == main_~tmp___5~8#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,615 INFO L290 TraceCheckUtils]: 54: Hoare triple {29207#(= ~last_index~0 0)} assume !main_#t~switch742#1;main_#t~switch742#1 := main_#t~switch742#1 || 1 == main_~tmp___5~8#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,616 INFO L290 TraceCheckUtils]: 55: Hoare triple {29207#(= ~last_index~0 0)} assume main_#t~switch742#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {29207#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet743#1 && main_#t~nondet743#1 <= 2147483647;main_~tmp___6~7#1 := main_#t~nondet743#1;havoc main_#t~nondet743#1;main_#t~switch744#1 := 0 == main_~tmp___6~7#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {29207#(= ~last_index~0 0)} assume main_#t~switch744#1; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {29207#(= ~last_index~0 0)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_mod_exit } true;assume { :begin_inline_unregister_hdlc_protocol } true;unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset := ~#proto~0.base, ~#proto~0.offset;havoc unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset;unregister_hdlc_protocol_~arg0#1.base, unregister_hdlc_protocol_~arg0#1.offset := unregister_hdlc_protocol_#in~arg0#1.base, unregister_hdlc_protocol_#in~arg0#1.offset; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {29207#(= ~last_index~0 0)} assume { :end_inline_unregister_hdlc_protocol } true; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {29207#(= ~last_index~0 0)} assume { :end_inline_mod_exit } true;~ldv_state_variable_0~0 := 2; {29207#(= ~last_index~0 0)} is VALID [2022-02-20 21:56:13,621 INFO L290 TraceCheckUtils]: 61: Hoare triple {29207#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret787#1, ldv_check_final_state_~tmp___7~12#1;havoc ldv_check_final_state_~tmp___7~12#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {29216#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} is VALID [2022-02-20 21:56:13,621 INFO L290 TraceCheckUtils]: 62: Hoare triple {29216#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} ldv_check_final_state_#t~ret787#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret787#1 && ldv_check_final_state_#t~ret787#1 <= 2147483647;ldv_check_final_state_~tmp___7~12#1 := ldv_check_final_state_#t~ret787#1;havoc ldv_check_final_state_#t~ret787#1; {29217#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~12#1| 0))} is VALID [2022-02-20 21:56:13,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {29217#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~12#1| 0))} assume !(0 != ldv_check_final_state_~tmp___7~12#1); {29190#false} is VALID [2022-02-20 21:56:13,621 INFO L272 TraceCheckUtils]: 64: Hoare triple {29190#false} call ldv_error(); {29190#false} is VALID [2022-02-20 21:56:13,621 INFO L290 TraceCheckUtils]: 65: Hoare triple {29190#false} assume !false; {29190#false} is VALID [2022-02-20 21:56:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-02-20 21:56:13,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:56:13,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066413552] [2022-02-20 21:56:13,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066413552] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:13,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:13,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:56:13,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907894632] [2022-02-20 21:56:13,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:13,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2022-02-20 21:56:13,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:13,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:56:13,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:13,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:56:13,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:56:13,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:56:13,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:56:13,658 INFO L87 Difference]: Start difference. First operand 2272 states and 3292 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:56:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:29,589 INFO L93 Difference]: Finished difference Result 7337 states and 10822 transitions. [2022-02-20 21:56:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:56:29,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2022-02-20 21:56:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:56:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5455 transitions. [2022-02-20 21:56:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:56:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5455 transitions. [2022-02-20 21:56:29,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 5455 transitions. [2022-02-20 21:56:33,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5455 edges. 5455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:34,965 INFO L225 Difference]: With dead ends: 7337 [2022-02-20 21:56:34,965 INFO L226 Difference]: Without dead ends: 5072 [2022-02-20 21:56:34,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:56:34,973 INFO L933 BasicCegarLoop]: 1870 mSDtfsCounter, 2209 mSDsluCounter, 4509 mSDsCounter, 0 mSdLazyCounter, 3055 mSolverCounterSat, 768 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2428 SdHoareTripleChecker+Valid, 6379 SdHoareTripleChecker+Invalid, 3823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 768 IncrementalHoareTripleChecker+Valid, 3055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:34,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2428 Valid, 6379 Invalid, 3823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [768 Valid, 3055 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-02-20 21:56:34,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2022-02-20 21:56:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 4554. [2022-02-20 21:56:35,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:35,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5072 states. Second operand has 4554 states, 3324 states have (on average 1.3655234657039712) internal successors, (4539), 3368 states have internal predecessors, (4539), 1025 states have call successors, (1025), 197 states have call predecessors, (1025), 204 states have return successors, (1084), 1024 states have call predecessors, (1084), 1024 states have call successors, (1084) [2022-02-20 21:56:35,122 INFO L74 IsIncluded]: Start isIncluded. First operand 5072 states. Second operand has 4554 states, 3324 states have (on average 1.3655234657039712) internal successors, (4539), 3368 states have internal predecessors, (4539), 1025 states have call successors, (1025), 197 states have call predecessors, (1025), 204 states have return successors, (1084), 1024 states have call predecessors, (1084), 1024 states have call successors, (1084) [2022-02-20 21:56:35,131 INFO L87 Difference]: Start difference. First operand 5072 states. Second operand has 4554 states, 3324 states have (on average 1.3655234657039712) internal successors, (4539), 3368 states have internal predecessors, (4539), 1025 states have call successors, (1025), 197 states have call predecessors, (1025), 204 states have return successors, (1084), 1024 states have call predecessors, (1084), 1024 states have call successors, (1084) [2022-02-20 21:56:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:35,918 INFO L93 Difference]: Finished difference Result 5072 states and 7520 transitions. [2022-02-20 21:56:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 7520 transitions. [2022-02-20 21:56:35,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:35,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:35,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 4554 states, 3324 states have (on average 1.3655234657039712) internal successors, (4539), 3368 states have internal predecessors, (4539), 1025 states have call successors, (1025), 197 states have call predecessors, (1025), 204 states have return successors, (1084), 1024 states have call predecessors, (1084), 1024 states have call successors, (1084) Second operand 5072 states. [2022-02-20 21:56:35,967 INFO L87 Difference]: Start difference. First operand has 4554 states, 3324 states have (on average 1.3655234657039712) internal successors, (4539), 3368 states have internal predecessors, (4539), 1025 states have call successors, (1025), 197 states have call predecessors, (1025), 204 states have return successors, (1084), 1024 states have call predecessors, (1084), 1024 states have call successors, (1084) Second operand 5072 states. [2022-02-20 21:56:36,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:36,756 INFO L93 Difference]: Finished difference Result 5072 states and 7520 transitions. [2022-02-20 21:56:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 7520 transitions. [2022-02-20 21:56:36,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:36,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:36,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:36,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 3324 states have (on average 1.3655234657039712) internal successors, (4539), 3368 states have internal predecessors, (4539), 1025 states have call successors, (1025), 197 states have call predecessors, (1025), 204 states have return successors, (1084), 1024 states have call predecessors, (1084), 1024 states have call successors, (1084)