./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/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_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc --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-5e519f3 [2022-11-02 21:08:34,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:08:34,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:08:34,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:08:34,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:08:34,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:08:34,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:08:34,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:08:34,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:08:34,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:08:34,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:08:34,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:08:34,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:08:34,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:08:34,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:08:34,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:08:34,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:08:34,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:08:34,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:08:34,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:08:34,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:08:34,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:08:34,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:08:34,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:08:34,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:08:34,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:08:34,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:08:34,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:08:34,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:08:34,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:08:34,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:08:34,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:08:34,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:08:34,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:08:34,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:08:34,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:08:34,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:08:34,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:08:34,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:08:34,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:08:34,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:08:34,244 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 21:08:34,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:08:34,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:08:34,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:08:34,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:08:34,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:08:34,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:08:34,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:08:34,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:08:34,290 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:08:34,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:08:34,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:08:34,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:08:34,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:08:34,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:08:34,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:08:34,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:08:34,293 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:08:34,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:08:34,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:08:34,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:08:34,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:08:34,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:08:34,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:08:34,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:08:34,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:08:34,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:08:34,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:08:34,295 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:08:34,296 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:08:34,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:08:34,296 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_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/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_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc 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-11-02 21:08:34,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:08:34,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:08:34,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:08:34,653 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:08:34,654 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:08:34,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/../../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-11-02 21:08:34,742 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/data/9a30ca33d/638c304521e7414bbb83b9c562b9511e/FLAGb46b80bf3 [2022-11-02 21:08:35,605 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:08:35,606 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/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-11-02 21:08:35,642 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/data/9a30ca33d/638c304521e7414bbb83b9c562b9511e/FLAGb46b80bf3 [2022-11-02 21:08:36,141 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/data/9a30ca33d/638c304521e7414bbb83b9c562b9511e [2022-11-02 21:08:36,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:08:36,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:08:36,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:08:36,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:08:36,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:08:36,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:08:36" (1/1) ... [2022-11-02 21:08:36,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df4ba18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:36, skipping insertion in model container [2022-11-02 21:08:36,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:08:36" (1/1) ... [2022-11-02 21:08:36,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:08:36,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:08:37,024 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_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/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-11-02 21:08:37,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:08:37,410 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:08:37,578 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_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/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-11-02 21:08:37,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:08:37,739 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:08:37,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37 WrapperNode [2022-11-02 21:08:37,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:08:37,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:08:37,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:08:37,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:08:37,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,849 INFO L138 Inliner]: procedures = 110, calls = 180, calls flagged for inlining = 54, calls inlined = 43, statements flattened = 631 [2022-11-02 21:08:37,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:08:37,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:08:37,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:08:37,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:08:37,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,895 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:08:37,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:08:37,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:08:37,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:08:37,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (1/1) ... [2022-11-02 21:08:37,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:08:37,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:37,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:08:37,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:08:38,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 21:08:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 21:08:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:08:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 21:08:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 21:08:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-11-02 21:08:38,017 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-11-02 21:08:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-02 21:08:38,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-02 21:08:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 21:08:38,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 21:08:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-11-02 21:08:38,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-11-02 21:08:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:08:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 21:08:38,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 21:08:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure x25_ioctl [2022-11-02 21:08:38,018 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_ioctl [2022-11-02 21:08:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-11-02 21:08:38,019 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-11-02 21:08:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 21:08:38,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 21:08:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure x25_connect_disconnect [2022-11-02 21:08:38,019 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_connect_disconnect [2022-11-02 21:08:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:08:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-11-02 21:08:38,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-11-02 21:08:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:08:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2022-11-02 21:08:38,020 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2022-11-02 21:08:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure x25_xmit [2022-11-02 21:08:38,021 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_xmit [2022-11-02 21:08:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:08:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:08:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:08:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-02 21:08:38,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-02 21:08:38,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:08:38,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:08:38,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-11-02 21:08:38,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-11-02 21:08:38,023 INFO L130 BoogieDeclarations]: Found specification of procedure x25_rx [2022-11-02 21:08:38,023 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_rx [2022-11-02 21:08:38,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:08:38,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:08:38,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:08:38,359 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:08:38,362 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:08:38,710 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 21:08:38,997 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:08:39,006 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:08:39,007 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 21:08:39,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:08:39 BoogieIcfgContainer [2022-11-02 21:08:39,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:08:39,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:08:39,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:08:39,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:08:39,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:08:36" (1/3) ... [2022-11-02 21:08:39,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abc60a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:08:39, skipping insertion in model container [2022-11-02 21:08:39,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:37" (2/3) ... [2022-11-02 21:08:39,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abc60a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:08:39, skipping insertion in model container [2022-11-02 21:08:39,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:08:39" (3/3) ... [2022-11-02 21:08:39,020 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-11-02 21:08:39,040 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:08:39,040 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:08:39,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:08:39,103 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;@7330f8cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:08:39,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:08:39,109 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-11-02 21:08:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 21:08:39,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:39,123 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-11-02 21:08:39,123 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:39,130 INFO L85 PathProgramCache]: Analyzing trace with hash 898254007, now seen corresponding path program 1 times [2022-11-02 21:08:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:39,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482011514] [2022-11-02 21:08:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:39,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:39,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:39,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:39,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482011514] [2022-11-02 21:08:39,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482011514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:39,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:39,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:08:39,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926817146] [2022-11-02 21:08:39,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:39,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:08:39,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:08:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:08:39,708 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-11-02 21:08:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:40,659 INFO L93 Difference]: Finished difference Result 786 states and 1141 transitions. [2022-11-02 21:08:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:08:40,663 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-11-02 21:08:40,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:40,678 INFO L225 Difference]: With dead ends: 786 [2022-11-02 21:08:40,678 INFO L226 Difference]: Without dead ends: 540 [2022-11-02 21:08:40,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:08:40,687 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 753 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:40,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 701 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 21:08:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-11-02 21:08:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 432. [2022-11-02 21:08:40,777 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-11-02 21:08:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 572 transitions. [2022-11-02 21:08:40,783 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 572 transitions. Word has length 33 [2022-11-02 21:08:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:40,784 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 572 transitions. [2022-11-02 21:08:40,784 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-11-02 21:08:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2022-11-02 21:08:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:08:40,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:40,799 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-11-02 21:08:40,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:08:40,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1941540429, now seen corresponding path program 1 times [2022-11-02 21:08:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:40,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642871707] [2022-11-02 21:08:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:40,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:40,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:41,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:41,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642871707] [2022-11-02 21:08:41,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642871707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:41,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:41,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:08:41,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072205784] [2022-11-02 21:08:41,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:41,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:08:41,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:41,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:08:41,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:08:41,033 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-11-02 21:08:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:41,595 INFO L93 Difference]: Finished difference Result 965 states and 1293 transitions. [2022-11-02 21:08:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:08:41,596 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-11-02 21:08:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:41,601 INFO L225 Difference]: With dead ends: 965 [2022-11-02 21:08:41,601 INFO L226 Difference]: Without dead ends: 539 [2022-11-02 21:08:41,604 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-11-02 21:08:41,606 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 613 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:41,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 740 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:08:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-11-02 21:08:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 431. [2022-11-02 21:08:41,668 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-11-02 21:08:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 568 transitions. [2022-11-02 21:08:41,670 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 568 transitions. Word has length 36 [2022-11-02 21:08:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:41,671 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 568 transitions. [2022-11-02 21:08:41,671 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-11-02 21:08:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 568 transitions. [2022-11-02 21:08:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 21:08:41,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:41,676 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-11-02 21:08:41,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:08:41,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2029658452, now seen corresponding path program 1 times [2022-11-02 21:08:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:41,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035442104] [2022-11-02 21:08:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:08:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 21:08:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 21:08:41,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:41,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035442104] [2022-11-02 21:08:41,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035442104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:41,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:41,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:08:41,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774626643] [2022-11-02 21:08:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:41,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:08:41,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:41,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:08:41,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:08:41,994 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-11-02 21:08:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:42,951 INFO L93 Difference]: Finished difference Result 1462 states and 2036 transitions. [2022-11-02 21:08:42,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:08:42,952 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-11-02 21:08:42,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:42,960 INFO L225 Difference]: With dead ends: 1462 [2022-11-02 21:08:42,960 INFO L226 Difference]: Without dead ends: 1032 [2022-11-02 21:08:42,963 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-11-02 21:08:42,969 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 504 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:42,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1289 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 21:08:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-11-02 21:08:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 840. [2022-11-02 21:08:43,044 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-11-02 21:08:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1137 transitions. [2022-11-02 21:08:43,049 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1137 transitions. Word has length 77 [2022-11-02 21:08:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:43,050 INFO L495 AbstractCegarLoop]: Abstraction has 840 states and 1137 transitions. [2022-11-02 21:08:43,050 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-11-02 21:08:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1137 transitions. [2022-11-02 21:08:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-02 21:08:43,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:43,057 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-11-02 21:08:43,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:08:43,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:43,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1596249494, now seen corresponding path program 1 times [2022-11-02 21:08:43,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:43,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85905979] [2022-11-02 21:08:43,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:43,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:08:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 21:08:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:08:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:08:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:08:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-02 21:08:43,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:43,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85905979] [2022-11-02 21:08:43,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85905979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:43,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:43,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:08:43,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092647614] [2022-11-02 21:08:43,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:43,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:08:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:43,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:08:43,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:08:43,309 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-11-02 21:08:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:44,506 INFO L93 Difference]: Finished difference Result 2912 states and 3997 transitions. [2022-11-02 21:08:44,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:08:44,507 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-11-02 21:08:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:44,520 INFO L225 Difference]: With dead ends: 2912 [2022-11-02 21:08:44,521 INFO L226 Difference]: Without dead ends: 2078 [2022-11-02 21:08:44,524 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-11-02 21:08:44,527 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 578 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:44,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1147 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:08:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-11-02 21:08:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1662. [2022-11-02 21:08:44,686 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-11-02 21:08:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2208 transitions. [2022-11-02 21:08:44,695 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2208 transitions. Word has length 119 [2022-11-02 21:08:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:44,696 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 2208 transitions. [2022-11-02 21:08:44,697 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-11-02 21:08:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2208 transitions. [2022-11-02 21:08:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-02 21:08:44,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:44,703 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-11-02 21:08:44,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:08:44,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash 162596766, now seen corresponding path program 1 times [2022-11-02 21:08:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:44,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912276361] [2022-11-02 21:08:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:44,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:08:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 21:08:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:08:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:08:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:08:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-02 21:08:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:45,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912276361] [2022-11-02 21:08:45,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912276361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:45,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:45,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:08:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103548802] [2022-11-02 21:08:45,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:45,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:08:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:08:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:08:45,009 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-11-02 21:08:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:45,735 INFO L93 Difference]: Finished difference Result 2954 states and 4105 transitions. [2022-11-02 21:08:45,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:08:45,735 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-11-02 21:08:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:45,752 INFO L225 Difference]: With dead ends: 2954 [2022-11-02 21:08:45,752 INFO L226 Difference]: Without dead ends: 2070 [2022-11-02 21:08:45,755 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-11-02 21:08:45,756 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 163 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:45,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1014 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:08:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2022-11-02 21:08:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1670. [2022-11-02 21:08:45,903 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-11-02 21:08:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2022-11-02 21:08:45,912 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 119 [2022-11-02 21:08:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:45,913 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2022-11-02 21:08:45,913 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-11-02 21:08:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2022-11-02 21:08:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 21:08:45,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:45,918 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-11-02 21:08:45,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:08:45,918 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:45,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:45,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1319541292, now seen corresponding path program 1 times [2022-11-02 21:08:45,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:45,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175901216] [2022-11-02 21:08:45,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:08:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 21:08:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:08:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:08:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:08:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:08:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-02 21:08:46,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:46,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175901216] [2022-11-02 21:08:46,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175901216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:46,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:46,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 21:08:46,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783341176] [2022-11-02 21:08:46,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:46,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 21:08:46,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:46,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:08:46,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:08:46,588 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-11-02 21:08:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:48,802 INFO L93 Difference]: Finished difference Result 4250 states and 5733 transitions. [2022-11-02 21:08:48,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 21:08:48,803 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-11-02 21:08:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:48,818 INFO L225 Difference]: With dead ends: 4250 [2022-11-02 21:08:48,818 INFO L226 Difference]: Without dead ends: 2586 [2022-11-02 21:08:48,824 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-11-02 21:08:48,825 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 1397 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:48,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 1692 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 21:08:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-11-02 21:08:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1698. [2022-11-02 21:08:48,975 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-11-02 21:08:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2192 transitions. [2022-11-02 21:08:48,984 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2192 transitions. Word has length 127 [2022-11-02 21:08:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:48,985 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 2192 transitions. [2022-11-02 21:08:48,985 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-11-02 21:08:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2192 transitions. [2022-11-02 21:08:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-02 21:08:48,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:48,990 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-11-02 21:08:48,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:08:48,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash -239915446, now seen corresponding path program 1 times [2022-11-02 21:08:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:48,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006397472] [2022-11-02 21:08:48,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:08:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 21:08:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:08:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:08:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:08:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 21:08:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-02 21:08:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006397472] [2022-11-02 21:08:49,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006397472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:49,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:49,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 21:08:49,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449579821] [2022-11-02 21:08:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:49,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 21:08:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:49,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:08:49,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:08:49,924 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-11-02 21:08:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:53,001 INFO L93 Difference]: Finished difference Result 4534 states and 6177 transitions. [2022-11-02 21:08:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-02 21:08:53,002 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-11-02 21:08:53,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:53,021 INFO L225 Difference]: With dead ends: 4534 [2022-11-02 21:08:53,022 INFO L226 Difference]: Without dead ends: 3606 [2022-11-02 21:08:53,026 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-11-02 21:08:53,028 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 2083 mSDsluCounter, 2027 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 1042 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2123 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1042 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:53,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2123 Valid, 2538 Invalid, 3223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1042 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:08:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2022-11-02 21:08:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 2234. [2022-11-02 21:08:53,306 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-11-02 21:08:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2872 transitions. [2022-11-02 21:08:53,314 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2872 transitions. Word has length 151 [2022-11-02 21:08:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:53,314 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 2872 transitions. [2022-11-02 21:08:53,315 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-11-02 21:08:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2872 transitions. [2022-11-02 21:08:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-02 21:08:53,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:53,320 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-11-02 21:08:53,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:08:53,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash -405882487, now seen corresponding path program 1 times [2022-11-02 21:08:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:53,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241836574] [2022-11-02 21:08:53,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:53,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:08:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 21:08:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:08:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:08:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:08:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 21:08:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-02 21:08:53,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:53,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241836574] [2022-11-02 21:08:53,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241836574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:53,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:53,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:08:53,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327726114] [2022-11-02 21:08:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:53,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:08:53,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:53,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:08:53,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:08:53,696 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-11-02 21:08:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:54,459 INFO L93 Difference]: Finished difference Result 4214 states and 5577 transitions. [2022-11-02 21:08:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:08:54,460 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-11-02 21:08:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:54,476 INFO L225 Difference]: With dead ends: 4214 [2022-11-02 21:08:54,476 INFO L226 Difference]: Without dead ends: 2818 [2022-11-02 21:08:54,481 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-11-02 21:08:54,482 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-11-02 21:08:54,483 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-11-02 21:08:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2022-11-02 21:08:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2234. [2022-11-02 21:08:54,662 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-11-02 21:08:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2856 transitions. [2022-11-02 21:08:54,670 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2856 transitions. Word has length 153 [2022-11-02 21:08:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:54,670 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 2856 transitions. [2022-11-02 21:08:54,670 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-11-02 21:08:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2856 transitions. [2022-11-02 21:08:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-02 21:08:54,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:54,676 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-11-02 21:08:54,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:08:54,676 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:54,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1648213824, now seen corresponding path program 1 times [2022-11-02 21:08:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:54,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301345385] [2022-11-02 21:08:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:08:54,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:08:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:08:54,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:08:54,936 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:08:54,937 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 21:08:54,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:08:54,942 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:54,946 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:08:55,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:08:55 BoogieIcfgContainer [2022-11-02 21:08:55,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:08:55,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:08:55,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:08:55,113 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:08:55,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:08:39" (3/4) ... [2022-11-02 21:08:55,116 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 21:08:55,245 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:08:55,245 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:08:55,246 INFO L158 Benchmark]: Toolchain (without parser) took 19096.82ms. Allocated memory was 142.6MB in the beginning and 390.1MB in the end (delta: 247.5MB). Free memory was 99.6MB in the beginning and 117.3MB in the end (delta: -17.6MB). Peak memory consumption was 229.0MB. Max. memory is 16.1GB. [2022-11-02 21:08:55,246 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 92.3MB. Free memory was 63.6MB in the beginning and 63.6MB in the end (delta: 31.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:08:55,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1590.73ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 96.2MB in the end (delta: 3.1MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2022-11-02 21:08:55,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.62ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 91.5MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 21:08:55,247 INFO L158 Benchmark]: Boogie Preprocessor took 54.47ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 86.2MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 21:08:55,248 INFO L158 Benchmark]: RCFGBuilder took 1104.60ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 86.2MB in the beginning and 133.3MB in the end (delta: -47.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-02 21:08:55,248 INFO L158 Benchmark]: TraceAbstraction took 16100.00ms. Allocated memory was 211.8MB in the beginning and 390.1MB in the end (delta: 178.3MB). Free memory was 132.3MB in the beginning and 137.2MB in the end (delta: -4.9MB). Peak memory consumption was 174.3MB. Max. memory is 16.1GB. [2022-11-02 21:08:55,249 INFO L158 Benchmark]: Witness Printer took 132.23ms. Allocated memory is still 390.1MB. Free memory was 137.2MB in the beginning and 117.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 21:08:55,251 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 92.3MB. Free memory was 63.6MB in the beginning and 63.6MB in the end (delta: 31.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1590.73ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 96.2MB in the end (delta: 3.1MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.62ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 91.5MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.47ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 86.2MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1104.60ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 86.2MB in the beginning and 133.3MB in the end (delta: -47.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16100.00ms. Allocated memory was 211.8MB in the beginning and 390.1MB in the end (delta: 178.3MB). Free memory was 132.3MB in the beginning and 137.2MB in the end (delta: -4.9MB). Peak memory consumption was 174.3MB. Max. memory is 16.1GB. * Witness Printer took 132.23ms. Allocated memory is still 390.1MB. Free memory was 137.2MB in the beginning and 117.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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={0:0}, set={8: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={18446744073709551619:0}skb->data=257] [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={18446744073709551619:0}skb->data=257] [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: 15.9s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6507 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6396 mSDsluCounter, 10094 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7479 mSDsCounter, 2647 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6013 IncrementalHoareTripleChecker+Invalid, 8660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2647 mSolverCounterUnsat, 2615 mSDtfsCounter, 6013 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.1s 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 4068 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s 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-11-02 21:08:55,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10c6ce5-1f95-4c07-9eb1-3bfb3d52709b/bin/uautomizer-Dbtcem3rbc/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