./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 17b6ca63314e9bbd90d97451589da4cb7f3ca1eb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:23:26,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:23:26,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:23:26,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:23:26,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:23:26,463 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:23:26,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:23:26,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:23:26,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:23:26,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:23:26,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:23:26,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:23:26,468 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:23:26,469 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:23:26,470 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:23:26,470 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:23:26,471 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:23:26,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:23:26,474 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:23:26,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:23:26,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:23:26,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:23:26,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:23:26,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:23:26,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:23:26,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:23:26,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:23:26,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:23:26,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:23:26,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:23:26,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:23:26,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:23:26,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:23:26,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:23:26,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:23:26,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:23:26,484 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-12-09 15:23:26,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:23:26,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:23:26,495 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:23:26,495 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:23:26,496 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 15:23:26,496 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 15:23:26,496 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 15:23:26,496 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 15:23:26,496 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 15:23:26,496 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 15:23:26,496 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-09 15:23:26,496 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 15:23:26,496 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 15:23:26,496 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 15:23:26,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:23:26,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:23:26,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:23:26,497 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:23:26,497 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:23:26,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:23:26,498 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:23:26,498 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:23:26,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:23:26,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:23:26,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:23:26,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:23:26,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:23:26,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:23:26,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:23:26,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:23:26,499 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 15:23:26,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:23:26,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:23:26,499 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 15:23:26,499 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-12-09 15:23:26,499 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 17b6ca63314e9bbd90d97451589da4cb7f3ca1eb [2018-12-09 15:23:26,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:23:26,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:23:26,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:23:26,534 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:23:26,534 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:23:26,535 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i [2018-12-09 15:23:26,572 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/data/db7ee5c6b/a6c415422a584cf2951895aea21e4155/FLAG529119a2e [2018-12-09 15:23:27,067 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:23:27,067 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i [2018-12-09 15:23:27,080 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/data/db7ee5c6b/a6c415422a584cf2951895aea21e4155/FLAG529119a2e [2018-12-09 15:23:27,089 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/data/db7ee5c6b/a6c415422a584cf2951895aea21e4155 [2018-12-09 15:23:27,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:23:27,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:23:27,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:23:27,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:23:27,094 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:23:27,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8dcb04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27, skipping insertion in model container [2018-12-09 15:23:27,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:23:27,145 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:23:27,556 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:23:27,564 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:23:27,640 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:23:27,654 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:23:27,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27 WrapperNode [2018-12-09 15:23:27,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:23:27,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:23:27,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:23:27,655 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:23:27,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:23:27,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:23:27,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:23:27,675 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:23:27,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (1/1) ... [2018-12-09 15:23:27,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:23:27,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:23:27,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:23:27,698 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:23:27,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:23:27,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 15:23:27,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:23:27,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:23:27,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-12-09 15:23:27,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-12-09 15:23:27,731 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-12-09 15:23:27,731 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2018-12-09 15:23:27,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_int [2018-12-09 15:23:27,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_int [2018-12-09 15:23:27,731 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-12-09 15:23:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-12-09 15:23:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:23:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-12-09 15:23:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-12-09 15:23:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-12-09 15:23:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-12-09 15:23:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-12-09 15:23:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-12-09 15:23:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 15:23:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 15:23:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-12-09 15:23:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-12-09 15:23:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:23:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:23:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-12-09 15:23:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-12-09 15:23:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_1 [2018-12-09 15:23:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_1 [2018-12-09 15:23:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-12-09 15:23:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2018-12-09 15:23:27,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:23:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:23:27,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-12-09 15:23:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-12-09 15:23:27,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-12-09 15:23:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-12-09 15:23:27,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_2 [2018-12-09 15:23:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_2 [2018-12-09 15:23:27,818 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:23:27,818 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:23:27,961 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:23:27,961 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 15:23:27,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:27 BoogieIcfgContainer [2018-12-09 15:23:27,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:23:27,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:23:27,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:23:27,965 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:23:27,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:23:27" (1/3) ... [2018-12-09 15:23:27,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2139df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:23:27, skipping insertion in model container [2018-12-09 15:23:27,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:27" (2/3) ... [2018-12-09 15:23:27,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2139df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:23:27, skipping insertion in model container [2018-12-09 15:23:27,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:27" (3/3) ... [2018-12-09 15:23:27,967 INFO L112 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i [2018-12-09 15:23:27,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:23:27,981 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 15:23:27,993 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 15:23:28,015 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:23:28,015 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 15:23:28,016 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:23:28,016 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:23:28,016 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:23:28,016 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:23:28,016 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:23:28,016 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:23:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-12-09 15:23:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 15:23:28,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:28,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:28,034 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:23:28,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2061776394, now seen corresponding path program 1 times [2018-12-09 15:23:28,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:28,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:28,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:28,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:28,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:23:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:28,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:23:28,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:28,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:23:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:23:28,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:23:28,190 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2018-12-09 15:23:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:28,227 INFO L93 Difference]: Finished difference Result 223 states and 274 transitions. [2018-12-09 15:23:28,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:23:28,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 15:23:28,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:28,235 INFO L225 Difference]: With dead ends: 223 [2018-12-09 15:23:28,235 INFO L226 Difference]: Without dead ends: 135 [2018-12-09 15:23:28,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:23:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-09 15:23:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-12-09 15:23:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 15:23:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-12-09 15:23:28,270 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 24 [2018-12-09 15:23:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:28,270 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-12-09 15:23:28,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:23:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-12-09 15:23:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 15:23:28,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:28,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:28,272 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:23:28,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash -698380565, now seen corresponding path program 1 times [2018-12-09 15:23:28,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:28,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:28,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:28,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:28,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:23:28,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:28,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:23:28,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:28,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:23:28,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:23:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:23:28,348 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 7 states. [2018-12-09 15:23:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:28,373 INFO L93 Difference]: Finished difference Result 241 states and 288 transitions. [2018-12-09 15:23:28,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:23:28,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-12-09 15:23:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:28,375 INFO L225 Difference]: With dead ends: 241 [2018-12-09 15:23:28,375 INFO L226 Difference]: Without dead ends: 129 [2018-12-09 15:23:28,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:23:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-09 15:23:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-12-09 15:23:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-09 15:23:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-12-09 15:23:28,385 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 56 [2018-12-09 15:23:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:28,385 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-12-09 15:23:28,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:23:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-12-09 15:23:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 15:23:28,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:28,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:28,386 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:23:28,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1775691705, now seen corresponding path program 1 times [2018-12-09 15:23:28,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:28,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:28,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:23:28,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:28,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:23:28,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:28,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:23:28,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:23:28,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:23:28,493 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 7 states. [2018-12-09 15:23:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:28,722 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2018-12-09 15:23:28,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:23:28,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-12-09 15:23:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:28,723 INFO L225 Difference]: With dead ends: 210 [2018-12-09 15:23:28,724 INFO L226 Difference]: Without dead ends: 207 [2018-12-09 15:23:28,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:23:28,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-09 15:23:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2018-12-09 15:23:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-09 15:23:28,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2018-12-09 15:23:28,737 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 62 [2018-12-09 15:23:28,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:28,738 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2018-12-09 15:23:28,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:23:28,738 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2018-12-09 15:23:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 15:23:28,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:28,739 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 15:23:28,739 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:23:28,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:28,739 INFO L82 PathProgramCache]: Analyzing trace with hash 648212136, now seen corresponding path program 1 times [2018-12-09 15:23:28,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:28,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:28,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:28,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:28,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:23:28,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:28,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:23:28,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:28,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:23:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:23:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:23:28,799 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand 7 states. [2018-12-09 15:23:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:28,832 INFO L93 Difference]: Finished difference Result 330 states and 390 transitions. [2018-12-09 15:23:28,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:23:28,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-09 15:23:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:28,834 INFO L225 Difference]: With dead ends: 330 [2018-12-09 15:23:28,834 INFO L226 Difference]: Without dead ends: 193 [2018-12-09 15:23:28,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:23:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-09 15:23:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2018-12-09 15:23:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-09 15:23:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 222 transitions. [2018-12-09 15:23:28,851 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 222 transitions. Word has length 66 [2018-12-09 15:23:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:28,852 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 222 transitions. [2018-12-09 15:23:28,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:23:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 222 transitions. [2018-12-09 15:23:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 15:23:28,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:28,854 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 15:23:28,854 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:23:28,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1920379961, now seen corresponding path program 1 times [2018-12-09 15:23:28,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:28,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:28,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:28,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:28,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:23:28,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:28,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:23:28,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:28,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:23:28,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:23:28,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:23:28,946 INFO L87 Difference]: Start difference. First operand 190 states and 222 transitions. Second operand 5 states. [2018-12-09 15:23:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:29,009 INFO L93 Difference]: Finished difference Result 375 states and 450 transitions. [2018-12-09 15:23:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:23:29,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-09 15:23:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:29,011 INFO L225 Difference]: With dead ends: 375 [2018-12-09 15:23:29,011 INFO L226 Difference]: Without dead ends: 205 [2018-12-09 15:23:29,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:23:29,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-09 15:23:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2018-12-09 15:23:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-09 15:23:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2018-12-09 15:23:29,023 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 81 [2018-12-09 15:23:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:29,024 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2018-12-09 15:23:29,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:23:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2018-12-09 15:23:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 15:23:29,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:29,026 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 15:23:29,026 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:23:29,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1476479287, now seen corresponding path program 1 times [2018-12-09 15:23:29,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:29,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:29,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:29,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:29,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:23:29,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:29,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 15:23:29,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:29,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 15:23:29,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 15:23:29,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 15:23:29,279 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand 14 states. [2018-12-09 15:23:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:30,547 INFO L93 Difference]: Finished difference Result 317 states and 360 transitions. [2018-12-09 15:23:30,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 15:23:30,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-12-09 15:23:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:30,548 INFO L225 Difference]: With dead ends: 317 [2018-12-09 15:23:30,548 INFO L226 Difference]: Without dead ends: 168 [2018-12-09 15:23:30,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-12-09 15:23:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-09 15:23:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 148. [2018-12-09 15:23:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-09 15:23:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2018-12-09 15:23:30,555 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 81 [2018-12-09 15:23:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:30,555 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2018-12-09 15:23:30,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 15:23:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2018-12-09 15:23:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 15:23:30,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:30,556 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 15:23:30,557 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:23:30,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 676892673, now seen corresponding path program 1 times [2018-12-09 15:23:30,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:30,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:30,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:23:30,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:30,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:23:30,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:30,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:23:30,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:23:30,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:23:30,664 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand 9 states. [2018-12-09 15:23:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:30,760 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2018-12-09 15:23:30,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:23:30,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-12-09 15:23:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:30,761 INFO L225 Difference]: With dead ends: 150 [2018-12-09 15:23:30,761 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 15:23:30,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:23:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 15:23:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-09 15:23:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-09 15:23:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2018-12-09 15:23:30,766 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 83 [2018-12-09 15:23:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:30,767 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2018-12-09 15:23:30,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:23:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2018-12-09 15:23:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 15:23:30,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:30,768 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:30,768 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:23:30,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:30,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1011867122, now seen corresponding path program 1 times [2018-12-09 15:23:30,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:30,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:30,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:30,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 15:23:30,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:30,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:23:30,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:30,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:23:30,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:23:30,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:23:30,832 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 6 states. [2018-12-09 15:23:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:30,928 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2018-12-09 15:23:30,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:23:30,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-12-09 15:23:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:30,929 INFO L225 Difference]: With dead ends: 138 [2018-12-09 15:23:30,929 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 15:23:30,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:23:30,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 15:23:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 15:23:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 15:23:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 15:23:30,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2018-12-09 15:23:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:30,931 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:23:30,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:23:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 15:23:30,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 15:23:30,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 15:23:30,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:23:31,229 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4922 4980) no Hoare annotation was computed. [2018-12-09 15:23:31,229 INFO L448 ceAbstractionStarter]: For program point L4945(lines 4945 4959) no Hoare annotation was computed. [2018-12-09 15:23:31,229 INFO L448 ceAbstractionStarter]: For program point L4976(line 4976) no Hoare annotation was computed. [2018-12-09 15:23:31,229 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4922 4980) no Hoare annotation was computed. [2018-12-09 15:23:31,229 INFO L444 ceAbstractionStarter]: At program point L4972(lines 4930 4979) the Hoare annotation is: (or (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-12-09 15:23:31,229 INFO L444 ceAbstractionStarter]: At program point L4966(lines 4930 4979) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,229 INFO L444 ceAbstractionStarter]: At program point L4968(lines 4930 4979) the Hoare annotation is: (or (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-12-09 15:23:31,229 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 4949 4958) no Hoare annotation was computed. [2018-12-09 15:23:31,229 INFO L444 ceAbstractionStarter]: At program point L4933(line 4933) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,230 INFO L444 ceAbstractionStarter]: At program point L4933-1(line 4933) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,230 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 4949 4958) no Hoare annotation was computed. [2018-12-09 15:23:31,230 INFO L444 ceAbstractionStarter]: At program point L4960(lines 4930 4979) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,230 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 4922 4980) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,230 INFO L448 ceAbstractionStarter]: For program point L4952(line 4952) no Hoare annotation was computed. [2018-12-09 15:23:31,230 INFO L444 ceAbstractionStarter]: At program point L4946(lines 4945 4959) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,230 INFO L448 ceAbstractionStarter]: For program point L4934(line 4934) no Hoare annotation was computed. [2018-12-09 15:23:31,230 INFO L448 ceAbstractionStarter]: For program point L4936(lines 4936 4939) no Hoare annotation was computed. [2018-12-09 15:23:31,230 INFO L448 ceAbstractionStarter]: For program point L4965(lines 4965 4969) no Hoare annotation was computed. [2018-12-09 15:23:31,230 INFO L448 ceAbstractionStarter]: For program point L5006(lines 5006 5011) no Hoare annotation was computed. [2018-12-09 15:23:31,231 INFO L444 ceAbstractionStarter]: At program point ldv_try_module_getENTRY(lines 4999 5016) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,231 INFO L448 ceAbstractionStarter]: For program point L5004-1(line 5004) no Hoare annotation was computed. [2018-12-09 15:23:31,231 INFO L448 ceAbstractionStarter]: For program point L5002(lines 5002 5013) no Hoare annotation was computed. [2018-12-09 15:23:31,231 INFO L444 ceAbstractionStarter]: At program point L5004(line 5004) the Hoare annotation is: (or (and (<= (+ |ldv_try_module_get_#in~module.base| |ldv_try_module_get_#in~module.offset|) (+ (* 18446744073709551616 (div (+ |ldv_try_module_get_#in~module.base| (+ |ldv_try_module_get_#in~module.offset| (- 1))) 18446744073709551616)) 18446744073709551615)) (= 1 ~ldv_module_refcounter~0) (= ldv_try_module_get_~module.base |ldv_try_module_get_#in~module.base|) (= ldv_try_module_get_~module.offset |ldv_try_module_get_#in~module.offset|)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-12-09 15:23:31,231 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 4999 5016) no Hoare annotation was computed. [2018-12-09 15:23:31,231 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 4999 5016) no Hoare annotation was computed. [2018-12-09 15:23:31,231 INFO L448 ceAbstractionStarter]: For program point pppox_initFINAL(lines 4900 4908) no Hoare annotation was computed. [2018-12-09 15:23:31,231 INFO L448 ceAbstractionStarter]: For program point L4904-1(line 4904) no Hoare annotation was computed. [2018-12-09 15:23:31,231 INFO L451 ceAbstractionStarter]: At program point pppox_initENTRY(lines 4900 4908) the Hoare annotation is: true [2018-12-09 15:23:31,231 INFO L451 ceAbstractionStarter]: At program point L4904(line 4904) the Hoare annotation is: true [2018-12-09 15:23:31,232 INFO L448 ceAbstractionStarter]: For program point pppox_initEXIT(lines 4900 4908) no Hoare annotation was computed. [2018-12-09 15:23:31,232 INFO L451 ceAbstractionStarter]: At program point sock_unregisterENTRY(lines 5110 5112) the Hoare annotation is: true [2018-12-09 15:23:31,232 INFO L448 ceAbstractionStarter]: For program point sock_unregisterEXIT(lines 5110 5112) no Hoare annotation was computed. [2018-12-09 15:23:31,232 INFO L448 ceAbstractionStarter]: For program point sock_unregisterFINAL(lines 5110 5112) no Hoare annotation was computed. [2018-12-09 15:23:31,232 INFO L451 ceAbstractionStarter]: At program point ldv_undefined_intENTRY(lines 5087 5089) the Hoare annotation is: true [2018-12-09 15:23:31,232 INFO L448 ceAbstractionStarter]: For program point ldv_undefined_intEXIT(lines 5087 5089) no Hoare annotation was computed. [2018-12-09 15:23:31,232 INFO L448 ceAbstractionStarter]: For program point ldv_undefined_intFINAL(lines 5087 5089) no Hoare annotation was computed. [2018-12-09 15:23:31,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 15:23:31,232 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) [2018-12-09 15:23:31,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 15:23:31,232 INFO L444 ceAbstractionStarter]: At program point L4895(lines 4864 4897) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,233 INFO L444 ceAbstractionStarter]: At program point L4893(line 4893) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (and (= 1 pppox_create_~tmp~2) (<= (+ |pppox_create_#t~mem45.base| |pppox_create_#t~mem45.offset|) (+ (* 18446744073709551616 (div (+ |pppox_create_#t~mem45.base| (+ |pppox_create_#t~mem45.offset| (- 1))) 18446744073709551616)) 18446744073709551615)) (<= ~ldv_module_refcounter~0 2) (<= 2 ~ldv_module_refcounter~0) (let ((.cse4 (+ (* 8 pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4) 16))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) (<= (+ .cse0 .cse1) (+ (* 18446744073709551616 (div (+ .cse1 (+ .cse0 (- 1))) 18446744073709551616)) 18446744073709551615))))))) [2018-12-09 15:23:31,233 INFO L448 ceAbstractionStarter]: For program point L4893-1(line 4893) no Hoare annotation was computed. [2018-12-09 15:23:31,233 INFO L448 ceAbstractionStarter]: For program point pppox_createFINAL(lines 4861 4898) no Hoare annotation was computed. [2018-12-09 15:23:31,233 INFO L448 ceAbstractionStarter]: For program point L4869(lines 4869 4872) no Hoare annotation was computed. [2018-12-09 15:23:31,233 INFO L448 ceAbstractionStarter]: For program point L4892-1(line 4892) no Hoare annotation was computed. [2018-12-09 15:23:31,233 INFO L444 ceAbstractionStarter]: At program point pppox_createENTRY(lines 4861 4898) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,233 INFO L444 ceAbstractionStarter]: At program point L4892(line 4892) the Hoare annotation is: (or (and (= 1 pppox_create_~tmp~2) (<= ~ldv_module_refcounter~0 2) (<= 2 ~ldv_module_refcounter~0) (let ((.cse4 (+ (* 8 pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4) 16))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) (<= (+ .cse0 .cse1) (+ (* 18446744073709551616 (div (+ .cse1 (+ .cse0 (- 1))) 18446744073709551616)) 18446744073709551615)))))) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-12-09 15:23:31,233 INFO L448 ceAbstractionStarter]: For program point L4886(lines 4886 4889) no Hoare annotation was computed. [2018-12-09 15:23:31,233 INFO L448 ceAbstractionStarter]: For program point L4884-1(line 4884) no Hoare annotation was computed. [2018-12-09 15:23:31,234 INFO L444 ceAbstractionStarter]: At program point L4884(line 4884) the Hoare annotation is: (or (let ((.cse2 (+ (* 8 pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) 16))) (and (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) |pppox_create_#t~mem35.base|) (= 1 ~ldv_module_refcounter~0) (= (select (select |#memory_$Pointer$.offset| .cse0) .cse1) |pppox_create_#t~mem35.offset|)))) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-12-09 15:23:31,234 INFO L448 ceAbstractionStarter]: For program point L4880(lines 4880 4890) no Hoare annotation was computed. [2018-12-09 15:23:31,234 INFO L448 ceAbstractionStarter]: For program point L4874(lines 4874 4879) no Hoare annotation was computed. [2018-12-09 15:23:31,234 INFO L448 ceAbstractionStarter]: For program point pppox_createEXIT(lines 4861 4898) no Hoare annotation was computed. [2018-12-09 15:23:31,234 INFO L448 ceAbstractionStarter]: For program point L4874-2(lines 4874 4879) no Hoare annotation was computed. [2018-12-09 15:23:31,234 INFO L448 ceAbstractionStarter]: For program point L4866(lines 4866 4872) no Hoare annotation was computed. [2018-12-09 15:23:31,234 INFO L451 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 5049 5060) the Hoare annotation is: true [2018-12-09 15:23:31,234 INFO L444 ceAbstractionStarter]: At program point L5054(line 5054) the Hoare annotation is: (not (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,234 INFO L448 ceAbstractionStarter]: For program point L5052(lines 5049 5060) no Hoare annotation was computed. [2018-12-09 15:23:31,234 INFO L448 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 5049 5060) no Hoare annotation was computed. [2018-12-09 15:23:31,235 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_1FINAL(lines 5061 5069) no Hoare annotation was computed. [2018-12-09 15:23:31,235 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_1EXIT(lines 5061 5069) no Hoare annotation was computed. [2018-12-09 15:23:31,235 INFO L444 ceAbstractionStarter]: At program point ldv_try_module_get_1ENTRY(lines 5061 5069) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,235 INFO L444 ceAbstractionStarter]: At program point L5065(line 5065) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (and (= |ldv_try_module_get_1_#in~module.base| ldv_try_module_get_1_~module.base) (= 1 ~ldv_module_refcounter~0) (= |ldv_try_module_get_1_#in~module.offset| ldv_try_module_get_1_~module.offset))) [2018-12-09 15:23:31,235 INFO L448 ceAbstractionStarter]: For program point L5065-1(line 5065) no Hoare annotation was computed. [2018-12-09 15:23:31,235 INFO L451 ceAbstractionStarter]: At program point sock_registerENTRY(lines 5107 5109) the Hoare annotation is: true [2018-12-09 15:23:31,235 INFO L448 ceAbstractionStarter]: For program point sock_registerEXIT(lines 5107 5109) no Hoare annotation was computed. [2018-12-09 15:23:31,235 INFO L448 ceAbstractionStarter]: For program point sock_registerFINAL(lines 5107 5109) no Hoare annotation was computed. [2018-12-09 15:23:31,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 15:23:31,235 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= 1 ~ldv_module_refcounter~0) [2018-12-09 15:23:31,235 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 15:23:31,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 15:23:31,236 INFO L451 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 5083 5085) the Hoare annotation is: true [2018-12-09 15:23:31,236 INFO L448 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 5083 5085) no Hoare annotation was computed. [2018-12-09 15:23:31,236 INFO L444 ceAbstractionStarter]: At program point L5023(line 5023) the Hoare annotation is: (< |old(~ldv_module_refcounter~0)| 2) [2018-12-09 15:23:31,236 INFO L448 ceAbstractionStarter]: For program point L5020-2(lines 5017 5032) no Hoare annotation was computed. [2018-12-09 15:23:31,236 INFO L448 ceAbstractionStarter]: For program point L5021(lines 5021 5026) no Hoare annotation was computed. [2018-12-09 15:23:31,236 INFO L448 ceAbstractionStarter]: For program point L5020(lines 5020 5029) no Hoare annotation was computed. [2018-12-09 15:23:31,236 INFO L448 ceAbstractionStarter]: For program point L5021-1(lines 5021 5026) no Hoare annotation was computed. [2018-12-09 15:23:31,236 INFO L444 ceAbstractionStarter]: At program point ldv_module_putENTRY(lines 5017 5032) the Hoare annotation is: (or (< |old(~ldv_module_refcounter~0)| 2) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,236 INFO L448 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 5017 5032) no Hoare annotation was computed. [2018-12-09 15:23:31,236 INFO L448 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2018-12-09 15:23:31,236 INFO L451 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2018-12-09 15:23:31,237 INFO L448 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2018-12-09 15:23:31,237 INFO L448 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 4909 4917) no Hoare annotation was computed. [2018-12-09 15:23:31,237 INFO L451 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 4909 4917) the Hoare annotation is: true [2018-12-09 15:23:31,237 INFO L448 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 4909 4917) no Hoare annotation was computed. [2018-12-09 15:23:31,237 INFO L451 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4981 4986) the Hoare annotation is: true [2018-12-09 15:23:31,237 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4981 4986) no Hoare annotation was computed. [2018-12-09 15:23:31,237 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4984) no Hoare annotation was computed. [2018-12-09 15:23:31,237 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4981 4986) no Hoare annotation was computed. [2018-12-09 15:23:31,237 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_2FINAL(lines 5070 5078) no Hoare annotation was computed. [2018-12-09 15:23:31,237 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_2EXIT(lines 5070 5078) no Hoare annotation was computed. [2018-12-09 15:23:31,238 INFO L444 ceAbstractionStarter]: At program point ldv_module_put_2ENTRY(lines 5070 5078) the Hoare annotation is: (or (< |old(~ldv_module_refcounter~0)| 2) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-12-09 15:23:31,238 INFO L444 ceAbstractionStarter]: At program point L5074(line 5074) the Hoare annotation is: (or (and (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) (= ldv_module_put_2_~ldv_func_arg1.base |ldv_module_put_2_#in~ldv_func_arg1.base|) (= ldv_module_put_2_~ldv_func_arg1.offset |ldv_module_put_2_#in~ldv_func_arg1.offset|)) (< |old(~ldv_module_refcounter~0)| 2)) [2018-12-09 15:23:31,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:23:31 BoogieIcfgContainer [2018-12-09 15:23:31,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:23:31,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:23:31,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:23:31,247 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:23:31,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:27" (3/4) ... [2018-12-09 15:23:31,252 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 15:23:31,256 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 15:23:31,256 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get [2018-12-09 15:23:31,256 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_init [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_unregister [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_int [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_create [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get_1 [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_register [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_initialize [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_exit [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-12-09 15:23:31,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_2 [2018-12-09 15:23:31,263 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-12-09 15:23:31,263 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 15:23:31,263 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 15:23:31,263 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 15:23:31,286 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) [2018-12-09 15:23:31,286 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-12-09 15:23:31,286 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-12-09 15:23:31,286 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) [2018-12-09 15:23:31,287 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-12-09 15:23:31,287 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-12-09 15:23:31,312 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5a7e068a-faa2-4b43-a506-b0432f08fa9f/bin-2019/utaipan/witness.graphml [2018-12-09 15:23:31,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:23:31,313 INFO L168 Benchmark]: Toolchain (without parser) took 4221.98 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.9 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -59.8 MB). Peak memory consumption was 187.1 MB. Max. memory is 11.5 GB. [2018-12-09 15:23:31,314 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:23:31,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 77.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:23:31,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:23:31,314 INFO L168 Benchmark]: Boogie Preprocessor took 22.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:23:31,314 INFO L168 Benchmark]: RCFGBuilder took 264.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-12-09 15:23:31,315 INFO L168 Benchmark]: TraceAbstraction took 3284.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.8 MB). Peak memory consumption was 136.2 MB. Max. memory is 11.5 GB. [2018-12-09 15:23:31,315 INFO L168 Benchmark]: Witness Printer took 65.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:23:31,316 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 562.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 77.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 264.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3284.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.8 MB). Peak memory consumption was 136.2 MB. Max. memory is 11.5 GB. * Witness Printer took 65.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4984]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4930]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4930]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4864]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4930]: Loop Invariant Derived loop invariant: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) - InvariantResult [Line: 4945]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4930]: Loop Invariant Derived loop invariant: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 94 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 750 SDtfs, 561 SDslu, 2570 SDs, 0 SdLazy, 689 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 58 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 231 PreInvPairs, 248 NumberOfFragments, 507 HoareAnnotationTreeSize, 231 FomulaSimplifications, 624 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 35 FomulaSimplificationsInter, 474 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 565 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 145400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...