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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 02:09:55,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 02:09:55,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 02:09:55,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 02:09:55,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 02:09:55,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 02:09:55,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 02:09:55,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 02:09:55,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 02:09:55,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 02:09:55,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 02:09:55,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 02:09:55,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 02:09:55,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 02:09:55,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 02:09:55,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 02:09:55,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 02:09:55,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 02:09:55,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 02:09:55,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 02:09:55,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 02:09:55,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 02:09:55,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 02:09:55,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 02:09:55,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 02:09:55,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 02:09:55,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 02:09:55,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 02:09:55,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 02:09:55,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 02:09:55,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 02:09:55,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 02:09:55,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 02:09:55,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 02:09:55,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 02:09:55,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 02:09:55,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 02:09:55,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 02:09:55,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 02:09:55,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 02:09:55,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 02:09:55,434 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-15 02:09:55,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 02:09:55,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 02:09:55,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 02:09:55,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 02:09:55,458 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 02:09:55,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 02:09:55,458 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 02:09:55,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 02:09:55,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 02:09:55,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 02:09:55,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 02:09:55,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 02:09:55,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 02:09:55,461 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 02:09:55,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 02:09:55,462 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 02:09:55,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 02:09:55,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 02:09:55,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 02:09:55,462 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 02:09:55,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 02:09:55,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 02:09:55,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 02:09:55,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 02:09:55,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 02:09:55,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 02:09:55,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 02:09:55,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 02:09:55,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 02:09:55,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 02:09:55,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 02:09:55,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 02:09:55,814 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 02:09:55,814 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 02:09:55,815 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-15 02:09:55,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e0d0df6/86c51d60fae4405da35e733fd104532d/FLAG2daac135a [2019-10-15 02:09:56,617 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 02:09:56,618 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-15 02:09:56,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e0d0df6/86c51d60fae4405da35e733fd104532d/FLAG2daac135a [2019-10-15 02:09:56,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e0d0df6/86c51d60fae4405da35e733fd104532d [2019-10-15 02:09:56,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 02:09:56,753 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 02:09:56,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 02:09:56,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 02:09:56,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 02:09:56,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:09:56" (1/1) ... [2019-10-15 02:09:56,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35abdc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:56, skipping insertion in model container [2019-10-15 02:09:56,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:09:56" (1/1) ... [2019-10-15 02:09:56,769 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 02:09:56,857 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 02:09:57,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:09:57,752 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 02:09:57,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:09:57,973 INFO L192 MainTranslator]: Completed translation [2019-10-15 02:09:57,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:57 WrapperNode [2019-10-15 02:09:57,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 02:09:57,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 02:09:57,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 02:09:57,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 02:09:57,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:57" (1/1) ... [2019-10-15 02:09:57,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:57" (1/1) ... [2019-10-15 02:09:58,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:57" (1/1) ... [2019-10-15 02:09:58,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:57" (1/1) ... [2019-10-15 02:09:58,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:57" (1/1) ... [2019-10-15 02:09:58,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:57" (1/1) ... [2019-10-15 02:09:58,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:57" (1/1) ... [2019-10-15 02:09:58,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 02:09:58,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 02:09:58,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 02:09:58,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 02:09:58,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:57" (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-15 02:09:58,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 02:09:58,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 02:09:58,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-10-15 02:09:58,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-15 02:09:58,193 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock [2019-10-15 02:09:58,193 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_sk [2019-10-15 02:09:58,193 INFO L138 BoogieDeclarations]: Found implementation of procedure register_pppox_proto [2019-10-15 02:09:58,193 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_pppox_proto [2019-10-15 02:09:58,194 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_unbind_sock [2019-10-15 02:09:58,194 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_ioctl [2019-10-15 02:09:58,194 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2019-10-15 02:09:58,194 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2019-10-15 02:09:58,195 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2019-10-15 02:09:58,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 02:09:58,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-10-15 02:09:58,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_get [2019-10-15 02:09:58,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2019-10-15 02:09:58,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2019-10-15 02:09:58,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_and_exit [2019-10-15 02:09:58,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_refcount [2019-10-15 02:09:58,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-15 02:09:58,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_1 [2019-10-15 02:09:58,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_2 [2019-10-15 02:09:58,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_module [2019-10-15 02:09:58,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-15 02:09:58,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_int [2019-10-15 02:09:58,198 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock_nested [2019-10-15 02:09:58,199 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-15 02:09:58,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_channel_index [2019-10-15 02:09:58,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_unregister_channel [2019-10-15 02:09:58,199 INFO L138 BoogieDeclarations]: Found implementation of procedure release_sock [2019-10-15 02:09:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2019-10-15 02:09:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2019-10-15 02:09:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-15 02:09:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-15 02:09:58,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 02:09:58,201 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-15 02:09:58,201 INFO L130 BoogieDeclarations]: Found specification of procedure __request_module [2019-10-15 02:09:58,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_1 [2019-10-15 02:09:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_2 [2019-10-15 02:09:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2019-10-15 02:09:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_get [2019-10-15 02:09:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2019-10-15 02:09:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_refcount [2019-10-15 02:09:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_and_exit [2019-10-15 02:09:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2019-10-15 02:09:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2019-10-15 02:09:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unregister_channel [2019-10-15 02:09:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_index [2019-10-15 02:09:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock_nested [2019-10-15 02:09:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock [2019-10-15 02:09:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure release_sock [2019-10-15 02:09:58,205 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_sk [2019-10-15 02:09:58,205 INFO L130 BoogieDeclarations]: Found specification of procedure register_pppox_proto [2019-10-15 02:09:58,205 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_pppox_proto [2019-10-15 02:09:58,205 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_unbind_sock [2019-10-15 02:09:58,205 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_ioctl [2019-10-15 02:09:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 02:09:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 02:09:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 02:09:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 02:09:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-10-15 02:09:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2019-10-15 02:09:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 02:09:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-15 02:09:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2019-10-15 02:09:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2019-10-15 02:09:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-15 02:09:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-15 02:09:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 02:09:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 02:09:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-10-15 02:09:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_int [2019-10-15 02:09:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 02:09:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-15 02:09:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 02:09:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-15 02:09:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 02:09:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 02:09:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 02:09:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 02:09:58,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 02:09:58,779 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 02:09:58,944 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-15 02:09:58,944 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-15 02:09:58,945 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 02:09:58,945 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 02:09:58,946 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 02:09:58,976 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-15 02:09:58,977 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-15 02:09:59,090 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_module_put_and_exitFINAL: assume true; [2019-10-15 02:09:59,527 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 02:09:59,527 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 02:09:59,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:09:59 BoogieIcfgContainer [2019-10-15 02:09:59,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 02:09:59,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 02:09:59,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 02:09:59,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 02:09:59,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:09:56" (1/3) ... [2019-10-15 02:09:59,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9fc24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:09:59, skipping insertion in model container [2019-10-15 02:09:59,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:09:57" (2/3) ... [2019-10-15 02:09:59,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9fc24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:09:59, skipping insertion in model container [2019-10-15 02:09:59,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:09:59" (3/3) ... [2019-10-15 02:09:59,538 INFO L109 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-net-pppox.ko.cil.out.i [2019-10-15 02:09:59,548 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 02:09:59,558 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 02:09:59,570 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 02:09:59,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 02:09:59,598 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 02:09:59,598 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 02:09:59,598 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 02:09:59,598 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 02:09:59,598 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 02:09:59,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 02:09:59,599 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 02:09:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-10-15 02:09:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 02:09:59,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:09:59,630 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] [2019-10-15 02:09:59,632 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:09:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:09:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash 740813243, now seen corresponding path program 1 times [2019-10-15 02:09:59,649 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:09:59,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121835582] [2019-10-15 02:09:59,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:09:59,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:09:59,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:09:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:09:59,977 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-15 02:09:59,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121835582] [2019-10-15 02:09:59,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:09:59,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:09:59,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990440757] [2019-10-15 02:09:59,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:09:59,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:00,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:10:00,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:00,010 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2019-10-15 02:10:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:00,100 INFO L93 Difference]: Finished difference Result 190 states and 235 transitions. [2019-10-15 02:10:00,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:10:00,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 02:10:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:00,117 INFO L225 Difference]: With dead ends: 190 [2019-10-15 02:10:00,117 INFO L226 Difference]: Without dead ends: 115 [2019-10-15 02:10:00,122 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-15 02:10:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-15 02:10:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2019-10-15 02:10:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-15 02:10:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2019-10-15 02:10:00,186 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 21 [2019-10-15 02:10:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:00,186 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2019-10-15 02:10:00,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:10:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2019-10-15 02:10:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 02:10:00,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:00,190 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] [2019-10-15 02:10:00,191 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:00,191 INFO L82 PathProgramCache]: Analyzing trace with hash 964196355, now seen corresponding path program 1 times [2019-10-15 02:10:00,192 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:00,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518054029] [2019-10-15 02:10:00,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:00,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:00,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:00,444 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-15 02:10:00,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518054029] [2019-10-15 02:10:00,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:00,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 02:10:00,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827673452] [2019-10-15 02:10:00,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 02:10:00,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 02:10:00,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 02:10:00,453 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 7 states. [2019-10-15 02:10:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:00,570 INFO L93 Difference]: Finished difference Result 194 states and 233 transitions. [2019-10-15 02:10:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 02:10:00,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-10-15 02:10:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:00,578 INFO L225 Difference]: With dead ends: 194 [2019-10-15 02:10:00,579 INFO L226 Difference]: Without dead ends: 103 [2019-10-15 02:10:00,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 02:10:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-15 02:10:00,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-10-15 02:10:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-15 02:10:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2019-10-15 02:10:00,607 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 48 [2019-10-15 02:10:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:00,608 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2019-10-15 02:10:00,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 02:10:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2019-10-15 02:10:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 02:10:00,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:00,611 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] [2019-10-15 02:10:00,611 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash -618827266, now seen corresponding path program 1 times [2019-10-15 02:10:00,612 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:00,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943114864] [2019-10-15 02:10:00,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:00,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:00,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:00,971 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-15 02:10:00,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943114864] [2019-10-15 02:10:00,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:00,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 02:10:00,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678233038] [2019-10-15 02:10:00,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 02:10:00,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:00,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 02:10:00,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:10:00,979 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 10 states. [2019-10-15 02:10:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:02,052 INFO L93 Difference]: Finished difference Result 156 states and 182 transitions. [2019-10-15 02:10:02,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 02:10:02,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-10-15 02:10:02,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:02,056 INFO L225 Difference]: With dead ends: 156 [2019-10-15 02:10:02,056 INFO L226 Difference]: Without dead ends: 153 [2019-10-15 02:10:02,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2019-10-15 02:10:02,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-15 02:10:02,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2019-10-15 02:10:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-15 02:10:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2019-10-15 02:10:02,105 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 52 [2019-10-15 02:10:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:02,106 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2019-10-15 02:10:02,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 02:10:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2019-10-15 02:10:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 02:10:02,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:02,111 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] [2019-10-15 02:10:02,114 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1544933582, now seen corresponding path program 1 times [2019-10-15 02:10:02,115 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:02,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500162456] [2019-10-15 02:10:02,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:02,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:02,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:02,509 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-15 02:10:02,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500162456] [2019-10-15 02:10:02,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:02,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 02:10:02,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455392388] [2019-10-15 02:10:02,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 02:10:02,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:02,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 02:10:02,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:10:02,512 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand 10 states. [2019-10-15 02:10:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:02,770 INFO L93 Difference]: Finished difference Result 180 states and 216 transitions. [2019-10-15 02:10:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 02:10:02,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-15 02:10:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:02,774 INFO L225 Difference]: With dead ends: 180 [2019-10-15 02:10:02,774 INFO L226 Difference]: Without dead ends: 169 [2019-10-15 02:10:02,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-10-15 02:10:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-15 02:10:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141. [2019-10-15 02:10:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-15 02:10:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2019-10-15 02:10:02,809 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 55 [2019-10-15 02:10:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:02,810 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2019-10-15 02:10:02,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 02:10:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2019-10-15 02:10:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-15 02:10:02,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:02,821 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] [2019-10-15 02:10:02,821 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:02,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1422916664, now seen corresponding path program 1 times [2019-10-15 02:10:02,822 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:02,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972579973] [2019-10-15 02:10:02,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:02,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:02,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:03,316 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-15 02:10:03,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972579973] [2019-10-15 02:10:03,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:03,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 02:10:03,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335262600] [2019-10-15 02:10:03,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 02:10:03,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:03,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 02:10:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 02:10:03,322 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand 13 states. [2019-10-15 02:10:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:03,751 INFO L93 Difference]: Finished difference Result 208 states and 242 transitions. [2019-10-15 02:10:03,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 02:10:03,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2019-10-15 02:10:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:03,754 INFO L225 Difference]: With dead ends: 208 [2019-10-15 02:10:03,754 INFO L226 Difference]: Without dead ends: 102 [2019-10-15 02:10:03,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-10-15 02:10:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-15 02:10:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-15 02:10:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-15 02:10:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2019-10-15 02:10:03,789 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 69 [2019-10-15 02:10:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:03,789 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2019-10-15 02:10:03,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 02:10:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2019-10-15 02:10:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-15 02:10:03,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:03,791 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] [2019-10-15 02:10:03,792 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash -692688272, now seen corresponding path program 1 times [2019-10-15 02:10:03,795 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:03,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632726611] [2019-10-15 02:10:03,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:03,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:03,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:04,103 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-15 02:10:04,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632726611] [2019-10-15 02:10:04,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:04,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 02:10:04,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077305871] [2019-10-15 02:10:04,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 02:10:04,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:04,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 02:10:04,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-10-15 02:10:04,109 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 14 states. [2019-10-15 02:10:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:04,493 INFO L93 Difference]: Finished difference Result 173 states and 216 transitions. [2019-10-15 02:10:04,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 02:10:04,494 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-10-15 02:10:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:04,496 INFO L225 Difference]: With dead ends: 173 [2019-10-15 02:10:04,497 INFO L226 Difference]: Without dead ends: 162 [2019-10-15 02:10:04,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-10-15 02:10:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-15 02:10:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-10-15 02:10:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-15 02:10:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2019-10-15 02:10:04,517 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 71 [2019-10-15 02:10:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:04,517 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2019-10-15 02:10:04,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 02:10:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2019-10-15 02:10:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 02:10:04,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:04,520 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:04,520 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:04,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:04,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1310847568, now seen corresponding path program 1 times [2019-10-15 02:10:04,521 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:04,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198847253] [2019-10-15 02:10:04,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:04,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:04,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 02:10:05,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198847253] [2019-10-15 02:10:05,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228001524] [2019-10-15 02:10:05,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:10:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:05,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 68 conjunts are in the unsatisfiable core [2019-10-15 02:10:05,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:10:05,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 02:10:05,599 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:10:06,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:06,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:06,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:06,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:06,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:06,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:06,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:07,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:07,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:07,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:07,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:07,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:07,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:07,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 02:10:07,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 02:10:07,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [20, 17] total 41 [2019-10-15 02:10:07,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712877066] [2019-10-15 02:10:07,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 02:10:07,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:07,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 02:10:07,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1445, Unknown=0, NotChecked=0, Total=1640 [2019-10-15 02:10:07,923 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand 11 states. [2019-10-15 02:10:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:08,561 INFO L93 Difference]: Finished difference Result 154 states and 187 transitions. [2019-10-15 02:10:08,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-15 02:10:08,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-10-15 02:10:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:08,562 INFO L225 Difference]: With dead ends: 154 [2019-10-15 02:10:08,562 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 02:10:08,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 179 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=382, Invalid=1970, Unknown=0, NotChecked=0, Total=2352 [2019-10-15 02:10:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 02:10:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 02:10:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 02:10:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 02:10:08,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2019-10-15 02:10:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:08,566 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 02:10:08,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 02:10:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 02:10:08,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 02:10:08,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:10:08,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 02:10:09,720 INFO L443 ceAbstractionStarter]: For program point ldv_module_getEXIT(lines 4989 4998) no Hoare annotation was computed. [2019-10-15 02:10:09,721 INFO L443 ceAbstractionStarter]: For program point ldv_module_getENTRY(lines 4989 4998) no Hoare annotation was computed. [2019-10-15 02:10:09,721 INFO L443 ceAbstractionStarter]: For program point kfreeEXIT(lines 5118 5120) no Hoare annotation was computed. [2019-10-15 02:10:09,721 INFO L443 ceAbstractionStarter]: For program point kfreeENTRY(lines 5118 5120) no Hoare annotation was computed. [2019-10-15 02:10:09,721 INFO L443 ceAbstractionStarter]: For program point might_faultFINAL(lines 5093 5095) no Hoare annotation was computed. [2019-10-15 02:10:09,721 INFO L443 ceAbstractionStarter]: For program point might_faultEXIT(lines 5093 5095) no Hoare annotation was computed. [2019-10-15 02:10:09,721 INFO L443 ceAbstractionStarter]: For program point lock_sockENTRY(lines 4708 4716) no Hoare annotation was computed. [2019-10-15 02:10:09,722 INFO L443 ceAbstractionStarter]: For program point lock_sockFINAL(lines 4708 4716) no Hoare annotation was computed. [2019-10-15 02:10:09,722 INFO L443 ceAbstractionStarter]: For program point L4712(line 4712) no Hoare annotation was computed. [2019-10-15 02:10:09,722 INFO L443 ceAbstractionStarter]: For program point lock_sockEXIT(lines 4708 4716) no Hoare annotation was computed. [2019-10-15 02:10:09,722 INFO L443 ceAbstractionStarter]: For program point L4788-1(lines 4783 4859) no Hoare annotation was computed. [2019-10-15 02:10:09,722 INFO L443 ceAbstractionStarter]: For program point L4788(line 4788) no Hoare annotation was computed. [2019-10-15 02:10:09,722 INFO L443 ceAbstractionStarter]: For program point L4797(lines 4797 4800) no Hoare annotation was computed. [2019-10-15 02:10:09,722 INFO L443 ceAbstractionStarter]: For program point L4794(lines 4794 4852) no Hoare annotation was computed. [2019-10-15 02:10:09,722 INFO L443 ceAbstractionStarter]: For program point L4856(line 4856) no Hoare annotation was computed. [2019-10-15 02:10:09,723 INFO L443 ceAbstractionStarter]: For program point L4786(line 4786) no Hoare annotation was computed. [2019-10-15 02:10:09,723 INFO L443 ceAbstractionStarter]: For program point L4786-1(line 4786) no Hoare annotation was computed. [2019-10-15 02:10:09,723 INFO L443 ceAbstractionStarter]: For program point pppox_ioctlEXIT(lines 4774 4860) no Hoare annotation was computed. [2019-10-15 02:10:09,723 INFO L443 ceAbstractionStarter]: For program point L4803(line 4803) no Hoare annotation was computed. [2019-10-15 02:10:09,723 INFO L443 ceAbstractionStarter]: For program point L4803-1(line 4803) no Hoare annotation was computed. [2019-10-15 02:10:09,725 INFO L443 ceAbstractionStarter]: For program point pppox_ioctlENTRY(lines 4774 4860) no Hoare annotation was computed. [2019-10-15 02:10:09,725 INFO L443 ceAbstractionStarter]: For program point L4845(line 4845) no Hoare annotation was computed. [2019-10-15 02:10:09,725 INFO L443 ceAbstractionStarter]: For program point L4845-1(line 4845) no Hoare annotation was computed. [2019-10-15 02:10:09,725 INFO L443 ceAbstractionStarter]: For program point L4841(lines 4841 4850) no Hoare annotation was computed. [2019-10-15 02:10:09,725 INFO L443 ceAbstractionStarter]: For program point L4804-1(line 4804) no Hoare annotation was computed. [2019-10-15 02:10:09,725 INFO L443 ceAbstractionStarter]: For program point L4804(line 4804) no Hoare annotation was computed. [2019-10-15 02:10:09,726 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4922 4980) no Hoare annotation was computed. [2019-10-15 02:10:09,726 INFO L443 ceAbstractionStarter]: For program point L4945(lines 4945 4959) no Hoare annotation was computed. [2019-10-15 02:10:09,726 INFO L443 ceAbstractionStarter]: For program point L4976(line 4976) no Hoare annotation was computed. [2019-10-15 02:10:09,726 INFO L439 ceAbstractionStarter]: At program point L4972(lines 4930 4979) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-15 02:10:09,727 INFO L439 ceAbstractionStarter]: At program point L4968(lines 4930 4979) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-15 02:10:09,727 INFO L439 ceAbstractionStarter]: At program point L4933(line 4933) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-15 02:10:09,727 INFO L439 ceAbstractionStarter]: At program point L4933-1(line 4933) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-15 02:10:09,727 INFO L439 ceAbstractionStarter]: At program point L4960(lines 4930 4979) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-15 02:10:09,727 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 4922 4980) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-15 02:10:09,727 INFO L443 ceAbstractionStarter]: For program point L4952(line 4952) no Hoare annotation was computed. [2019-10-15 02:10:09,727 INFO L439 ceAbstractionStarter]: At program point L4946(lines 4945 4959) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-15 02:10:09,728 INFO L443 ceAbstractionStarter]: For program point L4934(line 4934) no Hoare annotation was computed. [2019-10-15 02:10:09,728 INFO L443 ceAbstractionStarter]: For program point L4936(lines 4936 4939) no Hoare annotation was computed. [2019-10-15 02:10:09,728 INFO L439 ceAbstractionStarter]: At program point L4965(lines 4965 4969) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-15 02:10:09,728 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-15 02:10:09,730 INFO L443 ceAbstractionStarter]: For program point L5004-1(line 5004) no Hoare annotation was computed. [2019-10-15 02:10:09,730 INFO L443 ceAbstractionStarter]: For program point L5002(lines 5002 5013) no Hoare annotation was computed. [2019-10-15 02:10:09,731 INFO L439 ceAbstractionStarter]: At program point L5004(line 5004) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (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|))) [2019-10-15 02:10:09,731 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 4999 5016) no Hoare annotation was computed. [2019-10-15 02:10:09,731 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 4999 5016) no Hoare annotation was computed. [2019-10-15 02:10:09,731 INFO L443 ceAbstractionStarter]: For program point lock_sock_nestedENTRY(lines 5090 5092) no Hoare annotation was computed. [2019-10-15 02:10:09,731 INFO L443 ceAbstractionStarter]: For program point lock_sock_nestedEXIT(lines 5090 5092) no Hoare annotation was computed. [2019-10-15 02:10:09,731 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~int~X~int~TO~intENTRY(line -1) no Hoare annotation was computed. [2019-10-15 02:10:09,731 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~int~X~int~TO~intEXIT(line -1) no Hoare annotation was computed. [2019-10-15 02:10:09,731 INFO L446 ceAbstractionStarter]: At program point sock_unregisterENTRY(lines 5110 5112) the Hoare annotation is: true [2019-10-15 02:10:09,732 INFO L443 ceAbstractionStarter]: For program point sock_unregisterEXIT(lines 5110 5112) no Hoare annotation was computed. [2019-10-15 02:10:09,732 INFO L443 ceAbstractionStarter]: For program point pppox_skEXIT(lines 4718 4723) no Hoare annotation was computed. [2019-10-15 02:10:09,732 INFO L443 ceAbstractionStarter]: For program point pppox_skENTRY(lines 4718 4723) no Hoare annotation was computed. [2019-10-15 02:10:09,732 INFO L446 ceAbstractionStarter]: At program point ldv_undefined_intENTRY(lines 5087 5089) the Hoare annotation is: true [2019-10-15 02:10:09,732 INFO L443 ceAbstractionStarter]: For program point ldv_undefined_intEXIT(lines 5087 5089) no Hoare annotation was computed. [2019-10-15 02:10:09,732 INFO L443 ceAbstractionStarter]: For program point __request_moduleEXIT(lines 5080 5082) no Hoare annotation was computed. [2019-10-15 02:10:09,732 INFO L443 ceAbstractionStarter]: For program point __request_moduleENTRY(lines 5080 5082) no Hoare annotation was computed. [2019-10-15 02:10:09,735 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-15 02:10:09,735 INFO L439 ceAbstractionStarter]: At program point L4893(line 4893) the Hoare annotation is: (or (and (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)) (= (+ |old(~ldv_module_refcounter~0)| 1) ~ldv_module_refcounter~0) (= pppox_create_~tmp~2 1)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-10-15 02:10:09,735 INFO L443 ceAbstractionStarter]: For program point L4893-1(line 4893) no Hoare annotation was computed. [2019-10-15 02:10:09,735 INFO L443 ceAbstractionStarter]: For program point L4869(lines 4869 4872) no Hoare annotation was computed. [2019-10-15 02:10:09,735 INFO L443 ceAbstractionStarter]: For program point L4892-1(line 4892) no Hoare annotation was computed. [2019-10-15 02:10:09,736 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-15 02:10:09,736 INFO L439 ceAbstractionStarter]: At program point L4892(line 4892) the Hoare annotation is: (or (and (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))))) (= (+ |old(~ldv_module_refcounter~0)| 1) ~ldv_module_refcounter~0) (= pppox_create_~tmp~2 1)) (not (<= |old(~ldv_module_refcounter~0)| 1)) (not (< 0 |old(~ldv_module_refcounter~0)|))) [2019-10-15 02:10:09,736 INFO L443 ceAbstractionStarter]: For program point L4886(lines 4886 4889) no Hoare annotation was computed. [2019-10-15 02:10:09,738 INFO L443 ceAbstractionStarter]: For program point L4884-1(line 4884) no Hoare annotation was computed. [2019-10-15 02:10:09,739 INFO L439 ceAbstractionStarter]: At program point L4884(line 4884) the Hoare annotation is: (or (not (<= |old(~ldv_module_refcounter~0)| 1)) (not (< 0 |old(~ldv_module_refcounter~0)|)) (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)|))))) [2019-10-15 02:10:09,739 INFO L443 ceAbstractionStarter]: For program point L4880(lines 4880 4890) no Hoare annotation was computed. [2019-10-15 02:10:09,739 INFO L443 ceAbstractionStarter]: For program point pppox_createEXIT(lines 4861 4898) no Hoare annotation was computed. [2019-10-15 02:10:09,739 INFO L443 ceAbstractionStarter]: For program point L4866(lines 4866 4872) no Hoare annotation was computed. [2019-10-15 02:10:09,739 INFO L446 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 5083 5085) the Hoare annotation is: true [2019-10-15 02:10:09,739 INFO L443 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 5083 5085) no Hoare annotation was computed. [2019-10-15 02:10:09,740 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2019-10-15 02:10:09,740 INFO L446 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2019-10-15 02:10:09,740 INFO L443 ceAbstractionStarter]: For program point external_allocEXIT(lines 5114 5116) no Hoare annotation was computed. [2019-10-15 02:10:09,740 INFO L443 ceAbstractionStarter]: For program point external_allocENTRY(lines 5114 5116) no Hoare annotation was computed. [2019-10-15 02:10:09,740 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_and_exitEXIT(lines 5033 5042) no Hoare annotation was computed. [2019-10-15 02:10:09,740 INFO L443 ceAbstractionStarter]: For program point L5037(lines 5035 5041) no Hoare annotation was computed. [2019-10-15 02:10:09,740 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_and_exitENTRY(lines 5033 5042) no Hoare annotation was computed. [2019-10-15 02:10:09,741 INFO L443 ceAbstractionStarter]: For program point unregister_pppox_protoEXIT(lines 4747 4759) no Hoare annotation was computed. [2019-10-15 02:10:09,741 INFO L443 ceAbstractionStarter]: For program point unregister_pppox_protoENTRY(lines 4747 4759) no Hoare annotation was computed. [2019-10-15 02:10:09,741 INFO L443 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 4909 4917) no Hoare annotation was computed. [2019-10-15 02:10:09,741 INFO L446 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 4909 4917) the Hoare annotation is: true [2019-10-15 02:10:09,741 INFO L443 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 4909 4917) no Hoare annotation was computed. [2019-10-15 02:10:09,741 INFO L443 ceAbstractionStarter]: For program point pppox_unbind_sockEXIT(lines 4760 4773) no Hoare annotation was computed. [2019-10-15 02:10:09,742 INFO L443 ceAbstractionStarter]: For program point L4766(line 4766) no Hoare annotation was computed. [2019-10-15 02:10:09,746 INFO L443 ceAbstractionStarter]: For program point pppox_unbind_sockENTRY(lines 4760 4773) no Hoare annotation was computed. [2019-10-15 02:10:09,746 INFO L443 ceAbstractionStarter]: For program point L4763(lines 4763 4770) no Hoare annotation was computed. [2019-10-15 02:10:09,747 INFO L443 ceAbstractionStarter]: For program point L4765(line 4765) no Hoare annotation was computed. [2019-10-15 02:10:09,747 INFO L443 ceAbstractionStarter]: For program point L4766-1(line 4766) no Hoare annotation was computed. [2019-10-15 02:10:09,747 INFO L443 ceAbstractionStarter]: For program point L4765-1(line 4765) no Hoare annotation was computed. [2019-10-15 02:10:09,747 INFO L443 ceAbstractionStarter]: For program point L4763-2(lines 4760 4773) no Hoare annotation was computed. [2019-10-15 02:10:09,749 INFO L443 ceAbstractionStarter]: For program point ldv_module_refcountENTRY(lines 5043 5048) no Hoare annotation was computed. [2019-10-15 02:10:09,749 INFO L443 ceAbstractionStarter]: For program point ldv_module_refcountEXIT(lines 5043 5048) no Hoare annotation was computed. [2019-10-15 02:10:09,749 INFO L443 ceAbstractionStarter]: For program point release_sockENTRY(lines 5103 5105) no Hoare annotation was computed. [2019-10-15 02:10:09,749 INFO L443 ceAbstractionStarter]: For program point release_sockEXIT(lines 5103 5105) no Hoare annotation was computed. [2019-10-15 02:10:09,750 INFO L443 ceAbstractionStarter]: For program point register_pppox_protoEXIT(lines 4729 4746) no Hoare annotation was computed. [2019-10-15 02:10:09,750 INFO L443 ceAbstractionStarter]: For program point register_pppox_protoENTRY(lines 4729 4746) no Hoare annotation was computed. [2019-10-15 02:10:09,750 INFO L443 ceAbstractionStarter]: For program point L4904-1(line 4904) no Hoare annotation was computed. [2019-10-15 02:10:09,750 INFO L446 ceAbstractionStarter]: At program point pppox_initENTRY(lines 4900 4908) the Hoare annotation is: true [2019-10-15 02:10:09,750 INFO L446 ceAbstractionStarter]: At program point L4904(line 4904) the Hoare annotation is: true [2019-10-15 02:10:09,750 INFO L443 ceAbstractionStarter]: For program point pppox_initEXIT(lines 4900 4908) no Hoare annotation was computed. [2019-10-15 02:10:09,750 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-15 02:10:09,751 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 02:10:09,751 INFO L446 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 5049 5060) the Hoare annotation is: true [2019-10-15 02:10:09,751 INFO L439 ceAbstractionStarter]: At program point L5054(line 5054) the Hoare annotation is: (or (not (<= ~ldv_module_refcounter~0 1)) (not (< 0 ~ldv_module_refcounter~0))) [2019-10-15 02:10:09,751 INFO L443 ceAbstractionStarter]: For program point L5052(lines 5049 5060) no Hoare annotation was computed. [2019-10-15 02:10:09,751 INFO L443 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 5049 5060) no Hoare annotation was computed. [2019-10-15 02:10:09,751 INFO L443 ceAbstractionStarter]: For program point ppp_unregister_channelEXIT(lines 5100 5102) no Hoare annotation was computed. [2019-10-15 02:10:09,751 INFO L443 ceAbstractionStarter]: For program point ppp_unregister_channelENTRY(lines 5100 5102) no Hoare annotation was computed. [2019-10-15 02:10:09,751 INFO L443 ceAbstractionStarter]: For program point ppp_channel_indexENTRY(lines 5097 5099) no Hoare annotation was computed. [2019-10-15 02:10:09,752 INFO L443 ceAbstractionStarter]: For program point ppp_channel_indexEXIT(lines 5097 5099) no Hoare annotation was computed. [2019-10-15 02:10:09,752 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_get_1EXIT(lines 5061 5069) no Hoare annotation was computed. [2019-10-15 02:10:09,752 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-15 02:10:09,752 INFO L439 ceAbstractionStarter]: At program point L5065(line 5065) the Hoare annotation is: (or (not (<= |old(~ldv_module_refcounter~0)| 1)) (not (< 0 |old(~ldv_module_refcounter~0)|)) (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))) [2019-10-15 02:10:09,755 INFO L443 ceAbstractionStarter]: For program point L5065-1(line 5065) no Hoare annotation was computed. [2019-10-15 02:10:09,755 INFO L446 ceAbstractionStarter]: At program point sock_registerENTRY(lines 5107 5109) the Hoare annotation is: true [2019-10-15 02:10:09,755 INFO L443 ceAbstractionStarter]: For program point sock_registerEXIT(lines 5107 5109) no Hoare annotation was computed. [2019-10-15 02:10:09,755 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 02:10:09,755 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= 1 ~ldv_module_refcounter~0) [2019-10-15 02:10:09,756 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 02:10:09,756 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 02:10:09,756 INFO L439 ceAbstractionStarter]: At program point L5023(line 5023) the Hoare annotation is: (not (<= 2 |old(~ldv_module_refcounter~0)|)) [2019-10-15 02:10:09,756 INFO L443 ceAbstractionStarter]: For program point L5020-2(lines 5017 5032) no Hoare annotation was computed. [2019-10-15 02:10:09,756 INFO L443 ceAbstractionStarter]: For program point L5021(lines 5021 5026) no Hoare annotation was computed. [2019-10-15 02:10:09,756 INFO L443 ceAbstractionStarter]: For program point L5020(lines 5020 5029) no Hoare annotation was computed. [2019-10-15 02:10:09,756 INFO L443 ceAbstractionStarter]: For program point L5021-1(lines 5021 5026) no Hoare annotation was computed. [2019-10-15 02:10:09,756 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-15 02:10:09,757 INFO L443 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 5017 5032) no Hoare annotation was computed. [2019-10-15 02:10:09,757 INFO L446 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4981 4986) the Hoare annotation is: true [2019-10-15 02:10:09,757 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4981 4986) no Hoare annotation was computed. [2019-10-15 02:10:09,757 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4984) no Hoare annotation was computed. [2019-10-15 02:10:09,757 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_2FINAL(lines 5070 5078) no Hoare annotation was computed. [2019-10-15 02:10:09,757 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_2EXIT(lines 5070 5078) no Hoare annotation was computed. [2019-10-15 02:10:09,758 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-15 02:10:09,758 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-15 02:10:09,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:10:09 BoogieIcfgContainer [2019-10-15 02:10:09,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 02:10:09,802 INFO L168 Benchmark]: Toolchain (without parser) took 13042.61 ms. Allocated memory was 138.9 MB in the beginning and 372.2 MB in the end (delta: 233.3 MB). Free memory was 97.4 MB in the beginning and 180.7 MB in the end (delta: -83.3 MB). Peak memory consumption was 150.0 MB. Max. memory is 7.1 GB. [2019-10-15 02:10:09,806 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-15 02:10:09,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1221.14 ms. Allocated memory was 138.9 MB in the beginning and 207.6 MB in the end (delta: 68.7 MB). Free memory was 97.2 MB in the beginning and 125.9 MB in the end (delta: -28.7 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. [2019-10-15 02:10:09,809 INFO L168 Benchmark]: Boogie Preprocessor took 109.24 ms. Allocated memory is still 207.6 MB. Free memory was 125.9 MB in the beginning and 122.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-10-15 02:10:09,810 INFO L168 Benchmark]: RCFGBuilder took 1440.79 ms. Allocated memory was 207.6 MB in the beginning and 241.7 MB in the end (delta: 34.1 MB). Free memory was 122.3 MB in the beginning and 145.0 MB in the end (delta: -22.7 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-10-15 02:10:09,813 INFO L168 Benchmark]: TraceAbstraction took 10263.24 ms. Allocated memory was 241.7 MB in the beginning and 372.2 MB in the end (delta: 130.5 MB). Free memory was 143.5 MB in the beginning and 180.7 MB in the end (delta: -37.2 MB). Peak memory consumption was 93.3 MB. Max. memory is 7.1 GB. [2019-10-15 02:10:09,822 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 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1221.14 ms. Allocated memory was 138.9 MB in the beginning and 207.6 MB in the end (delta: 68.7 MB). Free memory was 97.2 MB in the beginning and 125.9 MB in the end (delta: -28.7 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.24 ms. Allocated memory is still 207.6 MB. Free memory was 125.9 MB in the beginning and 122.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1440.79 ms. Allocated memory was 207.6 MB in the beginning and 241.7 MB in the end (delta: 34.1 MB). Free memory was 122.3 MB in the beginning and 145.0 MB in the end (delta: -22.7 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10263.24 ms. Allocated memory was 241.7 MB in the beginning and 372.2 MB in the end (delta: 130.5 MB). Free memory was 143.5 MB in the beginning and 180.7 MB in the end (delta: -37.2 MB). Peak memory consumption was 93.3 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: ldv_module_refcounter == \old(ldv_module_refcounter) || !(1 == \old(ldv_module_refcounter)) - InvariantResult [Line: 4965]: Loop Invariant Derived loop invariant: ldv_module_refcounter == \old(ldv_module_refcounter) || !(1 == \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: ldv_module_refcounter == \old(ldv_module_refcounter) || !(1 == \old(ldv_module_refcounter)) - InvariantResult [Line: 4945]: Loop Invariant Derived loop invariant: ldv_module_refcounter == \old(ldv_module_refcounter) || !(1 == \old(ldv_module_refcounter)) - InvariantResult [Line: 4930]: Loop Invariant Derived loop invariant: ldv_module_refcounter == \old(ldv_module_refcounter) || !(1 == \old(ldv_module_refcounter)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 35 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 10.1s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 517 SDtfs, 789 SDslu, 1928 SDs, 0 SdLazy, 1235 SolverSat, 502 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 210 SyntacticMatches, 7 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 163 PreInvPairs, 207 NumberOfFragments, 518 HoareAnnotationTreeSize, 163 FomulaSimplifications, 1695 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 35 FomulaSimplificationsInter, 2040 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 598 ConstructedInterpolants, 0 QuantifiedInterpolants, 285614 SizeOfPredicates, 11 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 82/96 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...