java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:22:06,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:22:06,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:22:06,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:22:06,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:22:06,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:22:06,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:22:06,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:22:06,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:22:06,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:22:06,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:22:06,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:22:06,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:22:06,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:22:06,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:22:06,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:22:06,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:22:06,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:22:06,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:22:06,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:22:06,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:22:06,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:22:06,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:22:06,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:22:06,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:22:06,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:22:06,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:22:06,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:22:06,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:22:06,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:22:06,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:22:06,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:22:06,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:22:06,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:22:06,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:22:06,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:22:06,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:22:06,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:22:06,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:22:06,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:22:06,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:22:06,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:22:06,542 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:22:06,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:22:06,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:22:06,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:22:06,544 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:22:06,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:22:06,545 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:22:06,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:22:06,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:22:06,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:22:06,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:22:06,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:22:06,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:22:06,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:22:06,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:22:06,546 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:22:06,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:22:06,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:22:06,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:22:06,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:22:06,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:22:06,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:22:06,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:22:06,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:22:06,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:22:06,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:22:06,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:22:06,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:22:06,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:22:06,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:22:06,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:22:06,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:22:06,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:22:06,882 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:22:06,883 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i [2019-10-13 20:22:06,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97476a8e7/718ccb93ed2a47acbd84e5c4ac9d6a66/FLAG608584ce6 [2019-10-13 20:22:07,681 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:22:07,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i [2019-10-13 20:22:07,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97476a8e7/718ccb93ed2a47acbd84e5c4ac9d6a66/FLAG608584ce6 [2019-10-13 20:22:07,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97476a8e7/718ccb93ed2a47acbd84e5c4ac9d6a66 [2019-10-13 20:22:07,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:22:07,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:22:07,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:22:07,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:22:07,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:22:07,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:22:07" (1/1) ... [2019-10-13 20:22:07,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d0c811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:07, skipping insertion in model container [2019-10-13 20:22:07,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:22:07" (1/1) ... [2019-10-13 20:22:07,845 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:22:07,959 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:22:08,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:22:08,978 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:22:09,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:22:09,176 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:22:09,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:09 WrapperNode [2019-10-13 20:22:09,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:22:09,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:22:09,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:22:09,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:22:09,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:09" (1/1) ... [2019-10-13 20:22:09,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:09" (1/1) ... [2019-10-13 20:22:09,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:09" (1/1) ... [2019-10-13 20:22:09,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:09" (1/1) ... [2019-10-13 20:22:09,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:09" (1/1) ... [2019-10-13 20:22:09,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:09" (1/1) ... [2019-10-13 20:22:09,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:09" (1/1) ... [2019-10-13 20:22:09,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:22:09,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:22:09,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:22:09,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:22:09,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-13 20:22:09,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:22:09,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:22:09,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-10-13 20:22:09,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-13 20:22:09,333 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock [2019-10-13 20:22:09,333 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_sk [2019-10-13 20:22:09,334 INFO L138 BoogieDeclarations]: Found implementation of procedure register_pppox_proto [2019-10-13 20:22:09,334 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_pppox_proto [2019-10-13 20:22:09,334 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_unbind_sock [2019-10-13 20:22:09,335 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_ioctl [2019-10-13 20:22:09,335 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2019-10-13 20:22:09,335 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2019-10-13 20:22:09,335 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2019-10-13 20:22:09,336 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:22:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-10-13 20:22:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_get [2019-10-13 20:22:09,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2019-10-13 20:22:09,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2019-10-13 20:22:09,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_and_exit [2019-10-13 20:22:09,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_refcount [2019-10-13 20:22:09,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-13 20:22:09,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_1 [2019-10-13 20:22:09,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_2 [2019-10-13 20:22:09,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_module [2019-10-13 20:22:09,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-13 20:22:09,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_int [2019-10-13 20:22:09,344 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock_nested [2019-10-13 20:22:09,344 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-13 20:22:09,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_channel_index [2019-10-13 20:22:09,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_unregister_channel [2019-10-13 20:22:09,345 INFO L138 BoogieDeclarations]: Found implementation of procedure release_sock [2019-10-13 20:22:09,345 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2019-10-13 20:22:09,346 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2019-10-13 20:22:09,346 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-13 20:22:09,346 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-13 20:22:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:22:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-13 20:22:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure __request_module [2019-10-13 20:22:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_1 [2019-10-13 20:22:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_2 [2019-10-13 20:22:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2019-10-13 20:22:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_get [2019-10-13 20:22:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2019-10-13 20:22:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_refcount [2019-10-13 20:22:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_and_exit [2019-10-13 20:22:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2019-10-13 20:22:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2019-10-13 20:22:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unregister_channel [2019-10-13 20:22:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_index [2019-10-13 20:22:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock_nested [2019-10-13 20:22:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock [2019-10-13 20:22:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure release_sock [2019-10-13 20:22:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_sk [2019-10-13 20:22:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure register_pppox_proto [2019-10-13 20:22:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_pppox_proto [2019-10-13 20:22:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_unbind_sock [2019-10-13 20:22:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_ioctl [2019-10-13 20:22:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:22:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:22:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:22:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:22:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-10-13 20:22:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2019-10-13 20:22:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 20:22:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-13 20:22:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2019-10-13 20:22:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2019-10-13 20:22:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-13 20:22:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-13 20:22:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:22:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:22:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-10-13 20:22:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_int [2019-10-13 20:22:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 20:22:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-13 20:22:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:22:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-13 20:22:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:22:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:22:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 20:22:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 20:22:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:22:09,712 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 20:22:09,869 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-13 20:22:09,869 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-13 20:22:09,870 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 20:22:09,870 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 20:22:09,871 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 20:22:09,894 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-13 20:22:09,894 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-13 20:22:09,977 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_module_put_and_exitFINAL: assume true; [2019-10-13 20:22:10,135 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:22:10,135 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 20:22:10,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:22:10 BoogieIcfgContainer [2019-10-13 20:22:10,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:22:10,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:22:10,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:22:10,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:22:10,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:22:07" (1/3) ... [2019-10-13 20:22:10,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af9322f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:22:10, skipping insertion in model container [2019-10-13 20:22:10,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:22:09" (2/3) ... [2019-10-13 20:22:10,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af9322f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:22:10, skipping insertion in model container [2019-10-13 20:22:10,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:22:10" (3/3) ... [2019-10-13 20:22:10,145 INFO L109 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-net-pppox.ko.cil.out.i [2019-10-13 20:22:10,155 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:22:10,164 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 20:22:10,176 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 20:22:10,199 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:22:10,199 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:22:10,199 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:22:10,199 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:22:10,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:22:10,200 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:22:10,200 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:22:10,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:22:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-10-13 20:22:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 20:22:10,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:22:10,225 INFO L380 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] [2019-10-13 20:22:10,228 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:22:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:22:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1181566854, now seen corresponding path program 1 times [2019-10-13 20:22:10,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:22:10,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495508887] [2019-10-13 20:22:10,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:10,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:10,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:22:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:22:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:22:10,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495508887] [2019-10-13 20:22:10,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:22:10,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:22:10,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030729694] [2019-10-13 20:22:10,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:22:10,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:22:10,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:22:10,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:22:10,560 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 3 states. [2019-10-13 20:22:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:22:10,654 INFO L93 Difference]: Finished difference Result 223 states and 274 transitions. [2019-10-13 20:22:10,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:22:10,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 20:22:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:22:10,687 INFO L225 Difference]: With dead ends: 223 [2019-10-13 20:22:10,695 INFO L226 Difference]: Without dead ends: 135 [2019-10-13 20:22:10,704 INFO L600 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 [2019-10-13 20:22:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-13 20:22:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-10-13 20:22:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-13 20:22:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2019-10-13 20:22:10,786 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 24 [2019-10-13 20:22:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:22:10,787 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2019-10-13 20:22:10,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:22:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2019-10-13 20:22:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 20:22:10,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:22:10,791 INFO L380 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] [2019-10-13 20:22:10,791 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:22:10,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:22:10,792 INFO L82 PathProgramCache]: Analyzing trace with hash -434919225, now seen corresponding path program 1 times [2019-10-13 20:22:10,792 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:22:10,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309271325] [2019-10-13 20:22:10,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:10,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:10,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:22:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:22:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:22:10,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309271325] [2019-10-13 20:22:10,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:22:10,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 20:22:10,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703091593] [2019-10-13 20:22:10,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 20:22:10,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:22:10,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 20:22:10,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:22:10,997 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 7 states. [2019-10-13 20:22:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:22:11,077 INFO L93 Difference]: Finished difference Result 241 states and 288 transitions. [2019-10-13 20:22:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:22:11,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-13 20:22:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:22:11,080 INFO L225 Difference]: With dead ends: 241 [2019-10-13 20:22:11,080 INFO L226 Difference]: Without dead ends: 129 [2019-10-13 20:22:11,082 INFO L600 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 [2019-10-13 20:22:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-13 20:22:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2019-10-13 20:22:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-13 20:22:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2019-10-13 20:22:11,102 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 56 [2019-10-13 20:22:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:22:11,102 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2019-10-13 20:22:11,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 20:22:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2019-10-13 20:22:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 20:22:11,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:22:11,105 INFO L380 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] [2019-10-13 20:22:11,105 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:22:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:22:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1834921373, now seen corresponding path program 1 times [2019-10-13 20:22:11,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:22:11,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891223163] [2019-10-13 20:22:11,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:11,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:11,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:22:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:22:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:22:11,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891223163] [2019-10-13 20:22:11,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:22:11,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 20:22:11,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914635944] [2019-10-13 20:22:11,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 20:22:11,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:22:11,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 20:22:11,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:22:11,354 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 7 states. [2019-10-13 20:22:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:22:11,925 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2019-10-13 20:22:11,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 20:22:11,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-10-13 20:22:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:22:11,933 INFO L225 Difference]: With dead ends: 210 [2019-10-13 20:22:11,933 INFO L226 Difference]: Without dead ends: 207 [2019-10-13 20:22:11,934 INFO L600 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 [2019-10-13 20:22:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-13 20:22:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2019-10-13 20:22:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-13 20:22:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2019-10-13 20:22:11,996 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 62 [2019-10-13 20:22:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:22:11,998 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2019-10-13 20:22:11,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 20:22:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2019-10-13 20:22:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 20:22:12,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:22:12,004 INFO L380 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] [2019-10-13 20:22:12,004 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:22:12,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:22:12,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1289390946, now seen corresponding path program 1 times [2019-10-13 20:22:12,005 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:22:12,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987479548] [2019-10-13 20:22:12,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:12,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:12,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:22:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:22:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:22:12,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987479548] [2019-10-13 20:22:12,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:22:12,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 20:22:12,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449851023] [2019-10-13 20:22:12,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 20:22:12,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:22:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 20:22:12,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:22:12,120 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand 7 states. [2019-10-13 20:22:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:22:12,181 INFO L93 Difference]: Finished difference Result 330 states and 390 transitions. [2019-10-13 20:22:12,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:22:12,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-10-13 20:22:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:22:12,184 INFO L225 Difference]: With dead ends: 330 [2019-10-13 20:22:12,185 INFO L226 Difference]: Without dead ends: 193 [2019-10-13 20:22:12,188 INFO L600 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 [2019-10-13 20:22:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-13 20:22:12,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2019-10-13 20:22:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-13 20:22:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 222 transitions. [2019-10-13 20:22:12,225 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 222 transitions. Word has length 66 [2019-10-13 20:22:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:22:12,226 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 222 transitions. [2019-10-13 20:22:12,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 20:22:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 222 transitions. [2019-10-13 20:22:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-13 20:22:12,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:22:12,231 INFO L380 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] [2019-10-13 20:22:12,232 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:22:12,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:22:12,232 INFO L82 PathProgramCache]: Analyzing trace with hash -566743229, now seen corresponding path program 1 times [2019-10-13 20:22:12,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:22:12,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952831153] [2019-10-13 20:22:12,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:12,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:12,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:22:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:22:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:22:12,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952831153] [2019-10-13 20:22:12,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:22:12,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:22:12,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336865323] [2019-10-13 20:22:12,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:22:12,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:22:12,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:22:12,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:22:12,404 INFO L87 Difference]: Start difference. First operand 190 states and 222 transitions. Second operand 5 states. [2019-10-13 20:22:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:22:12,507 INFO L93 Difference]: Finished difference Result 375 states and 450 transitions. [2019-10-13 20:22:12,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 20:22:12,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-13 20:22:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:22:12,510 INFO L225 Difference]: With dead ends: 375 [2019-10-13 20:22:12,510 INFO L226 Difference]: Without dead ends: 205 [2019-10-13 20:22:12,512 INFO L600 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 [2019-10-13 20:22:12,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-13 20:22:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2019-10-13 20:22:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-13 20:22:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2019-10-13 20:22:12,528 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 81 [2019-10-13 20:22:12,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:22:12,529 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2019-10-13 20:22:12,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:22:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2019-10-13 20:22:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-13 20:22:12,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:22:12,531 INFO L380 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] [2019-10-13 20:22:12,532 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:22:12,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:22:12,532 INFO L82 PathProgramCache]: Analyzing trace with hash -122842555, now seen corresponding path program 1 times [2019-10-13 20:22:12,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:22:12,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118754716] [2019-10-13 20:22:12,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:12,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:12,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:22:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:22:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:22:12,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118754716] [2019-10-13 20:22:12,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:22:12,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 20:22:12,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707510350] [2019-10-13 20:22:12,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 20:22:12,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:22:12,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 20:22:12,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:22:12,990 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand 14 states. [2019-10-13 20:22:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:22:13,507 INFO L93 Difference]: Finished difference Result 317 states and 360 transitions. [2019-10-13 20:22:13,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 20:22:13,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2019-10-13 20:22:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:22:13,513 INFO L225 Difference]: With dead ends: 317 [2019-10-13 20:22:13,513 INFO L226 Difference]: Without dead ends: 168 [2019-10-13 20:22:13,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-10-13 20:22:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-13 20:22:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 148. [2019-10-13 20:22:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-13 20:22:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2019-10-13 20:22:13,529 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 81 [2019-10-13 20:22:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:22:13,529 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2019-10-13 20:22:13,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 20:22:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2019-10-13 20:22:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 20:22:13,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:22:13,531 INFO L380 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] [2019-10-13 20:22:13,531 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:22:13,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:22:13,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2001053501, now seen corresponding path program 1 times [2019-10-13 20:22:13,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:22:13,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992875798] [2019-10-13 20:22:13,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:13,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:13,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:22:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:22:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 20:22:13,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992875798] [2019-10-13 20:22:13,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:22:13,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 20:22:13,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980207040] [2019-10-13 20:22:13,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 20:22:13,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:22:13,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 20:22:13,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:22:13,783 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand 9 states. [2019-10-13 20:22:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:22:13,986 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2019-10-13 20:22:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 20:22:13,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-10-13 20:22:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:22:13,988 INFO L225 Difference]: With dead ends: 150 [2019-10-13 20:22:13,989 INFO L226 Difference]: Without dead ends: 138 [2019-10-13 20:22:13,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-10-13 20:22:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-13 20:22:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-10-13 20:22:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-13 20:22:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2019-10-13 20:22:14,026 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 83 [2019-10-13 20:22:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:22:14,026 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2019-10-13 20:22:14,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 20:22:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2019-10-13 20:22:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 20:22:14,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:22:14,028 INFO L380 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] [2019-10-13 20:22:14,029 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:22:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:22:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash -165996833, now seen corresponding path program 1 times [2019-10-13 20:22:14,030 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:22:14,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233412495] [2019-10-13 20:22:14,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:14,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:22:14,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:22:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:22:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 20:22:14,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233412495] [2019-10-13 20:22:14,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:22:14,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:22:14,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879690575] [2019-10-13 20:22:14,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:22:14,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:22:14,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:22:14,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:22:14,158 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 6 states. [2019-10-13 20:22:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:22:14,329 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2019-10-13 20:22:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:22:14,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-10-13 20:22:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:22:14,331 INFO L225 Difference]: With dead ends: 138 [2019-10-13 20:22:14,331 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 20:22:14,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:22:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 20:22:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 20:22:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 20:22:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 20:22:14,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2019-10-13 20:22:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:22:14,334 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 20:22:14,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:22:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 20:22:14,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 20:22:14,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 20:22:14,851 INFO L443 ceAbstractionStarter]: For program point L4992-2(lines 4989 4998) no Hoare annotation was computed. [2019-10-13 20:22:14,852 INFO L443 ceAbstractionStarter]: For program point L4992(lines 4992 4995) no Hoare annotation was computed. [2019-10-13 20:22:14,852 INFO L443 ceAbstractionStarter]: For program point ldv_module_getEXIT(lines 4989 4998) no Hoare annotation was computed. [2019-10-13 20:22:14,852 INFO L443 ceAbstractionStarter]: For program point ldv_module_getENTRY(lines 4989 4998) no Hoare annotation was computed. [2019-10-13 20:22:14,852 INFO L443 ceAbstractionStarter]: For program point kfreeEXIT(lines 5118 5120) no Hoare annotation was computed. [2019-10-13 20:22:14,852 INFO L443 ceAbstractionStarter]: For program point kfreeENTRY(lines 5118 5120) no Hoare annotation was computed. [2019-10-13 20:22:14,853 INFO L443 ceAbstractionStarter]: For program point kfreeFINAL(lines 5118 5120) no Hoare annotation was computed. [2019-10-13 20:22:14,853 INFO L443 ceAbstractionStarter]: For program point might_faultFINAL(lines 5093 5095) no Hoare annotation was computed. [2019-10-13 20:22:14,853 INFO L443 ceAbstractionStarter]: For program point might_faultEXIT(lines 5093 5095) no Hoare annotation was computed. [2019-10-13 20:22:14,853 INFO L443 ceAbstractionStarter]: For program point lock_sockENTRY(lines 4708 4716) no Hoare annotation was computed. [2019-10-13 20:22:14,853 INFO L443 ceAbstractionStarter]: For program point lock_sockFINAL(lines 4708 4716) no Hoare annotation was computed. [2019-10-13 20:22:14,853 INFO L443 ceAbstractionStarter]: For program point L4712(line 4712) no Hoare annotation was computed. [2019-10-13 20:22:14,853 INFO L443 ceAbstractionStarter]: For program point lock_sockEXIT(lines 4708 4716) no Hoare annotation was computed. [2019-10-13 20:22:14,853 INFO L443 ceAbstractionStarter]: For program point L4788-1(lines 4783 4859) no Hoare annotation was computed. [2019-10-13 20:22:14,854 INFO L443 ceAbstractionStarter]: For program point L4788(line 4788) no Hoare annotation was computed. [2019-10-13 20:22:14,854 INFO L443 ceAbstractionStarter]: For program point L4797(lines 4797 4800) no Hoare annotation was computed. [2019-10-13 20:22:14,854 INFO L443 ceAbstractionStarter]: For program point L4793(lines 4792 4853) no Hoare annotation was computed. [2019-10-13 20:22:14,854 INFO L443 ceAbstractionStarter]: For program point pppox_ioctlFINAL(lines 4774 4860) no Hoare annotation was computed. [2019-10-13 20:22:14,854 INFO L443 ceAbstractionStarter]: For program point L4794(lines 4794 4852) no Hoare annotation was computed. [2019-10-13 20:22:14,854 INFO L443 ceAbstractionStarter]: For program point L4856(line 4856) no Hoare annotation was computed. [2019-10-13 20:22:14,854 INFO L443 ceAbstractionStarter]: For program point L4786(line 4786) no Hoare annotation was computed. [2019-10-13 20:22:14,855 INFO L443 ceAbstractionStarter]: For program point L4786-1(line 4786) no Hoare annotation was computed. [2019-10-13 20:22:14,855 INFO L443 ceAbstractionStarter]: For program point L4807(lines 4807 4831) no Hoare annotation was computed. [2019-10-13 20:22:14,855 INFO L443 ceAbstractionStarter]: For program point pppox_ioctlEXIT(lines 4774 4860) no Hoare annotation was computed. [2019-10-13 20:22:14,855 INFO L443 ceAbstractionStarter]: For program point L4803(line 4803) no Hoare annotation was computed. [2019-10-13 20:22:14,855 INFO L443 ceAbstractionStarter]: For program point L4803-1(line 4803) no Hoare annotation was computed. [2019-10-13 20:22:14,855 INFO L443 ceAbstractionStarter]: For program point pppox_ioctlENTRY(lines 4774 4860) no Hoare annotation was computed. [2019-10-13 20:22:14,855 INFO L443 ceAbstractionStarter]: For program point L4832(lines 4794 4851) no Hoare annotation was computed. [2019-10-13 20:22:14,856 INFO L443 ceAbstractionStarter]: For program point L4791(lines 4790 4853) no Hoare annotation was computed. [2019-10-13 20:22:14,856 INFO L443 ceAbstractionStarter]: For program point L4845(line 4845) no Hoare annotation was computed. [2019-10-13 20:22:14,856 INFO L443 ceAbstractionStarter]: For program point L4845-1(line 4845) no Hoare annotation was computed. [2019-10-13 20:22:14,858 INFO L443 ceAbstractionStarter]: For program point L4841(lines 4841 4850) no Hoare annotation was computed. [2019-10-13 20:22:14,858 INFO L443 ceAbstractionStarter]: For program point L4804-1(line 4804) no Hoare annotation was computed. [2019-10-13 20:22:14,858 INFO L443 ceAbstractionStarter]: For program point L4804(line 4804) no Hoare annotation was computed. [2019-10-13 20:22:14,858 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4922 4980) no Hoare annotation was computed. [2019-10-13 20:22:14,858 INFO L443 ceAbstractionStarter]: For program point L4945(lines 4945 4959) no Hoare annotation was computed. [2019-10-13 20:22:14,859 INFO L443 ceAbstractionStarter]: For program point L4976(line 4976) no Hoare annotation was computed. [2019-10-13 20:22:14,859 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4922 4980) no Hoare annotation was computed. [2019-10-13 20:22:14,859 INFO L439 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)|))) [2019-10-13 20:22:14,860 INFO L439 ceAbstractionStarter]: At program point L4966(lines 4930 4979) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,860 INFO L439 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)|))) [2019-10-13 20:22:14,860 INFO L439 ceAbstractionStarter]: At program point L4933(line 4933) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,860 INFO L439 ceAbstractionStarter]: At program point L4933-1(line 4933) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,861 INFO L439 ceAbstractionStarter]: At program point L4960(lines 4930 4979) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,862 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 4922 4980) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,862 INFO L443 ceAbstractionStarter]: For program point L4952(line 4952) no Hoare annotation was computed. [2019-10-13 20:22:14,862 INFO L439 ceAbstractionStarter]: At program point L4946(lines 4945 4959) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,862 INFO L443 ceAbstractionStarter]: For program point L4934(line 4934) no Hoare annotation was computed. [2019-10-13 20:22:14,862 INFO L443 ceAbstractionStarter]: For program point L4936(lines 4936 4939) no Hoare annotation was computed. [2019-10-13 20:22:14,863 INFO L443 ceAbstractionStarter]: For program point L4965(lines 4965 4969) no Hoare annotation was computed. [2019-10-13 20:22:14,863 INFO L443 ceAbstractionStarter]: For program point L5006(lines 5006 5011) no Hoare annotation was computed. [2019-10-13 20:22:14,863 INFO L439 ceAbstractionStarter]: At program point ldv_try_module_getENTRY(lines 4999 5016) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,864 INFO L443 ceAbstractionStarter]: For program point L5004-1(line 5004) no Hoare annotation was computed. [2019-10-13 20:22:14,864 INFO L443 ceAbstractionStarter]: For program point L5002(lines 5002 5013) no Hoare annotation was computed. [2019-10-13 20:22:14,864 INFO L439 ceAbstractionStarter]: At program point L5004(line 5004) the Hoare annotation is: (or (and (= ldv_try_module_get_~module.base |ldv_try_module_get_#in~module.base|) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (<= (+ |ldv_try_module_get_#in~module.base| |ldv_try_module_get_#in~module.offset|) (+ (* 4294967296 (div (+ |ldv_try_module_get_#in~module.base| |ldv_try_module_get_#in~module.offset| (- 1)) 4294967296)) 4294967295)) (= ldv_try_module_get_~module.offset |ldv_try_module_get_#in~module.offset|)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-13 20:22:14,865 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 4999 5016) no Hoare annotation was computed. [2019-10-13 20:22:14,865 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 4999 5016) no Hoare annotation was computed. [2019-10-13 20:22:14,865 INFO L443 ceAbstractionStarter]: For program point lock_sock_nestedFINAL(lines 5090 5092) no Hoare annotation was computed. [2019-10-13 20:22:14,865 INFO L443 ceAbstractionStarter]: For program point lock_sock_nestedENTRY(lines 5090 5092) no Hoare annotation was computed. [2019-10-13 20:22:14,865 INFO L443 ceAbstractionStarter]: For program point lock_sock_nestedEXIT(lines 5090 5092) no Hoare annotation was computed. [2019-10-13 20:22:14,866 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~int~X~int~TO~intENTRY(line -1) no Hoare annotation was computed. [2019-10-13 20:22:14,866 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~int~X~int~TO~intFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:22:14,866 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~int~X~int~TO~intEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:22:14,866 INFO L446 ceAbstractionStarter]: At program point sock_unregisterENTRY(lines 5110 5112) the Hoare annotation is: true [2019-10-13 20:22:14,866 INFO L443 ceAbstractionStarter]: For program point sock_unregisterEXIT(lines 5110 5112) no Hoare annotation was computed. [2019-10-13 20:22:14,866 INFO L443 ceAbstractionStarter]: For program point sock_unregisterFINAL(lines 5110 5112) no Hoare annotation was computed. [2019-10-13 20:22:14,867 INFO L443 ceAbstractionStarter]: For program point pppox_skEXIT(lines 4718 4723) no Hoare annotation was computed. [2019-10-13 20:22:14,867 INFO L443 ceAbstractionStarter]: For program point pppox_skENTRY(lines 4718 4723) no Hoare annotation was computed. [2019-10-13 20:22:14,867 INFO L443 ceAbstractionStarter]: For program point pppox_skFINAL(lines 4718 4723) no Hoare annotation was computed. [2019-10-13 20:22:14,867 INFO L446 ceAbstractionStarter]: At program point ldv_undefined_intENTRY(lines 5087 5089) the Hoare annotation is: true [2019-10-13 20:22:14,867 INFO L443 ceAbstractionStarter]: For program point ldv_undefined_intEXIT(lines 5087 5089) no Hoare annotation was computed. [2019-10-13 20:22:14,867 INFO L443 ceAbstractionStarter]: For program point ldv_undefined_intFINAL(lines 5087 5089) no Hoare annotation was computed. [2019-10-13 20:22:14,867 INFO L443 ceAbstractionStarter]: For program point __request_moduleEXIT(lines 5080 5082) no Hoare annotation was computed. [2019-10-13 20:22:14,868 INFO L443 ceAbstractionStarter]: For program point __request_moduleENTRY(lines 5080 5082) no Hoare annotation was computed. [2019-10-13 20:22:14,868 INFO L443 ceAbstractionStarter]: For program point __request_moduleFINAL(lines 5080 5082) no Hoare annotation was computed. [2019-10-13 20:22:14,868 INFO L439 ceAbstractionStarter]: At program point L4895(lines 4864 4897) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,868 INFO L439 ceAbstractionStarter]: At program point L4893(line 4893) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (and (<= ~ldv_module_refcounter~0 2) (<= 2 ~ldv_module_refcounter~0) (let ((.cse4 (+ (* pppox_create_~protocol 4) |~#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) 8))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (<= (+ .cse0 .cse1) (+ (* 4294967296 (div (+ .cse0 .cse1 (- 1)) 4294967296)) 4294967295))))) (<= (+ |pppox_create_#t~mem45.base| |pppox_create_#t~mem45.offset|) (+ (* 4294967296 (div (+ |pppox_create_#t~mem45.base| |pppox_create_#t~mem45.offset| (- 1)) 4294967296)) 4294967295)) (= pppox_create_~tmp~2 1))) [2019-10-13 20:22:14,869 INFO L443 ceAbstractionStarter]: For program point L4893-1(line 4893) no Hoare annotation was computed. [2019-10-13 20:22:14,869 INFO L443 ceAbstractionStarter]: For program point pppox_createFINAL(lines 4861 4898) no Hoare annotation was computed. [2019-10-13 20:22:14,869 INFO L443 ceAbstractionStarter]: For program point L4869(lines 4869 4872) no Hoare annotation was computed. [2019-10-13 20:22:14,869 INFO L443 ceAbstractionStarter]: For program point L4892-1(line 4892) no Hoare annotation was computed. [2019-10-13 20:22:14,869 INFO L439 ceAbstractionStarter]: At program point pppox_createENTRY(lines 4861 4898) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,870 INFO L439 ceAbstractionStarter]: At program point L4892(line 4892) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (and (<= ~ldv_module_refcounter~0 2) (<= 2 ~ldv_module_refcounter~0) (let ((.cse4 (+ (* pppox_create_~protocol 4) |~#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) 8))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (<= (+ .cse0 .cse1) (+ (* 4294967296 (div (+ .cse0 .cse1 (- 1)) 4294967296)) 4294967295))))) (= pppox_create_~tmp~2 1))) [2019-10-13 20:22:14,870 INFO L443 ceAbstractionStarter]: For program point L4886(lines 4886 4889) no Hoare annotation was computed. [2019-10-13 20:22:14,870 INFO L443 ceAbstractionStarter]: For program point L4884-1(line 4884) no Hoare annotation was computed. [2019-10-13 20:22:14,870 INFO L439 ceAbstractionStarter]: At program point L4884(line 4884) the Hoare annotation is: (or (let ((.cse2 (+ (* pppox_create_~protocol 4) |~#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) 8))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) .cse1) |pppox_create_#t~mem35.offset|) (= |pppox_create_#t~mem35.base| (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)))) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-13 20:22:14,870 INFO L443 ceAbstractionStarter]: For program point L4880(lines 4880 4890) no Hoare annotation was computed. [2019-10-13 20:22:14,871 INFO L443 ceAbstractionStarter]: For program point L4874(lines 4874 4879) no Hoare annotation was computed. [2019-10-13 20:22:14,871 INFO L443 ceAbstractionStarter]: For program point pppox_createEXIT(lines 4861 4898) no Hoare annotation was computed. [2019-10-13 20:22:14,871 INFO L443 ceAbstractionStarter]: For program point L4874-2(lines 4874 4879) no Hoare annotation was computed. [2019-10-13 20:22:14,871 INFO L443 ceAbstractionStarter]: For program point L4866(lines 4866 4872) no Hoare annotation was computed. [2019-10-13 20:22:14,871 INFO L446 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 5083 5085) the Hoare annotation is: true [2019-10-13 20:22:14,871 INFO L443 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 5083 5085) no Hoare annotation was computed. [2019-10-13 20:22:14,871 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:22:14,871 INFO L446 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:22:14,872 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:22:14,872 INFO L443 ceAbstractionStarter]: For program point external_allocFINAL(lines 5114 5116) no Hoare annotation was computed. [2019-10-13 20:22:14,872 INFO L443 ceAbstractionStarter]: For program point external_allocEXIT(lines 5114 5116) no Hoare annotation was computed. [2019-10-13 20:22:14,877 INFO L443 ceAbstractionStarter]: For program point external_allocENTRY(lines 5114 5116) no Hoare annotation was computed. [2019-10-13 20:22:14,877 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_and_exitEXIT(lines 5033 5042) no Hoare annotation was computed. [2019-10-13 20:22:14,877 INFO L443 ceAbstractionStarter]: For program point L5037(lines 5035 5041) no Hoare annotation was computed. [2019-10-13 20:22:14,877 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_and_exitENTRY(lines 5033 5042) no Hoare annotation was computed. [2019-10-13 20:22:14,878 INFO L443 ceAbstractionStarter]: For program point unregister_pppox_protoEXIT(lines 4747 4759) no Hoare annotation was computed. [2019-10-13 20:22:14,878 INFO L443 ceAbstractionStarter]: For program point unregister_pppox_protoENTRY(lines 4747 4759) no Hoare annotation was computed. [2019-10-13 20:22:14,878 INFO L443 ceAbstractionStarter]: For program point L4751(lines 4751 4754) no Hoare annotation was computed. [2019-10-13 20:22:14,878 INFO L443 ceAbstractionStarter]: For program point L4750(lines 4750 4756) no Hoare annotation was computed. [2019-10-13 20:22:14,878 INFO L443 ceAbstractionStarter]: For program point L4750-1(lines 4747 4759) no Hoare annotation was computed. [2019-10-13 20:22:14,878 INFO L443 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 4909 4917) no Hoare annotation was computed. [2019-10-13 20:22:14,879 INFO L446 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 4909 4917) the Hoare annotation is: true [2019-10-13 20:22:14,879 INFO L443 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 4909 4917) no Hoare annotation was computed. [2019-10-13 20:22:14,879 INFO L443 ceAbstractionStarter]: For program point pppox_unbind_sockEXIT(lines 4760 4773) no Hoare annotation was computed. [2019-10-13 20:22:14,879 INFO L443 ceAbstractionStarter]: For program point L4766(line 4766) no Hoare annotation was computed. [2019-10-13 20:22:14,879 INFO L443 ceAbstractionStarter]: For program point pppox_unbind_sockENTRY(lines 4760 4773) no Hoare annotation was computed. [2019-10-13 20:22:14,879 INFO L443 ceAbstractionStarter]: For program point L4763(lines 4763 4770) no Hoare annotation was computed. [2019-10-13 20:22:14,879 INFO L443 ceAbstractionStarter]: For program point L4765(line 4765) no Hoare annotation was computed. [2019-10-13 20:22:14,879 INFO L443 ceAbstractionStarter]: For program point L4766-1(line 4766) no Hoare annotation was computed. [2019-10-13 20:22:14,880 INFO L443 ceAbstractionStarter]: For program point L4765-1(line 4765) no Hoare annotation was computed. [2019-10-13 20:22:14,880 INFO L443 ceAbstractionStarter]: For program point L4763-2(lines 4760 4773) no Hoare annotation was computed. [2019-10-13 20:22:14,880 INFO L443 ceAbstractionStarter]: For program point ldv_module_refcountFINAL(lines 5043 5048) no Hoare annotation was computed. [2019-10-13 20:22:14,880 INFO L443 ceAbstractionStarter]: For program point ldv_module_refcountENTRY(lines 5043 5048) no Hoare annotation was computed. [2019-10-13 20:22:14,880 INFO L443 ceAbstractionStarter]: For program point ldv_module_refcountEXIT(lines 5043 5048) no Hoare annotation was computed. [2019-10-13 20:22:14,880 INFO L443 ceAbstractionStarter]: For program point release_sockENTRY(lines 5103 5105) no Hoare annotation was computed. [2019-10-13 20:22:14,880 INFO L443 ceAbstractionStarter]: For program point release_sockEXIT(lines 5103 5105) no Hoare annotation was computed. [2019-10-13 20:22:14,880 INFO L443 ceAbstractionStarter]: For program point release_sockFINAL(lines 5103 5105) no Hoare annotation was computed. [2019-10-13 20:22:14,881 INFO L443 ceAbstractionStarter]: For program point L4735(lines 4735 4738) no Hoare annotation was computed. [2019-10-13 20:22:14,881 INFO L443 ceAbstractionStarter]: For program point L4732(lines 4732 4738) no Hoare annotation was computed. [2019-10-13 20:22:14,881 INFO L443 ceAbstractionStarter]: For program point register_pppox_protoEXIT(lines 4729 4746) no Hoare annotation was computed. [2019-10-13 20:22:14,881 INFO L443 ceAbstractionStarter]: For program point register_pppox_protoENTRY(lines 4729 4746) no Hoare annotation was computed. [2019-10-13 20:22:14,881 INFO L443 ceAbstractionStarter]: For program point L4739(lines 4739 4742) no Hoare annotation was computed. [2019-10-13 20:22:14,881 INFO L443 ceAbstractionStarter]: For program point register_pppox_protoFINAL(lines 4729 4746) no Hoare annotation was computed. [2019-10-13 20:22:14,881 INFO L443 ceAbstractionStarter]: For program point pppox_initFINAL(lines 4900 4908) no Hoare annotation was computed. [2019-10-13 20:22:14,881 INFO L443 ceAbstractionStarter]: For program point L4904-1(line 4904) no Hoare annotation was computed. [2019-10-13 20:22:14,882 INFO L446 ceAbstractionStarter]: At program point pppox_initENTRY(lines 4900 4908) the Hoare annotation is: true [2019-10-13 20:22:14,882 INFO L446 ceAbstractionStarter]: At program point L4904(line 4904) the Hoare annotation is: true [2019-10-13 20:22:14,882 INFO L443 ceAbstractionStarter]: For program point pppox_initEXIT(lines 4900 4908) no Hoare annotation was computed. [2019-10-13 20:22:14,882 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:22:14,882 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) [2019-10-13 20:22:14,882 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:22:14,882 INFO L446 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 5049 5060) the Hoare annotation is: true [2019-10-13 20:22:14,883 INFO L439 ceAbstractionStarter]: At program point L5054(line 5054) the Hoare annotation is: (not (= 1 ~ldv_module_refcounter~0)) [2019-10-13 20:22:14,883 INFO L443 ceAbstractionStarter]: For program point L5052(lines 5049 5060) no Hoare annotation was computed. [2019-10-13 20:22:14,883 INFO L443 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 5049 5060) no Hoare annotation was computed. [2019-10-13 20:22:14,883 INFO L443 ceAbstractionStarter]: For program point ppp_unregister_channelEXIT(lines 5100 5102) no Hoare annotation was computed. [2019-10-13 20:22:14,883 INFO L443 ceAbstractionStarter]: For program point ppp_unregister_channelENTRY(lines 5100 5102) no Hoare annotation was computed. [2019-10-13 20:22:14,883 INFO L443 ceAbstractionStarter]: For program point ppp_unregister_channelFINAL(lines 5100 5102) no Hoare annotation was computed. [2019-10-13 20:22:14,883 INFO L443 ceAbstractionStarter]: For program point ppp_channel_indexENTRY(lines 5097 5099) no Hoare annotation was computed. [2019-10-13 20:22:14,883 INFO L443 ceAbstractionStarter]: For program point ppp_channel_indexEXIT(lines 5097 5099) no Hoare annotation was computed. [2019-10-13 20:22:14,884 INFO L443 ceAbstractionStarter]: For program point ppp_channel_indexFINAL(lines 5097 5099) no Hoare annotation was computed. [2019-10-13 20:22:14,884 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_get_1FINAL(lines 5061 5069) no Hoare annotation was computed. [2019-10-13 20:22:14,884 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_get_1EXIT(lines 5061 5069) no Hoare annotation was computed. [2019-10-13 20:22:14,884 INFO L439 ceAbstractionStarter]: At program point ldv_try_module_get_1ENTRY(lines 5061 5069) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,884 INFO L439 ceAbstractionStarter]: At program point L5065(line 5065) the Hoare annotation is: (or (and (= ldv_try_module_get_1_~module.base |ldv_try_module_get_1_#in~module.base|) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (= |ldv_try_module_get_1_#in~module.offset| ldv_try_module_get_1_~module.offset)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-13 20:22:14,884 INFO L443 ceAbstractionStarter]: For program point L5065-1(line 5065) no Hoare annotation was computed. [2019-10-13 20:22:14,884 INFO L446 ceAbstractionStarter]: At program point sock_registerENTRY(lines 5107 5109) the Hoare annotation is: true [2019-10-13 20:22:14,885 INFO L443 ceAbstractionStarter]: For program point sock_registerEXIT(lines 5107 5109) no Hoare annotation was computed. [2019-10-13 20:22:14,885 INFO L443 ceAbstractionStarter]: For program point sock_registerFINAL(lines 5107 5109) no Hoare annotation was computed. [2019-10-13 20:22:14,885 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:22:14,886 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= 1 ~ldv_module_refcounter~0) [2019-10-13 20:22:14,886 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:22:14,886 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:22:14,886 INFO L439 ceAbstractionStarter]: At program point L5023(line 5023) the Hoare annotation is: (not (<= 2 |old(~ldv_module_refcounter~0)|)) [2019-10-13 20:22:14,886 INFO L443 ceAbstractionStarter]: For program point L5020-2(lines 5017 5032) no Hoare annotation was computed. [2019-10-13 20:22:14,886 INFO L443 ceAbstractionStarter]: For program point L5021(lines 5021 5026) no Hoare annotation was computed. [2019-10-13 20:22:14,887 INFO L443 ceAbstractionStarter]: For program point L5020(lines 5020 5029) no Hoare annotation was computed. [2019-10-13 20:22:14,887 INFO L443 ceAbstractionStarter]: For program point L5021-1(lines 5021 5026) no Hoare annotation was computed. [2019-10-13 20:22:14,887 INFO L439 ceAbstractionStarter]: At program point ldv_module_putENTRY(lines 5017 5032) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2019-10-13 20:22:14,887 INFO L443 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 5017 5032) no Hoare annotation was computed. [2019-10-13 20:22:14,887 INFO L446 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4981 4986) the Hoare annotation is: true [2019-10-13 20:22:14,888 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4984) no Hoare annotation was computed. [2019-10-13 20:22:14,888 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4981 4986) no Hoare annotation was computed. [2019-10-13 20:22:14,888 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4981 4986) no Hoare annotation was computed. [2019-10-13 20:22:14,888 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_2FINAL(lines 5070 5078) no Hoare annotation was computed. [2019-10-13 20:22:14,888 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_2EXIT(lines 5070 5078) no Hoare annotation was computed. [2019-10-13 20:22:14,889 INFO L439 ceAbstractionStarter]: At program point ldv_module_put_2ENTRY(lines 5070 5078) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2019-10-13 20:22:14,889 INFO L439 ceAbstractionStarter]: At program point L5074(line 5074) the Hoare annotation is: (or (and (= |ldv_module_put_2_#in~ldv_func_arg1.offset| ldv_module_put_2_~ldv_func_arg1.offset) (= ldv_module_put_2_~ldv_func_arg1.base |ldv_module_put_2_#in~ldv_func_arg1.base|) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2019-10-13 20:22:14,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:22:14 BoogieIcfgContainer [2019-10-13 20:22:14,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 20:22:14,915 INFO L168 Benchmark]: Toolchain (without parser) took 7086.94 ms. Allocated memory was 137.9 MB in the beginning and 315.1 MB in the end (delta: 177.2 MB). Free memory was 95.8 MB in the beginning and 127.4 MB in the end (delta: -31.6 MB). Peak memory consumption was 145.6 MB. Max. memory is 7.1 GB. [2019-10-13 20:22:14,921 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-13 20:22:14,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1350.50 ms. Allocated memory was 137.9 MB in the beginning and 206.6 MB in the end (delta: 68.7 MB). Free memory was 95.6 MB in the beginning and 125.9 MB in the end (delta: -30.3 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-10-13 20:22:14,923 INFO L168 Benchmark]: Boogie Preprocessor took 90.23 ms. Allocated memory is still 206.6 MB. Free memory was 125.9 MB in the beginning and 122.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-10-13 20:22:14,924 INFO L168 Benchmark]: RCFGBuilder took 868.06 ms. Allocated memory was 206.6 MB in the beginning and 238.6 MB in the end (delta: 32.0 MB). Free memory was 122.2 MB in the beginning and 176.3 MB in the end (delta: -54.1 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2019-10-13 20:22:14,925 INFO L168 Benchmark]: TraceAbstraction took 4771.99 ms. Allocated memory was 238.6 MB in the beginning and 315.1 MB in the end (delta: 76.5 MB). Free memory was 176.3 MB in the beginning and 127.4 MB in the end (delta: 48.9 MB). Peak memory consumption was 125.4 MB. Max. memory is 7.1 GB. [2019-10-13 20:22:14,939 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1350.50 ms. Allocated memory was 137.9 MB in the beginning and 206.6 MB in the end (delta: 68.7 MB). Free memory was 95.6 MB in the beginning and 125.9 MB in the end (delta: -30.3 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.23 ms. Allocated memory is still 206.6 MB. Free memory was 125.9 MB in the beginning and 122.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 868.06 ms. Allocated memory was 206.6 MB in the beginning and 238.6 MB in the end (delta: 32.0 MB). Free memory was 122.2 MB in the beginning and 176.3 MB in the end (delta: -54.1 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4771.99 ms. Allocated memory was 238.6 MB in the beginning and 315.1 MB in the end (delta: 76.5 MB). Free memory was 176.3 MB in the beginning and 127.4 MB in the end (delta: 48.9 MB). Peak memory consumption was 125.4 MB. Max. memory is 7.1 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)) || ldv_module_refcounter == \old(ldv_module_refcounter) - InvariantResult [Line: 4930]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || ldv_module_refcounter == \old(ldv_module_refcounter) - InvariantResult [Line: 4864]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || ldv_module_refcounter == \old(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)) || ldv_module_refcounter == \old(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 35 procedures, 175 locations, 1 error locations. Result: SAFE, OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 750 SDtfs, 561 SDslu, 2570 SDs, 0 SdLazy, 689 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s 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 DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 58 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 231 PreInvPairs, 248 NumberOfFragments, 503 HoareAnnotationTreeSize, 231 FomulaSimplifications, 623 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 35 FomulaSimplificationsInter, 473 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 565 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 145000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...