./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_x25.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.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 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 00:55:32,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 00:55:32,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 00:55:32,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 00:55:32,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 00:55:32,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 00:55:32,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 00:55:32,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 00:55:32,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 00:55:32,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 00:55:32,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 00:55:32,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 00:55:32,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 00:55:32,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 00:55:32,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 00:55:32,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 00:55:32,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 00:55:32,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 00:55:32,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 00:55:32,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 00:55:32,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 00:55:32,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 00:55:32,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 00:55:32,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 00:55:32,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 00:55:32,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 00:55:32,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 00:55:32,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 00:55:32,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 00:55:32,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 00:55:32,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 00:55:32,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 00:55:32,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 00:55:32,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 00:55:32,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 00:55:32,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 00:55:32,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 00:55:32,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 00:55:32,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 00:55:32,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 00:55:32,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 00:55:32,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 00:55:32,869 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 00:55:32,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 00:55:32,870 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 00:55:32,870 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 00:55:32,871 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 00:55:32,871 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 00:55:32,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 00:55:32,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 00:55:32,872 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 00:55:32,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 00:55:32,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 00:55:32,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 00:55:32,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 00:55:32,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 00:55:32,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 00:55:32,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 00:55:32,875 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 00:55:32,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 00:55:32,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 00:55:32,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 00:55:32,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 00:55:32,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:55:32,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 00:55:32,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 00:55:32,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 00:55:32,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 00:55:32,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 00:55:32,878 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 00:55:32,878 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 00:55:32,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 00:55:32,878 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 00:55:32,879 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 -> 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c [2021-11-17 00:55:33,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 00:55:33,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 00:55:33,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 00:55:33,125 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 00:55:33,126 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 00:55:33,127 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_x25.ko-entry_point.cil.out.i [2021-11-17 00:55:33,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029692069/ae43ed22e0c04e528859270784627dc7/FLAGcdfde45d0 [2021-11-17 00:55:33,706 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 00:55:33,707 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_x25.ko-entry_point.cil.out.i [2021-11-17 00:55:33,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029692069/ae43ed22e0c04e528859270784627dc7/FLAGcdfde45d0 [2021-11-17 00:55:34,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029692069/ae43ed22e0c04e528859270784627dc7 [2021-11-17 00:55:34,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 00:55:34,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 00:55:34,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 00:55:34,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 00:55:34,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 00:55:34,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:55:34" (1/1) ... [2021-11-17 00:55:34,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e45d823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:34, skipping insertion in model container [2021-11-17 00:55:34,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:55:34" (1/1) ... [2021-11-17 00:55:34,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 00:55:34,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 00:55:34,792 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_x25.ko-entry_point.cil.out.i[152690,152703] [2021-11-17 00:55:35,050 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:55:35,061 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 00:55:35,205 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_x25.ko-entry_point.cil.out.i[152690,152703] [2021-11-17 00:55:35,261 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:55:35,287 INFO L208 MainTranslator]: Completed translation [2021-11-17 00:55:35,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35 WrapperNode [2021-11-17 00:55:35,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 00:55:35,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 00:55:35,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 00:55:35,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 00:55:35,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (1/1) ... [2021-11-17 00:55:35,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (1/1) ... [2021-11-17 00:55:35,385 INFO L137 Inliner]: procedures = 110, calls = 180, calls flagged for inlining = 54, calls inlined = 43, statements flattened = 629 [2021-11-17 00:55:35,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 00:55:35,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 00:55:35,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 00:55:35,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 00:55:35,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (1/1) ... [2021-11-17 00:55:35,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (1/1) ... [2021-11-17 00:55:35,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (1/1) ... [2021-11-17 00:55:35,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (1/1) ... [2021-11-17 00:55:35,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (1/1) ... [2021-11-17 00:55:35,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (1/1) ... [2021-11-17 00:55:35,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (1/1) ... [2021-11-17 00:55:35,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 00:55:35,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 00:55:35,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 00:55:35,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 00:55:35,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (1/1) ... [2021-11-17 00:55:35,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:55:35,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:55:35,525 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) [2021-11-17 00:55:35,545 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 [2021-11-17 00:55:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 00:55:35,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 00:55:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 00:55:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 00:55:35,564 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 00:55:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2021-11-17 00:55:35,564 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2021-11-17 00:55:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2021-11-17 00:55:35,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2021-11-17 00:55:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 00:55:35,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 00:55:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2021-11-17 00:55:35,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2021-11-17 00:55:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 00:55:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 00:55:35,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 00:55:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure x25_ioctl [2021-11-17 00:55:35,566 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_ioctl [2021-11-17 00:55:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-11-17 00:55:35,566 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-11-17 00:55:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 00:55:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 00:55:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure x25_connect_disconnect [2021-11-17 00:55:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_connect_disconnect [2021-11-17 00:55:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 00:55:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2021-11-17 00:55:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2021-11-17 00:55:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 00:55:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2021-11-17 00:55:35,568 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2021-11-17 00:55:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure x25_xmit [2021-11-17 00:55:35,568 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_xmit [2021-11-17 00:55:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 00:55:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 00:55:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 00:55:35,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2021-11-17 00:55:35,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2021-11-17 00:55:35,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 00:55:35,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 00:55:35,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2021-11-17 00:55:35,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2021-11-17 00:55:35,613 INFO L130 BoogieDeclarations]: Found specification of procedure x25_rx [2021-11-17 00:55:35,614 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_rx [2021-11-17 00:55:35,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 00:55:35,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 00:55:35,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 00:55:35,905 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 00:55:35,907 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 00:55:36,163 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 00:55:36,487 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 00:55:36,494 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 00:55:36,495 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-17 00:55:36,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:55:36 BoogieIcfgContainer [2021-11-17 00:55:36,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 00:55:36,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 00:55:36,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 00:55:36,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 00:55:36,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:55:34" (1/3) ... [2021-11-17 00:55:36,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d17ade6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:55:36, skipping insertion in model container [2021-11-17 00:55:36,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:55:35" (2/3) ... [2021-11-17 00:55:36,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d17ade6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:55:36, skipping insertion in model container [2021-11-17 00:55:36,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:55:36" (3/3) ... [2021-11-17 00:55:36,503 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i [2021-11-17 00:55:36,507 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 00:55:36,507 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 00:55:36,559 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 00:55:36,563 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 [2021-11-17 00:55:36,563 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 00:55:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 190 states have internal predecessors, (254), 35 states have call successors, (35), 17 states have call predecessors, (35), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-11-17 00:55:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-17 00:55:36,591 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:36,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:36,592 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:36,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash 898254007, now seen corresponding path program 1 times [2021-11-17 00:55:36,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:55:36,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365269225] [2021-11-17 00:55:36,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:36,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:55:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:36,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:55:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:36,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 00:55:37,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:55:37,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365269225] [2021-11-17 00:55:37,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365269225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:37,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:37,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:55:37,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22040248] [2021-11-17 00:55:37,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:37,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:55:37,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:55:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:55:37,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:55:37,050 INFO L87 Difference]: Start difference. First operand has 237 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 190 states have internal predecessors, (254), 35 states have call successors, (35), 17 states have call predecessors, (35), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:55:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:37,743 INFO L93 Difference]: Finished difference Result 786 states and 1141 transitions. [2021-11-17 00:55:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:55:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-11-17 00:55:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:37,764 INFO L225 Difference]: With dead ends: 786 [2021-11-17 00:55:37,765 INFO L226 Difference]: Without dead ends: 540 [2021-11-17 00:55:37,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:55:37,780 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 752 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:37,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [764 Valid, 708 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 00:55:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-11-17 00:55:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 432. [2021-11-17 00:55:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2021-11-17 00:55:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 572 transitions. [2021-11-17 00:55:37,887 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 572 transitions. Word has length 33 [2021-11-17 00:55:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:37,888 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 572 transitions. [2021-11-17 00:55:37,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:55:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2021-11-17 00:55:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-17 00:55:37,891 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:37,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:37,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 00:55:37,891 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1941540429, now seen corresponding path program 1 times [2021-11-17 00:55:37,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:55:37,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485521607] [2021-11-17 00:55:37,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:37,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:55:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:55:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:37,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 00:55:37,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:55:37,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485521607] [2021-11-17 00:55:37,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485521607] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:37,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:37,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 00:55:37,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550204845] [2021-11-17 00:55:37,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:37,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:55:37,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:55:37,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:55:37,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:55:37,992 INFO L87 Difference]: Start difference. First operand 432 states and 572 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:55:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:38,406 INFO L93 Difference]: Finished difference Result 965 states and 1293 transitions. [2021-11-17 00:55:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:55:38,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2021-11-17 00:55:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:38,410 INFO L225 Difference]: With dead ends: 965 [2021-11-17 00:55:38,410 INFO L226 Difference]: Without dead ends: 539 [2021-11-17 00:55:38,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:55:38,413 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 613 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:38,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 753 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 00:55:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-11-17 00:55:38,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 431. [2021-11-17 00:55:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 340 states have (on average 1.3205882352941176) internal successors, (449), 342 states have internal predecessors, (449), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2021-11-17 00:55:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 568 transitions. [2021-11-17 00:55:38,443 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 568 transitions. Word has length 36 [2021-11-17 00:55:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:38,444 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 568 transitions. [2021-11-17 00:55:38,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:55:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 568 transitions. [2021-11-17 00:55:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-17 00:55:38,448 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:38,448 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 00:55:38,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 00:55:38,449 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:38,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:38,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2029658452, now seen corresponding path program 1 times [2021-11-17 00:55:38,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:55:38,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739571293] [2021-11-17 00:55:38,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:38,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:55:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:55:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:55:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:38,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:38,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:55:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:38,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-17 00:55:38,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:55:38,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739571293] [2021-11-17 00:55:38,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739571293] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:38,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:38,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:55:38,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857494783] [2021-11-17 00:55:38,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:38,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:55:38,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:55:38,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:55:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:55:38,606 INFO L87 Difference]: Start difference. First operand 431 states and 568 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-17 00:55:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:39,289 INFO L93 Difference]: Finished difference Result 1462 states and 2036 transitions. [2021-11-17 00:55:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:55:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2021-11-17 00:55:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:39,295 INFO L225 Difference]: With dead ends: 1462 [2021-11-17 00:55:39,296 INFO L226 Difference]: Without dead ends: 1032 [2021-11-17 00:55:39,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:55:39,298 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 514 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:39,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 1331 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 00:55:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2021-11-17 00:55:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 840. [2021-11-17 00:55:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 661 states have (on average 1.3222390317700454) internal successors, (874), 665 states have internal predecessors, (874), 118 states have call successors, (118), 61 states have call predecessors, (118), 60 states have return successors, (145), 117 states have call predecessors, (145), 117 states have call successors, (145) [2021-11-17 00:55:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1137 transitions. [2021-11-17 00:55:39,344 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1137 transitions. Word has length 77 [2021-11-17 00:55:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:39,344 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1137 transitions. [2021-11-17 00:55:39,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-17 00:55:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1137 transitions. [2021-11-17 00:55:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-17 00:55:39,350 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:39,350 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:39,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 00:55:39,351 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:39,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:39,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1596249494, now seen corresponding path program 1 times [2021-11-17 00:55:39,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:55:39,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067861115] [2021-11-17 00:55:39,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:39,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:55:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:55:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:55:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:55:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 00:55:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:55:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 00:55:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-17 00:55:39,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:55:39,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067861115] [2021-11-17 00:55:39,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067861115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:39,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:39,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:55:39,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452318188] [2021-11-17 00:55:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:39,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:55:39,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:55:39,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:55:39,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:55:39,526 INFO L87 Difference]: Start difference. First operand 840 states and 1137 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-17 00:55:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:40,330 INFO L93 Difference]: Finished difference Result 2912 states and 3997 transitions. [2021-11-17 00:55:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 00:55:40,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 119 [2021-11-17 00:55:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:40,341 INFO L225 Difference]: With dead ends: 2912 [2021-11-17 00:55:40,341 INFO L226 Difference]: Without dead ends: 2078 [2021-11-17 00:55:40,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:55:40,347 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 577 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:40,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 1163 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 00:55:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2021-11-17 00:55:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1662. [2021-11-17 00:55:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1311 states have (on average 1.297482837528604) internal successors, (1701), 1319 states have internal predecessors, (1701), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2021-11-17 00:55:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2208 transitions. [2021-11-17 00:55:40,443 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2208 transitions. Word has length 119 [2021-11-17 00:55:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:40,443 INFO L470 AbstractCegarLoop]: Abstraction has 1662 states and 2208 transitions. [2021-11-17 00:55:40,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-17 00:55:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2208 transitions. [2021-11-17 00:55:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-17 00:55:40,449 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:40,449 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:40,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 00:55:40,450 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:40,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash 162596766, now seen corresponding path program 1 times [2021-11-17 00:55:40,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:55:40,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767280509] [2021-11-17 00:55:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:40,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:55:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:55:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:55:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:55:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 00:55:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:55:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 00:55:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-17 00:55:40,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:55:40,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767280509] [2021-11-17 00:55:40,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767280509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:40,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:40,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:55:40,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713244147] [2021-11-17 00:55:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:40,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:55:40,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:55:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:55:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:55:40,648 INFO L87 Difference]: Start difference. First operand 1662 states and 2208 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-17 00:55:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:41,116 INFO L93 Difference]: Finished difference Result 2954 states and 4105 transitions. [2021-11-17 00:55:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:55:41,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 119 [2021-11-17 00:55:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:41,126 INFO L225 Difference]: With dead ends: 2954 [2021-11-17 00:55:41,126 INFO L226 Difference]: Without dead ends: 2070 [2021-11-17 00:55:41,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:55:41,130 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 163 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:41,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 1029 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 00:55:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2021-11-17 00:55:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1670. [2021-11-17 00:55:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1319 states have (on average 1.2956785443517818) internal successors, (1709), 1327 states have internal predecessors, (1709), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2021-11-17 00:55:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2021-11-17 00:55:41,226 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 119 [2021-11-17 00:55:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:41,226 INFO L470 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2021-11-17 00:55:41,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-17 00:55:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2021-11-17 00:55:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-17 00:55:41,231 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:41,231 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:41,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 00:55:41,231 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1319541292, now seen corresponding path program 1 times [2021-11-17 00:55:41,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:55:41,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749254297] [2021-11-17 00:55:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:41,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:55:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:55:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:55:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:55:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 00:55:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:55:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:55:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 00:55:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-17 00:55:41,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:55:41,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749254297] [2021-11-17 00:55:41,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749254297] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:41,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:41,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-17 00:55:41,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451617109] [2021-11-17 00:55:41,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:41,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-17 00:55:41,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:55:41,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-17 00:55:41,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:55:41,469 INFO L87 Difference]: Start difference. First operand 1670 states and 2216 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-17 00:55:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:42,929 INFO L93 Difference]: Finished difference Result 4250 states and 5733 transitions. [2021-11-17 00:55:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-17 00:55:42,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 127 [2021-11-17 00:55:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:42,942 INFO L225 Difference]: With dead ends: 4250 [2021-11-17 00:55:42,942 INFO L226 Difference]: Without dead ends: 2586 [2021-11-17 00:55:42,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2021-11-17 00:55:42,948 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 1395 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:42,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1411 Valid, 1692 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 00:55:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2021-11-17 00:55:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1698. [2021-11-17 00:55:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1335 states have (on average 1.2831460674157302) internal successors, (1713), 1347 states have internal predecessors, (1713), 222 states have call successors, (222), 125 states have call predecessors, (222), 140 states have return successors, (257), 233 states have call predecessors, (257), 221 states have call successors, (257) [2021-11-17 00:55:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2192 transitions. [2021-11-17 00:55:43,032 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2192 transitions. Word has length 127 [2021-11-17 00:55:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:43,034 INFO L470 AbstractCegarLoop]: Abstraction has 1698 states and 2192 transitions. [2021-11-17 00:55:43,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-17 00:55:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2192 transitions. [2021-11-17 00:55:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-17 00:55:43,039 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:43,039 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:43,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 00:55:43,040 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash -239915446, now seen corresponding path program 1 times [2021-11-17 00:55:43,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:55:43,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145716521] [2021-11-17 00:55:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:43,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:55:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:55:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:55:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:55:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 00:55:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:55:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 00:55:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:55:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-11-17 00:55:43,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:55:43,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145716521] [2021-11-17 00:55:43,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145716521] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:43,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:43,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-17 00:55:43,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066018918] [2021-11-17 00:55:43,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:43,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-17 00:55:43,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:55:43,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-17 00:55:43,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:55:43,381 INFO L87 Difference]: Start difference. First operand 1698 states and 2192 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2021-11-17 00:55:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:45,560 INFO L93 Difference]: Finished difference Result 4534 states and 6177 transitions. [2021-11-17 00:55:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-17 00:55:45,561 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) Word has length 151 [2021-11-17 00:55:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:45,580 INFO L225 Difference]: With dead ends: 4534 [2021-11-17 00:55:45,581 INFO L226 Difference]: Without dead ends: 3606 [2021-11-17 00:55:45,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2021-11-17 00:55:45,586 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 2065 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 2571 SdHoareTripleChecker+Invalid, 3242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:45,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2102 Valid, 2571 Invalid, 3242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1035 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-17 00:55:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2021-11-17 00:55:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 2234. [2021-11-17 00:55:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 1731 states have (on average 1.2576545349508954) internal successors, (2177), 1755 states have internal predecessors, (2177), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2021-11-17 00:55:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2872 transitions. [2021-11-17 00:55:45,785 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2872 transitions. Word has length 151 [2021-11-17 00:55:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:45,785 INFO L470 AbstractCegarLoop]: Abstraction has 2234 states and 2872 transitions. [2021-11-17 00:55:45,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2021-11-17 00:55:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2872 transitions. [2021-11-17 00:55:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-17 00:55:45,790 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:45,791 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:45,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 00:55:45,791 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash -405882487, now seen corresponding path program 1 times [2021-11-17 00:55:45,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:55:45,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359872140] [2021-11-17 00:55:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:45,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:55:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:55:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:55:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:55:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 00:55:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:55:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 00:55:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 00:55:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:55:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:45,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:55:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-11-17 00:55:46,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:55:46,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359872140] [2021-11-17 00:55:46,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359872140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:46,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:46,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 00:55:46,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608947756] [2021-11-17 00:55:46,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:46,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 00:55:46,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:55:46,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 00:55:46,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:55:46,013 INFO L87 Difference]: Start difference. First operand 2234 states and 2872 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-17 00:55:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:46,532 INFO L93 Difference]: Finished difference Result 4214 states and 5577 transitions. [2021-11-17 00:55:46,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 00:55:46,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 153 [2021-11-17 00:55:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:46,543 INFO L225 Difference]: With dead ends: 4214 [2021-11-17 00:55:46,543 INFO L226 Difference]: Without dead ends: 2818 [2021-11-17 00:55:46,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:55:46,547 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 305 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:46,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 997 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 00:55:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2021-11-17 00:55:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2234. [2021-11-17 00:55:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 1731 states have (on average 1.2484113229347198) internal successors, (2161), 1755 states have internal predecessors, (2161), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2021-11-17 00:55:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2856 transitions. [2021-11-17 00:55:46,641 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2856 transitions. Word has length 153 [2021-11-17 00:55:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:46,641 INFO L470 AbstractCegarLoop]: Abstraction has 2234 states and 2856 transitions. [2021-11-17 00:55:46,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-17 00:55:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2856 transitions. [2021-11-17 00:55:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-17 00:55:46,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:46,646 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:46,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 00:55:46,646 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:46,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:46,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1648213824, now seen corresponding path program 1 times [2021-11-17 00:55:46,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:55:46,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396267374] [2021-11-17 00:55:46,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:46,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:55:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-17 00:55:46,741 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-17 00:55:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-17 00:55:46,898 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-17 00:55:46,899 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-17 00:55:46,900 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-17 00:55:46,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 00:55:46,904 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:46,906 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-17 00:55:47,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:55:47 BoogieIcfgContainer [2021-11-17 00:55:47,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-17 00:55:47,024 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-17 00:55:47,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-17 00:55:47,025 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-17 00:55:47,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:55:36" (3/4) ... [2021-11-17 00:55:47,026 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-17 00:55:47,123 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-17 00:55:47,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-17 00:55:47,124 INFO L158 Benchmark]: Toolchain (without parser) took 12957.10ms. Allocated memory was 96.5MB in the beginning and 308.3MB in the end (delta: 211.8MB). Free memory was 57.8MB in the beginning and 105.7MB in the end (delta: -47.9MB). Peak memory consumption was 163.5MB. Max. memory is 16.1GB. [2021-11-17 00:55:47,125 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 00:55:47,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1120.57ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 57.8MB in the beginning and 63.1MB in the end (delta: -5.3MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2021-11-17 00:55:47,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.10ms. Allocated memory is still 121.6MB. Free memory was 63.1MB in the beginning and 58.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-17 00:55:47,127 INFO L158 Benchmark]: Boogie Preprocessor took 95.46ms. Allocated memory is still 121.6MB. Free memory was 58.3MB in the beginning and 53.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-17 00:55:47,128 INFO L158 Benchmark]: RCFGBuilder took 1014.13ms. Allocated memory is still 121.6MB. Free memory was 53.6MB in the beginning and 73.4MB in the end (delta: -19.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2021-11-17 00:55:47,128 INFO L158 Benchmark]: TraceAbstraction took 10525.63ms. Allocated memory was 121.6MB in the beginning and 308.3MB in the end (delta: 186.6MB). Free memory was 73.4MB in the beginning and 128.8MB in the end (delta: -55.4MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2021-11-17 00:55:47,129 INFO L158 Benchmark]: Witness Printer took 99.67ms. Allocated memory is still 308.3MB. Free memory was 128.8MB in the beginning and 105.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-17 00:55:47,130 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1120.57ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 57.8MB in the beginning and 63.1MB in the end (delta: -5.3MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.10ms. Allocated memory is still 121.6MB. Free memory was 63.1MB in the beginning and 58.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.46ms. Allocated memory is still 121.6MB. Free memory was 58.3MB in the beginning and 53.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1014.13ms. Allocated memory is still 121.6MB. Free memory was 53.6MB in the beginning and 73.4MB in the end (delta: -19.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10525.63ms. Allocated memory was 121.6MB in the beginning and 308.3MB in the end (delta: 186.6MB). Free memory was 73.4MB in the beginning and 128.8MB in the end (delta: -55.4MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. * Witness Printer took 99.67ms. Allocated memory is still 308.3MB. Free memory was 128.8MB in the beginning and 105.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 5320]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L5343] int LDV_IN_INTERRUPT = 1; [L5344] struct sk_buff *proto_group0 ; [L5345] int ref_cnt ; [L5346] int ldv_state_variable_1 ; [L5347] struct net_device *proto_group1 ; [L5348] int ldv_state_variable_0 ; [L5564-L5566] static struct hdlc_proto proto = {& x25_open, & x25_close, 0, 0, 0, & x25_ioctl, 0, & x25_rx, & x25_xmit, & __this_module, 0}; [L5633] int ldv_retval_0 ; [L5634] int ldv_retval_1 ; [L5837] Element set_impl[15] ; [L5838] int last_index = 0; [L5972] Set LDV_SKBS ; VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5651] struct ifreq *ldvarg0 ; [L5652] void *tmp ; [L5653] int tmp___0 ; [L5654] int tmp___1 ; [L5655] int tmp___2 ; VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5657] CALL, EXPR ldv_successful_zalloc(40UL) VAL [\old(__size)=40, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=40, __size=40, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=40, __size=40, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-2:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103238:36893488147419103237}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=40, __size=40, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-2:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5264] return p; VAL [\old(__size)=40, \result={-2:0}, __size=40, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-2:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5657] RET, EXPR ldv_successful_zalloc(40UL) VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_successful_zalloc(40UL)={-2:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5657] tmp = ldv_successful_zalloc(40UL) [L5658] ldvarg0 = (struct ifreq *)tmp [L5659] CALL ldv_initialize() [L5991] CALL ldv_set_init(LDV_SKBS) [L5843] set = set_impl [L5844] last_index = 0 VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={36893488147419103235:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5991] RET ldv_set_init(LDV_SKBS) [L5659] RET ldv_initialize() [L5660] ldv_state_variable_1 = 0 [L5661] ref_cnt = 0 [L5662] ldv_state_variable_0 = 1 VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: [L5731] case 1: VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=1] [L5732] COND TRUE ldv_state_variable_0 != 0 [L5733] tmp___2 = __VERIFIER_nondet_int() [L5735] case 0: [L5743] case 1: VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=1, tmp___2=1] [L5744] COND TRUE ldv_state_variable_0 == 1 [L5745] CALL, EXPR mod_init() [L5622] FCALL register_hdlc_protocol(& proto) [L5623] return (0); VAL [\result=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5745] RET, EXPR mod_init() [L5745] ldv_retval_1 = mod_init() [L5746] COND TRUE ldv_retval_1 == 0 [L5747] ldv_state_variable_0 = 3 [L5748] ldv_state_variable_1 = 1 [L5749] CALL ldv_initialize_hdlc_proto_1() [L5639] void *tmp ; [L5640] void *tmp___0 ; VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5642] CALL, EXPR ldv_successful_zalloc(3264UL) VAL [\old(__size)=3264, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=3264, __size=3264, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=3264, __size=3264, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-3:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103238:36893488147419103237}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=3264, __size=3264, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-3:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5264] return p; VAL [\old(__size)=3264, \result={-3:0}, __size=3264, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-3:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5642] RET, EXPR ldv_successful_zalloc(3264UL) VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(3264UL)={-3:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5642] tmp = ldv_successful_zalloc(3264UL) [L5643] proto_group1 = (struct net_device *)tmp VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-3:0}] [L5644] CALL, EXPR ldv_successful_zalloc(232UL) VAL [\old(__size)=232, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=232, __size=232, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={18446744073709551617:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=232, __size=232, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={18446744073709551617:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551617:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103238:36893488147419103237}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=232, __size=232, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={18446744073709551617:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551617:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5264] return p; VAL [\old(__size)=232, \result={18446744073709551617:0}, __size=232, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={18446744073709551617:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={18446744073709551617:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5644] RET, EXPR ldv_successful_zalloc(232UL) VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(232UL)={18446744073709551617:0}, proto={36893488147419103234:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-3:0}] [L5644] tmp___0 = ldv_successful_zalloc(232UL) [L5645] proto_group0 = (struct sk_buff *)tmp___0 VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-3:0}, tmp___0={18446744073709551617:0}] [L5749] RET ldv_initialize_hdlc_proto_1() [L5752] COND FALSE !(ldv_retval_1 != 0) VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=1, tmp___2=1] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=0, tmp___2=1] [L5667] COND TRUE ldv_state_variable_1 != 0 [L5668] tmp___1 = __VERIFIER_nondet_int() [L5670] case 0: VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5671] COND TRUE ldv_state_variable_1 == 1 VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5672] CALL x25_xmit(proto_group0, proto_group1) VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5471] int result ; VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}] [L5473] CALL assume_abort_if_not(((void*)(skb)) != ((void*) 0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5473] RET assume_abort_if_not(((void*)(skb)) != ((void*) 0)) VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}] [L5474] EXPR skb->data VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data={0:36893488147419103236}] [L5474] CALL assume_abort_if_not(((void*)((skb->data))) != ((void*) 0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5474] RET assume_abort_if_not(((void*)((skb->data))) != ((void*) 0)) VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data={0:36893488147419103236}] [L5475] skb->data [L5476] case 0: [L5484] case 1: [L5485] CALL, EXPR lapb_connect_request(dev) [L6068] return __VERIFIER_nondet_int(); [L5485] RET, EXPR lapb_connect_request(dev) [L5485] result = lapb_connect_request(dev) [L5486] COND TRUE result != 0 VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={36893488147419103235:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data=257skb->data={0:36893488147419103236}] [L5487] COND TRUE result == 3 [L5488] CALL x25_connected(dev, 0) [L5428] CALL x25_connect_disconnect(dev, reason, 1) VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5409] struct sk_buff *skb ; [L5410] unsigned char *ptr ; [L5412] CALL, EXPR ldv_dev_alloc_skb_12(1U) [L5814] struct sk_buff *tmp ; VAL [\old(last_index)=0, \old(length)=1, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5816] CALL, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5975] void *skb ; [L5976] void *tmp___7 ; VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5978] CALL, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(__size)=248, \old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={36893488147419103232:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={36893488147419103232:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={36893488147419103232:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, \old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={36893488147419103232:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={36893488147419103232:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5264] return p; VAL [\old(__size)=248, \old(last_index)=0, \result={36893488147419103232:0}, __size=248, __this_module={36893488147419103238:36893488147419103237}, calloc(1UL, __size)={36893488147419103232:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={36893488147419103232:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5978] RET, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(sizeof(struct sk_buff___0 ))={36893488147419103232:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5978] tmp___7 = ldv_successful_zalloc(sizeof(struct sk_buff___0 )) [L5979] skb = (struct sk_buff___0 *)tmp___7 VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, skb={36893488147419103232:0}, tmp___7={36893488147419103232:0}] [L5980] COND FALSE !(! skb) [L5983] CALL ldv_set_add(LDV_SKBS, skb) [L5851] int i ; [L5853] i = 0 VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, e={36893488147419103232:0}, e={36893488147419103232:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5854] COND TRUE 1 VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, e={36893488147419103232:0}, e={36893488147419103232:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5855] COND FALSE !(i < last_index) VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, e={36893488147419103232:0}, e={36893488147419103232:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5865] COND TRUE last_index < 15 [L5866] set_impl[last_index] = e [L5867] last_index = last_index + 1 VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, e={36893488147419103232:0}, e={36893488147419103232:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5983] RET ldv_set_add(LDV_SKBS, skb) [L5984] return (skb); VAL [\old(last_index)=0, \result={36893488147419103232:0}, __this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, skb={36893488147419103232:0}, tmp___7={36893488147419103232:0}] [L5816] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, \old(length)=1, __this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_skb_alloc()={36893488147419103232:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5816] tmp = ldv_skb_alloc() [L5817] return (tmp); VAL [\old(last_index)=0, \old(length)=1, \result={36893488147419103232:0}, __this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={36893488147419103232:0}] [L5412] RET, EXPR ldv_dev_alloc_skb_12(1U) [L5412] skb = ldv_dev_alloc_skb_12(1U) [L5413] COND TRUE (unsigned long )skb == (unsigned long )((struct sk_buff *)0) [L5428] RET x25_connect_disconnect(dev, reason, 1) VAL [\old(last_index)=0, \old(reason)=0, __this_module={36893488147419103238:36893488147419103237}, dev={-3:0}, dev={-3:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, reason=0, ref_cnt=0, set_impl={36893488147419103235:0}] [L5488] RET x25_connected(dev, 0) [L5512] CALL ldv_skb_free(skb) VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, skb={18446744073709551617:0}] [L5998] CALL ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, e={18446744073709551617:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set_impl={36893488147419103235:0}] [L5876] int i ; [L5877] int deleted_index ; [L5879] deleted_index = -1 [L5880] i = 0 VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5881] COND TRUE 1 VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5882] COND TRUE i < last_index VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5886] EXPR set_impl[i] VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}, set_impl[i]={36893488147419103232:0}] [L5886] COND FALSE !((unsigned long )set_impl[i] == (unsigned long )e) [L5891] i = i + 1 VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5881] COND TRUE 1 VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5882] COND FALSE !(i < last_index) VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5893] COND FALSE !(deleted_index != -1) VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, deleted_index=-1, e={18446744073709551617:0}, e={18446744073709551617:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L5998] RET ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}] [L5512] RET ldv_skb_free(skb) VAL [\old(last_index)=0, __this_module={36893488147419103238:36893488147419103237}, dev={-3:0}, dev={-3:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={36893488147419103235:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data=257skb->data={0:36893488147419103236}] [L5513] return (0); VAL [\old(last_index)=0, \result=0, __this_module={36893488147419103238:36893488147419103237}, dev={-3:0}, dev={-3:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={36893488147419103235:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data=257skb->data={0:36893488147419103236}] [L5672] RET x25_xmit(proto_group0, proto_group1) VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1, x25_xmit(proto_group0, proto_group1)=0] [L5673] ldv_state_variable_1 = 1 VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5676] COND FALSE !(ldv_state_variable_1 == 2) VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: [L5731] case 1: VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=1, tmp___1=0, tmp___2=1] [L5732] COND TRUE ldv_state_variable_0 != 0 [L5733] tmp___2 = __VERIFIER_nondet_int() [L5735] case 0: VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=1, tmp___1=0, tmp___2=0] [L5736] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L5737] CALL mod_exit() [L5629] FCALL unregister_hdlc_protocol(& proto) [L5737] RET mod_exit() [L5738] ldv_state_variable_0 = 2 VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp={-2:0}, tmp___0=1, tmp___1=0, tmp___2=0] [L5773] CALL ldv_check_final_state() [L6042] int tmp___7 ; [L6044] CALL, EXPR ldv_set_is_empty(LDV_SKBS) [L5933] return (last_index == 0); VAL [\result=0, __this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={36893488147419103235:0}] [L6044] RET, EXPR ldv_set_is_empty(LDV_SKBS) [L6044] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L6045] COND FALSE !(\read(tmp___7)) VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}, tmp___7=0] [L6047] CALL ldv_error() VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] [L5320] reach_error() VAL [__this_module={36893488147419103238:36893488147419103237}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={36893488147419103234:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={36893488147419103235:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 238 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6487 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6384 mSDsluCounter, 10244 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7624 mSDsCounter, 2634 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5899 IncrementalHoareTripleChecker+Invalid, 8533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2634 mSolverCounterUnsat, 2620 mSDtfsCounter, 5899 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2234occurred in iteration=7, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 4068 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 969 NumberOfCodeBlocks, 969 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 1755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 542/542 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-17 00:55:47,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE