./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 dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 10:51:19,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:51:19,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:51:19,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:51:19,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:51:19,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:51:19,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:51:19,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:51:19,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:51:19,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:51:19,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:51:19,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:51:19,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:51:19,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:51:19,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:51:19,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:51:19,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:51:19,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:51:19,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:51:19,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:51:19,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:51:19,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:51:19,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:51:19,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:51:19,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:51:19,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:51:19,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:51:19,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:51:19,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:51:19,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:51:19,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:51:19,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:51:19,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:51:19,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:51:19,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:51:19,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:51:19,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:51:19,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:51:19,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:51:19,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:51:19,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:51:19,158 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-10-17 10:51:19,201 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:51:19,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:51:19,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:51:19,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:51:19,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:51:19,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:51:19,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:51:19,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:51:19,205 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:51:19,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:51:19,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:51:19,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:51:19,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:51:19,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:51:19,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:51:19,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:51:19,209 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:51:19,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:51:19,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:51:19,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:51:19,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:51:19,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:51:19,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:51:19,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:51:19,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:51:19,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:51:19,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:51:19,213 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:51:19,213 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:51:19,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:51:19,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ 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 [2022-10-17 10:51:19,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:51:19,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:51:19,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:51:19,558 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:51:19,559 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:51:19,560 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/../../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 [2022-10-17 10:51:19,654 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/data/53ec01f14/73d78040fa454a84bdfd027149ed54f9/FLAG6ba40c3b0 [2022-10-17 10:51:20,446 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:51:20,447 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/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 [2022-10-17 10:51:20,483 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/data/53ec01f14/73d78040fa454a84bdfd027149ed54f9/FLAG6ba40c3b0 [2022-10-17 10:51:20,988 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/data/53ec01f14/73d78040fa454a84bdfd027149ed54f9 [2022-10-17 10:51:20,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:51:20,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:51:20,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:51:20,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:51:20,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:51:20,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:51:20" (1/1) ... [2022-10-17 10:51:20,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537d67d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:20, skipping insertion in model container [2022-10-17 10:51:21,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:51:20" (1/1) ... [2022-10-17 10:51:21,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:51:21,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:51:21,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/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] [2022-10-17 10:51:22,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:51:22,138 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:51:22,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/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] [2022-10-17 10:51:22,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:51:22,497 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:51:22,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22 WrapperNode [2022-10-17 10:51:22,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:51:22,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:51:22,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:51:22,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:51:22,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,628 INFO L138 Inliner]: procedures = 110, calls = 180, calls flagged for inlining = 54, calls inlined = 43, statements flattened = 631 [2022-10-17 10:51:22,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:51:22,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:51:22,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:51:22,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:51:22,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,744 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:51:22,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:51:22,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:51:22,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:51:22,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (1/1) ... [2022-10-17 10:51:22,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:51:22,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:51:22,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:51:22,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:51:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-17 10:51:22,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-17 10:51:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-17 10:51:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-10-17 10:51:22,872 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-10-17 10:51:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-10-17 10:51:22,873 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-10-17 10:51:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-10-17 10:51:22,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-10-17 10:51:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-17 10:51:22,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-17 10:51:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-10-17 10:51:22,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-10-17 10:51:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:51:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-17 10:51:22,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-17 10:51:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure x25_ioctl [2022-10-17 10:51:22,874 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_ioctl [2022-10-17 10:51:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-10-17 10:51:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-10-17 10:51:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-17 10:51:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-17 10:51:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure x25_connect_disconnect [2022-10-17 10:51:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_connect_disconnect [2022-10-17 10:51:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-17 10:51:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-10-17 10:51:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-10-17 10:51:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:51:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2022-10-17 10:51:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2022-10-17 10:51:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure x25_xmit [2022-10-17 10:51:22,878 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_xmit [2022-10-17 10:51:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:51:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-17 10:51:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-17 10:51:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-10-17 10:51:22,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-10-17 10:51:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:51:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-17 10:51:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-10-17 10:51:22,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-10-17 10:51:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure x25_rx [2022-10-17 10:51:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_rx [2022-10-17 10:51:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:51:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:51:22,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:51:23,271 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:51:23,273 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:51:23,605 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-17 10:51:24,114 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:51:24,134 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:51:24,134 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-17 10:51:24,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:51:24 BoogieIcfgContainer [2022-10-17 10:51:24,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:51:24,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:51:24,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:51:24,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:51:24,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:51:20" (1/3) ... [2022-10-17 10:51:24,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3a60fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:51:24, skipping insertion in model container [2022-10-17 10:51:24,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:51:22" (2/3) ... [2022-10-17 10:51:24,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3a60fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:51:24, skipping insertion in model container [2022-10-17 10:51:24,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:51:24" (3/3) ... [2022-10-17 10:51:24,150 INFO L112 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 [2022-10-17 10:51:24,171 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:51:24,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-17 10:51:24,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:51:24,292 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@beb75e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:51:24,292 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-17 10:51:24,299 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) [2022-10-17 10:51:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-17 10:51:24,314 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:51:24,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:51:24,315 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:51:24,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:51:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash 898254007, now seen corresponding path program 1 times [2022-10-17 10:51:24,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:51:24,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130963922] [2022-10-17 10:51:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:51:24,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:51:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:24,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:51:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:24,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:51:24,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:51:24,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130963922] [2022-10-17 10:51:24,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130963922] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:51:24,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:51:24,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:51:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612247109] [2022-10-17 10:51:24,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:51:24,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:51:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:51:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:51:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:51:24,960 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) [2022-10-17 10:51:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:51:25,865 INFO L93 Difference]: Finished difference Result 786 states and 1141 transitions. [2022-10-17 10:51:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:51:25,868 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 [2022-10-17 10:51:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:51:25,901 INFO L225 Difference]: With dead ends: 786 [2022-10-17 10:51:25,901 INFO L226 Difference]: Without dead ends: 540 [2022-10-17 10:51:25,911 INFO L412 NwaCegarLoop]: 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 [2022-10-17 10:51:25,921 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 753 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-17 10:51:25,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 702 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-17 10:51:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-10-17 10:51:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 432. [2022-10-17 10:51:26,047 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) [2022-10-17 10:51:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 572 transitions. [2022-10-17 10:51:26,053 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 572 transitions. Word has length 33 [2022-10-17 10:51:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:51:26,054 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 572 transitions. [2022-10-17 10:51:26,054 INFO L496 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) [2022-10-17 10:51:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2022-10-17 10:51:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-17 10:51:26,057 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:51:26,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:51:26,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:51:26,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:51:26,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:51:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1941540429, now seen corresponding path program 1 times [2022-10-17 10:51:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:51:26,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731695501] [2022-10-17 10:51:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:51:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:51:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:26,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:51:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:26,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:26,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:51:26,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:51:26,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731695501] [2022-10-17 10:51:26,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731695501] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:51:26,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:51:26,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:51:26,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502308838] [2022-10-17 10:51:26,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:51:26,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:51:26,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:51:26,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:51:26,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:51:26,237 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) [2022-10-17 10:51:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:51:26,799 INFO L93 Difference]: Finished difference Result 965 states and 1293 transitions. [2022-10-17 10:51:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:51:26,800 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 [2022-10-17 10:51:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:51:26,805 INFO L225 Difference]: With dead ends: 965 [2022-10-17 10:51:26,805 INFO L226 Difference]: Without dead ends: 539 [2022-10-17 10:51:26,807 INFO L412 NwaCegarLoop]: 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 [2022-10-17 10:51:26,808 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 613 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-17 10:51:26,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 743 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-17 10:51:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-10-17 10:51:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 431. [2022-10-17 10:51:26,857 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) [2022-10-17 10:51:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 568 transitions. [2022-10-17 10:51:26,861 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 568 transitions. Word has length 36 [2022-10-17 10:51:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:51:26,862 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 568 transitions. [2022-10-17 10:51:26,862 INFO L496 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) [2022-10-17 10:51:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 568 transitions. [2022-10-17 10:51:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-17 10:51:26,868 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:51:26,868 INFO L195 NwaCegarLoop]: 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] [2022-10-17 10:51:26,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:51:26,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:51:26,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:51:26,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2029658452, now seen corresponding path program 1 times [2022-10-17 10:51:26,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:51:26,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100995873] [2022-10-17 10:51:26,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:51:26,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:51:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:27,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:51:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:27,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:27,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-17 10:51:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:27,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:27,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:27,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-17 10:51:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:27,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-17 10:51:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:51:27,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100995873] [2022-10-17 10:51:27,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100995873] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:51:27,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:51:27,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:51:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739844043] [2022-10-17 10:51:27,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:51:27,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:51:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:51:27,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:51:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:51:27,281 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) [2022-10-17 10:51:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:51:28,259 INFO L93 Difference]: Finished difference Result 1462 states and 2036 transitions. [2022-10-17 10:51:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:51:28,260 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 [2022-10-17 10:51:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:51:28,273 INFO L225 Difference]: With dead ends: 1462 [2022-10-17 10:51:28,273 INFO L226 Difference]: Without dead ends: 1032 [2022-10-17 10:51:28,276 INFO L412 NwaCegarLoop]: 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 [2022-10-17 10:51:28,283 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 504 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-17 10:51:28,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1352 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-17 10:51:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-10-17 10:51:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 840. [2022-10-17 10:51:28,415 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) [2022-10-17 10:51:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1137 transitions. [2022-10-17 10:51:28,425 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1137 transitions. Word has length 77 [2022-10-17 10:51:28,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:51:28,427 INFO L495 AbstractCegarLoop]: Abstraction has 840 states and 1137 transitions. [2022-10-17 10:51:28,428 INFO L496 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) [2022-10-17 10:51:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1137 transitions. [2022-10-17 10:51:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-10-17 10:51:28,434 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:51:28,435 INFO L195 NwaCegarLoop]: 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] [2022-10-17 10:51:28,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:51:28,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:51:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:51:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1596249494, now seen corresponding path program 1 times [2022-10-17 10:51:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:51:28,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472182780] [2022-10-17 10:51:28,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:51:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:51:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:51:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-17 10:51:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-17 10:51:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-17 10:51:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-17 10:51:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:51:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-10-17 10:51:28,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:51:28,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472182780] [2022-10-17 10:51:28,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472182780] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:51:28,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:51:28,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:51:28,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12093787] [2022-10-17 10:51:28,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:51:28,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:51:28,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:51:28,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:51:28,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:51:28,748 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) [2022-10-17 10:51:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:51:29,979 INFO L93 Difference]: Finished difference Result 2912 states and 3997 transitions. [2022-10-17 10:51:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:51:29,980 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 [2022-10-17 10:51:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:51:29,995 INFO L225 Difference]: With dead ends: 2912 [2022-10-17 10:51:29,995 INFO L226 Difference]: Without dead ends: 2078 [2022-10-17 10:51:30,000 INFO L412 NwaCegarLoop]: 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 [2022-10-17 10:51:30,001 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 578 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-17 10:51:30,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1144 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-17 10:51:30,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-10-17 10:51:30,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1662. [2022-10-17 10:51:30,210 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) [2022-10-17 10:51:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2208 transitions. [2022-10-17 10:51:30,223 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2208 transitions. Word has length 119 [2022-10-17 10:51:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:51:30,223 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 2208 transitions. [2022-10-17 10:51:30,224 INFO L496 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) [2022-10-17 10:51:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2208 transitions. [2022-10-17 10:51:30,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-10-17 10:51:30,230 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:51:30,230 INFO L195 NwaCegarLoop]: 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] [2022-10-17 10:51:30,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:51:30,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:51:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:51:30,231 INFO L85 PathProgramCache]: Analyzing trace with hash 162596766, now seen corresponding path program 1 times [2022-10-17 10:51:30,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:51:30,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230173740] [2022-10-17 10:51:30,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:51:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:51:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:51:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-17 10:51:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-17 10:51:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-17 10:51:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-17 10:51:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:51:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-10-17 10:51:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:51:30,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230173740] [2022-10-17 10:51:30,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230173740] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:51:30,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:51:30,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:51:30,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228230353] [2022-10-17 10:51:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:51:30,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:51:30,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:51:30,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:51:30,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:51:30,632 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) [2022-10-17 10:51:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:51:31,421 INFO L93 Difference]: Finished difference Result 2954 states and 4105 transitions. [2022-10-17 10:51:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:51:31,421 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 [2022-10-17 10:51:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:51:31,436 INFO L225 Difference]: With dead ends: 2954 [2022-10-17 10:51:31,436 INFO L226 Difference]: Without dead ends: 2070 [2022-10-17 10:51:31,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:51:31,441 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 163 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-17 10:51:31,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1016 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-17 10:51:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2022-10-17 10:51:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1670. [2022-10-17 10:51:31,601 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) [2022-10-17 10:51:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2022-10-17 10:51:31,613 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 119 [2022-10-17 10:51:31,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:51:31,614 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2022-10-17 10:51:31,614 INFO L496 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) [2022-10-17 10:51:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2022-10-17 10:51:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-10-17 10:51:31,620 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:51:31,620 INFO L195 NwaCegarLoop]: 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] [2022-10-17 10:51:31,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:51:31,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:51:31,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:51:31,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1319541292, now seen corresponding path program 1 times [2022-10-17 10:51:31,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:51:31,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009315826] [2022-10-17 10:51:31,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:51:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:51:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:51:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:31,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-17 10:51:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:31,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-17 10:51:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:31,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-17 10:51:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:32,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-17 10:51:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-17 10:51:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:51:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-10-17 10:51:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:51:32,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009315826] [2022-10-17 10:51:32,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009315826] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:51:32,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:51:32,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-10-17 10:51:32,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62508953] [2022-10-17 10:51:32,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:51:32,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-17 10:51:32,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:51:32,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-17 10:51:32,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-10-17 10:51:32,268 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) [2022-10-17 10:51:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:51:34,323 INFO L93 Difference]: Finished difference Result 4250 states and 5733 transitions. [2022-10-17 10:51:34,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-17 10:51:34,323 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 [2022-10-17 10:51:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:51:34,339 INFO L225 Difference]: With dead ends: 4250 [2022-10-17 10:51:34,339 INFO L226 Difference]: Without dead ends: 2586 [2022-10-17 10:51:34,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-10-17 10:51:34,346 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 1403 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-10-17 10:51:34,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 1676 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-10-17 10:51:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-10-17 10:51:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1698. [2022-10-17 10:51:34,505 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) [2022-10-17 10:51:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2192 transitions. [2022-10-17 10:51:34,517 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2192 transitions. Word has length 127 [2022-10-17 10:51:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:51:34,518 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 2192 transitions. [2022-10-17 10:51:34,518 INFO L496 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) [2022-10-17 10:51:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2192 transitions. [2022-10-17 10:51:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-10-17 10:51:34,524 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:51:34,524 INFO L195 NwaCegarLoop]: 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] [2022-10-17 10:51:34,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:51:34,525 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:51:34,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:51:34,525 INFO L85 PathProgramCache]: Analyzing trace with hash -239915446, now seen corresponding path program 1 times [2022-10-17 10:51:34,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:51:34,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255024748] [2022-10-17 10:51:34,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:51:34,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:51:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:51:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:34,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-17 10:51:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:34,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:34,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:34,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-17 10:51:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:34,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-17 10:51:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-17 10:51:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-17 10:51:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-17 10:51:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-10-17 10:51:35,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:51:35,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255024748] [2022-10-17 10:51:35,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255024748] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:51:35,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:51:35,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-10-17 10:51:35,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637831771] [2022-10-17 10:51:35,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:51:35,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-17 10:51:35,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:51:35,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-17 10:51:35,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-10-17 10:51:35,499 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) [2022-10-17 10:51:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:51:38,501 INFO L93 Difference]: Finished difference Result 4534 states and 6177 transitions. [2022-10-17 10:51:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-17 10:51:38,502 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 [2022-10-17 10:51:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:51:38,528 INFO L225 Difference]: With dead ends: 4534 [2022-10-17 10:51:38,529 INFO L226 Difference]: Without dead ends: 3606 [2022-10-17 10:51:38,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2022-10-17 10:51:38,535 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 2094 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 1041 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1041 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:51:38,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 2542 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1041 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-10-17 10:51:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2022-10-17 10:51:38,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 2234. [2022-10-17 10:51:38,820 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) [2022-10-17 10:51:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2872 transitions. [2022-10-17 10:51:38,831 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2872 transitions. Word has length 151 [2022-10-17 10:51:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:51:38,832 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 2872 transitions. [2022-10-17 10:51:38,832 INFO L496 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) [2022-10-17 10:51:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2872 transitions. [2022-10-17 10:51:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-10-17 10:51:38,839 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:51:38,839 INFO L195 NwaCegarLoop]: 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] [2022-10-17 10:51:38,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:51:38,840 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:51:38,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:51:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash -405882487, now seen corresponding path program 1 times [2022-10-17 10:51:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:51:38,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212002282] [2022-10-17 10:51:38,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:51:38,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:51:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:51:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-17 10:51:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-17 10:51:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-17 10:51:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-17 10:51:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-17 10:51:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-17 10:51:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-17 10:51:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-17 10:51:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:51:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-10-17 10:51:39,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:51:39,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212002282] [2022-10-17 10:51:39,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212002282] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:51:39,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:51:39,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:51:39,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642931300] [2022-10-17 10:51:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:51:39,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:51:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:51:39,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:51:39,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:51:39,271 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) [2022-10-17 10:51:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:51:40,139 INFO L93 Difference]: Finished difference Result 4214 states and 5577 transitions. [2022-10-17 10:51:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:51:40,140 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 [2022-10-17 10:51:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:51:40,166 INFO L225 Difference]: With dead ends: 4214 [2022-10-17 10:51:40,167 INFO L226 Difference]: Without dead ends: 2818 [2022-10-17 10:51:40,173 INFO L412 NwaCegarLoop]: 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 [2022-10-17 10:51:40,174 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 305 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-17 10:51:40,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 973 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-17 10:51:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2022-10-17 10:51:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2234. [2022-10-17 10:51:40,388 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) [2022-10-17 10:51:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2856 transitions. [2022-10-17 10:51:40,400 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2856 transitions. Word has length 153 [2022-10-17 10:51:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:51:40,401 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 2856 transitions. [2022-10-17 10:51:40,401 INFO L496 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) [2022-10-17 10:51:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2856 transitions. [2022-10-17 10:51:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-10-17 10:51:40,409 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:51:40,409 INFO L195 NwaCegarLoop]: 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] [2022-10-17 10:51:40,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:51:40,410 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:51:40,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:51:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1648213824, now seen corresponding path program 1 times [2022-10-17 10:51:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:51:40,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070476347] [2022-10-17 10:51:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:51:40,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:51:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:51:40,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:51:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:51:40,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:51:40,706 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:51:40,708 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-17 10:51:40,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:51:40,713 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:51:40,718 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:51:40,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:51:40 BoogieIcfgContainer [2022-10-17 10:51:40,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:51:40,893 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:51:40,893 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:51:40,894 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:51:40,894 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:51:24" (3/4) ... [2022-10-17 10:51:40,896 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 10:51:41,033 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:51:41,033 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:51:41,034 INFO L158 Benchmark]: Toolchain (without parser) took 20041.93ms. Allocated memory was 123.7MB in the beginning and 388.0MB in the end (delta: 264.2MB). Free memory was 78.7MB in the beginning and 311.3MB in the end (delta: -232.5MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. [2022-10-17 10:51:41,034 INFO L158 Benchmark]: CDTParser took 6.83ms. Allocated memory is still 123.7MB. Free memory was 96.4MB in the beginning and 103.2MB in the end (delta: -6.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:51:41,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1506.34ms. Allocated memory is still 123.7MB. Free memory was 78.5MB in the beginning and 65.1MB in the end (delta: 13.4MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2022-10-17 10:51:41,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.80ms. Allocated memory is still 123.7MB. Free memory was 65.1MB in the beginning and 60.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 10:51:41,035 INFO L158 Benchmark]: Boogie Preprocessor took 136.77ms. Allocated memory is still 123.7MB. Free memory was 60.4MB in the beginning and 55.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-10-17 10:51:41,036 INFO L158 Benchmark]: RCFGBuilder took 1361.09ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 55.1MB in the beginning and 82.2MB in the end (delta: -27.1MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2022-10-17 10:51:41,036 INFO L158 Benchmark]: TraceAbstraction took 16750.93ms. Allocated memory was 169.9MB in the beginning and 388.0MB in the end (delta: 218.1MB). Free memory was 81.7MB in the beginning and 111.9MB in the end (delta: -30.2MB). Peak memory consumption was 187.9MB. Max. memory is 16.1GB. [2022-10-17 10:51:41,037 INFO L158 Benchmark]: Witness Printer took 140.18ms. Allocated memory is still 388.0MB. Free memory was 111.9MB in the beginning and 311.3MB in the end (delta: -199.4MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2022-10-17 10:51:41,039 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 6.83ms. Allocated memory is still 123.7MB. Free memory was 96.4MB in the beginning and 103.2MB in the end (delta: -6.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1506.34ms. Allocated memory is still 123.7MB. Free memory was 78.5MB in the beginning and 65.1MB in the end (delta: 13.4MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.80ms. Allocated memory is still 123.7MB. Free memory was 65.1MB in the beginning and 60.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.77ms. Allocated memory is still 123.7MB. Free memory was 60.4MB in the beginning and 55.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1361.09ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 55.1MB in the beginning and 82.2MB in the end (delta: -27.1MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16750.93ms. Allocated memory was 169.9MB in the beginning and 388.0MB in the end (delta: 218.1MB). Free memory was 81.7MB in the beginning and 111.9MB in the end (delta: -30.2MB). Peak memory consumption was 187.9MB. Max. memory is 16.1GB. * Witness Printer took 140.18ms. Allocated memory is still 388.0MB. Free memory was 111.9MB in the beginning and 311.3MB in the end (delta: -199.4MB). Peak memory consumption was 11.4MB. 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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5651] struct ifreq *ldvarg0 ; [L5652] void *tmp ; [L5653] int tmp___0 ; [L5654] int tmp___1 ; [L5655] int tmp___2 ; VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5657] CALL, EXPR ldv_successful_zalloc(40UL) VAL [\old(__size)=40, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=40, __size=40, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=40, __size=40, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=40, __size=40, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5264] return p; VAL [\old(__size)=40, \result={-2:0}, __size=40, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5657] RET, EXPR ldv_successful_zalloc(40UL) VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={8:0}, set={0:0}, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: [L5731] case 1: VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5642] CALL, EXPR ldv_successful_zalloc(3264UL) VAL [\old(__size)=3264, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=3264, __size=3264, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=3264, __size=3264, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=3264, __size=3264, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5264] return p; VAL [\old(__size)=3264, \result={-3:0}, __size=3264, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5642] RET, EXPR ldv_successful_zalloc(3264UL) VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8:0}] [L5642] tmp = ldv_successful_zalloc(3264UL) [L5643] proto_group1 = (struct net_device *)tmp VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-3:0}] [L5644] CALL, EXPR ldv_successful_zalloc(232UL) VAL [\old(__size)=232, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=232, __size=232, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=232, __size=232, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=232, __size=232, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5264] return p; VAL [\old(__size)=232, \result={18446744073709551617:0}, __size=232, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5644] RET, EXPR ldv_successful_zalloc(232UL) VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-3:0}] [L5644] tmp___0 = ldv_successful_zalloc(232UL) [L5645] proto_group0 = (struct sk_buff *)tmp___0 VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=1, tmp___2=1] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5671] COND TRUE ldv_state_variable_1 == 1 VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5471] int result ; VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5473] RET assume_abort_if_not(((void*)(skb)) != ((void*) 0)) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}] [L5474] EXPR skb->data VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data={18446744073709551619:0}] [L5474] CALL assume_abort_if_not(((void*)((skb->data))) != ((void*) 0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5474] RET assume_abort_if_not(((void*)((skb->data))) != ((void*) 0)) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data={18446744073709551619:0}] [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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data=257skb->data={18446744073709551619:0}] [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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5816] CALL, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5975] void *skb ; [L5976] void *tmp___7 ; VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5978] CALL, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(__size)=248, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551616: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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551616: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={18446744073709551616:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551616: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={18446744073709551616:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5264] return p; VAL [\old(__size)=248, \old(last_index)=0, \result={18446744073709551616:0}, __size=248, __this_module={18446744073709551621:18446744073709551620}, calloc(1UL, __size)={18446744073709551616: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={18446744073709551616:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5978] RET, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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 ))={18446744073709551616:0}, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551616:0}, tmp___7={18446744073709551616: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={18446744073709551621:18446744073709551620}, e={18446744073709551616:0}, e={18446744073709551616: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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5854] COND TRUE 1 VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, e={18446744073709551616:0}, e={18446744073709551616: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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5855] COND FALSE !(i < last_index) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, e={18446744073709551616:0}, e={18446744073709551616: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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={18446744073709551621:18446744073709551620}, e={18446744073709551616:0}, e={18446744073709551616: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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5983] RET ldv_set_add(LDV_SKBS, skb) [L5984] return (skb); VAL [\old(last_index)=0, \result={18446744073709551616:0}, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551616:0}, tmp___7={18446744073709551616:0}] [L5816] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, \old(length)=1, __this_module={18446744073709551621:18446744073709551620}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_skb_alloc()={18446744073709551616:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5816] tmp = ldv_skb_alloc() [L5817] return (tmp); VAL [\old(last_index)=0, \old(length)=1, \result={18446744073709551616:0}, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={18446744073709551616: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, reason=0, ref_cnt=0, set_impl={8:0}] [L5488] RET x25_connected(dev, 0) [L5512] CALL ldv_skb_free(skb) VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}] [L5998] CALL ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set_impl={8:0}] [L5876] int i ; [L5877] int deleted_index ; [L5879] deleted_index = -1 [L5880] i = 0 VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5881] COND TRUE 1 VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5882] COND TRUE i < last_index VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5886] EXPR set_impl[i] VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}, set_impl[i]={18446744073709551616:0}] [L5886] COND FALSE !((unsigned long )set_impl[i] == (unsigned long )e) [L5891] i = i + 1 VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5881] COND TRUE 1 VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5882] COND FALSE !(i < last_index) VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5893] COND FALSE !(deleted_index != -1) VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8:0}] [L5998] RET ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}] [L5512] RET ldv_skb_free(skb) VAL [\old(last_index)=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data={18446744073709551619:0}skb->data=257] [L5513] return (0); VAL [\old(last_index)=0, \result=0, __this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={8:0}, skb={18446744073709551617:0}, skb={18446744073709551617:0}, skb->data=257skb->data={18446744073709551619:0}] [L5672] RET x25_xmit(proto_group0, proto_group1) VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5676] COND FALSE !(ldv_state_variable_1 == 2) VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}, tmp___7=0] [L6047] CALL ldv_error() VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] [L5320] reach_error() VAL [__this_module={18446744073709551621:18446744073709551620}, 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={7:0}, proto_group0={18446744073709551617:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 238 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6521 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6413 mSDsluCounter, 10148 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7520 mSDsCounter, 2643 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6039 IncrementalHoareTripleChecker+Invalid, 8682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2643 mSolverCounterUnsat, 2628 mSDtfsCounter, 6039 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.0s 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: 1.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 4068 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 969 NumberOfCodeBlocks, 969 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 1757 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! [2022-10-17 10:51:41,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dfcc040-4226-4891-843b-e9b563ce43c8/bin/uautomizer-J5u9QxTXDZ/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