/usr/bin/java -ea -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 -i ../../../trunk/examples/svcomp/ldv-regression/rule57_ebda_blast.c_1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:05:50,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:05:50,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:05:50,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:05:50,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:05:50,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:05:50,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:05:50,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:05:50,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:05:50,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:05:50,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:05:50,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:05:50,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:05:50,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:05:50,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:05:50,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:05:50,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:05:50,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:05:50,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:05:50,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:05:50,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:05:50,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:05:50,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:05:50,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:05:50,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:05:50,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:05:50,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:05:50,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:05:50,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:05:50,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:05:50,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:05:50,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:05:50,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:05:50,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:05:50,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:05:50,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:05:50,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:05:50,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:05:50,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:05:50,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:05:50,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:05:50,217 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 [2020-07-10 15:05:50,232 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:05:50,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:05:50,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:05:50,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:05:50,234 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:05:50,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:05:50,236 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:05:50,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:05:50,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:05:50,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:05:50,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:05:50,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:05:50,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:05:50,238 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:05:50,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:05:50,238 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:05:50,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:05:50,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:05:50,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:05:50,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:05:50,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:05:50,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:05:50,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:05:50,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:05:50,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:05:50,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:05:50,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:05:50,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:05:50,241 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:05:50,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:05:50,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:05:50,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:05:50,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:05:50,547 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:05:50,548 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:05:50,548 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule57_ebda_blast.c_1.i [2020-07-10 15:05:50,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ee5d6ccf/4e10b9b8072f4d1aa73e7d86b2efb9b3/FLAGd7f301a57 [2020-07-10 15:05:51,092 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:05:51,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule57_ebda_blast.c_1.i [2020-07-10 15:05:51,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ee5d6ccf/4e10b9b8072f4d1aa73e7d86b2efb9b3/FLAGd7f301a57 [2020-07-10 15:05:51,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ee5d6ccf/4e10b9b8072f4d1aa73e7d86b2efb9b3 [2020-07-10 15:05:51,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:05:51,456 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:05:51,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:05:51,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:05:51,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:05:51,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:05:51" (1/1) ... [2020-07-10 15:05:51,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b5fd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51, skipping insertion in model container [2020-07-10 15:05:51,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:05:51" (1/1) ... [2020-07-10 15:05:51,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:05:51,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:05:51,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:05:51,720 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:05:51,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:05:51,860 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:05:51,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51 WrapperNode [2020-07-10 15:05:51,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:05:51,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:05:51,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:05:51,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:05:51,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51" (1/1) ... [2020-07-10 15:05:51,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51" (1/1) ... [2020-07-10 15:05:51,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51" (1/1) ... [2020-07-10 15:05:51,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51" (1/1) ... [2020-07-10 15:05:51,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51" (1/1) ... [2020-07-10 15:05:51,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51" (1/1) ... [2020-07-10 15:05:51,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51" (1/1) ... [2020-07-10 15:05:51,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:05:51,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:05:51,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:05:51,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:05:51,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51" (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 [2020-07-10 15:05:51,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:05:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:05:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-07-10 15:05:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2020-07-10 15:05:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2020-07-10 15:05:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmphp_find_same_bus_num [2020-07-10 15:05:51,987 INFO L138 BoogieDeclarations]: Found implementation of procedure fillslotinfo [2020-07-10 15:05:51,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmphp_init_devno [2020-07-10 15:05:51,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ebda_rsrc_controller [2020-07-10 15:05:51,988 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:05:51,988 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-10 15:05:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:05:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-07-10 15:05:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:05:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2020-07-10 15:05:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:05:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-10 15:05:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2020-07-10 15:05:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure ibmphp_find_same_bus_num [2020-07-10 15:05:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:05:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure fillslotinfo [2020-07-10 15:05:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure ibmphp_init_devno [2020-07-10 15:05:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure ebda_rsrc_controller [2020-07-10 15:05:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:05:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:05:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:05:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:05:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:05:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:05:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:05:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:05:52,624 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:05:52,624 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:05:52,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:05:52 BoogieIcfgContainer [2020-07-10 15:05:52,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:05:52,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:05:52,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:05:52,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:05:52,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:05:51" (1/3) ... [2020-07-10 15:05:52,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5dd58e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:05:52, skipping insertion in model container [2020-07-10 15:05:52,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:51" (2/3) ... [2020-07-10 15:05:52,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5dd58e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:05:52, skipping insertion in model container [2020-07-10 15:05:52,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:05:52" (3/3) ... [2020-07-10 15:05:52,650 INFO L109 eAbstractionObserver]: Analyzing ICFG rule57_ebda_blast.c_1.i [2020-07-10 15:05:52,662 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:05:52,671 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:05:52,688 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:05:52,723 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:05:52,723 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:05:52,723 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:05:52,723 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:05:52,723 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:05:52,724 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:05:52,724 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:05:52,724 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:05:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2020-07-10 15:05:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:05:52,754 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:52,755 INFO L422 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] [2020-07-10 15:05:52,756 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:52,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:52,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1185591928, now seen corresponding path program 1 times [2020-07-10 15:05:52,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:52,775 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640171050] [2020-07-10 15:05:52,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:53,113 INFO L280 TraceCheckUtils]: 0: Hoare triple {87#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {67#true} is VALID [2020-07-10 15:05:53,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:53,114 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #112#return; {67#true} is VALID [2020-07-10 15:05:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:53,401 INFO L280 TraceCheckUtils]: 0: Hoare triple {105#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2020-07-10 15:05:53,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:53,406 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {67#true} {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:53,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {99#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:53,412 INFO L263 TraceCheckUtils]: 1: Hoare triple {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {105#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:53,413 INFO L280 TraceCheckUtils]: 2: Hoare triple {105#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2020-07-10 15:05:53,413 INFO L280 TraceCheckUtils]: 3: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:53,415 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {67#true} {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:53,418 INFO L280 TraceCheckUtils]: 5: Hoare triple {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:53,419 INFO L280 TraceCheckUtils]: 6: Hoare triple {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:53,422 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {67#true} #90#return; {97#(not (= 0 |ebda_rsrc_controller_#t~ret4.base|))} is VALID [2020-07-10 15:05:53,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {88#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} havoc ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset;havoc ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset;havoc ~rc~0; {67#true} is VALID [2020-07-10 15:05:53,426 INFO L263 TraceCheckUtils]: 1: Hoare triple {67#true} call #t~ret4.base, #t~ret4.offset := kzalloc(8, 1); {99#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:53,428 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:53,431 INFO L263 TraceCheckUtils]: 3: Hoare triple {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {105#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:53,431 INFO L280 TraceCheckUtils]: 4: Hoare triple {105#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2020-07-10 15:05:53,432 INFO L280 TraceCheckUtils]: 5: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:53,435 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {67#true} {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:53,437 INFO L280 TraceCheckUtils]: 7: Hoare triple {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:53,438 INFO L280 TraceCheckUtils]: 8: Hoare triple {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:53,440 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {67#true} #90#return; {97#(not (= 0 |ebda_rsrc_controller_#t~ret4.base|))} is VALID [2020-07-10 15:05:53,441 INFO L280 TraceCheckUtils]: 10: Hoare triple {97#(not (= 0 |ebda_rsrc_controller_#t~ret4.base|))} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {98#(not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))} is VALID [2020-07-10 15:05:53,443 INFO L280 TraceCheckUtils]: 11: Hoare triple {98#(not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))} assume ~hp_slot_ptr~0.base == 0 && ~hp_slot_ptr~0.offset == 0;~rc~0 := -2; {68#false} is VALID [2020-07-10 15:05:53,460 INFO L280 TraceCheckUtils]: 12: Hoare triple {68#false} #res := ~rc~0; {68#false} is VALID [2020-07-10 15:05:53,460 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#false} assume true; {68#false} is VALID [2020-07-10 15:05:53,461 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {68#false} {67#true} #104#return; {68#false} is VALID [2020-07-10 15:05:53,474 INFO L263 TraceCheckUtils]: 0: Hoare triple {67#true} call ULTIMATE.init(); {87#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} is VALID [2020-07-10 15:05:53,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {87#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {67#true} is VALID [2020-07-10 15:05:53,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:53,475 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #112#return; {67#true} is VALID [2020-07-10 15:05:53,475 INFO L263 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret11 := main(); {67#true} is VALID [2020-07-10 15:05:53,479 INFO L263 TraceCheckUtils]: 5: Hoare triple {67#true} call #t~ret10 := ebda_rsrc_controller(); {88#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} is VALID [2020-07-10 15:05:53,480 INFO L280 TraceCheckUtils]: 6: Hoare triple {88#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} havoc ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset;havoc ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset;havoc ~rc~0; {67#true} is VALID [2020-07-10 15:05:53,485 INFO L263 TraceCheckUtils]: 7: Hoare triple {67#true} call #t~ret4.base, #t~ret4.offset := kzalloc(8, 1); {99#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:53,487 INFO L280 TraceCheckUtils]: 8: Hoare triple {99#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:53,489 INFO L263 TraceCheckUtils]: 9: Hoare triple {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {105#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:53,489 INFO L280 TraceCheckUtils]: 10: Hoare triple {105#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2020-07-10 15:05:53,489 INFO L280 TraceCheckUtils]: 11: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:53,492 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {67#true} {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:53,494 INFO L280 TraceCheckUtils]: 13: Hoare triple {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:53,496 INFO L280 TraceCheckUtils]: 14: Hoare triple {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:53,498 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {67#true} #90#return; {97#(not (= 0 |ebda_rsrc_controller_#t~ret4.base|))} is VALID [2020-07-10 15:05:53,499 INFO L280 TraceCheckUtils]: 16: Hoare triple {97#(not (= 0 |ebda_rsrc_controller_#t~ret4.base|))} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {98#(not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))} is VALID [2020-07-10 15:05:53,500 INFO L280 TraceCheckUtils]: 17: Hoare triple {98#(not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))} assume ~hp_slot_ptr~0.base == 0 && ~hp_slot_ptr~0.offset == 0;~rc~0 := -2; {68#false} is VALID [2020-07-10 15:05:53,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {68#false} #res := ~rc~0; {68#false} is VALID [2020-07-10 15:05:53,501 INFO L280 TraceCheckUtils]: 19: Hoare triple {68#false} assume true; {68#false} is VALID [2020-07-10 15:05:53,501 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {68#false} {67#true} #104#return; {68#false} is VALID [2020-07-10 15:05:53,502 INFO L280 TraceCheckUtils]: 21: Hoare triple {68#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;havoc #t~ret10; {68#false} is VALID [2020-07-10 15:05:53,502 INFO L280 TraceCheckUtils]: 22: Hoare triple {68#false} assume 0 == ~used_tmp_slot~0; {68#false} is VALID [2020-07-10 15:05:53,503 INFO L280 TraceCheckUtils]: 23: Hoare triple {68#false} assume !(0 != ~freed_tmp_slot~0); {68#false} is VALID [2020-07-10 15:05:53,503 INFO L263 TraceCheckUtils]: 24: Hoare triple {68#false} call __blast_assert(); {68#false} is VALID [2020-07-10 15:05:53,504 INFO L280 TraceCheckUtils]: 25: Hoare triple {68#false} assume !false; {68#false} is VALID [2020-07-10 15:05:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:05:53,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640171050] [2020-07-10 15:05:53,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:53,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 15:05:53,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458702216] [2020-07-10 15:05:53,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 15:05:53,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:53,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:05:53,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:53,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:05:53,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:53,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:05:53,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:05:53,589 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 10 states. [2020-07-10 15:05:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:55,020 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2020-07-10 15:05:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:05:55,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 15:05:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:05:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2020-07-10 15:05:55,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:05:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2020-07-10 15:05:55,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2020-07-10 15:05:55,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:55,228 INFO L225 Difference]: With dead ends: 79 [2020-07-10 15:05:55,228 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 15:05:55,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:05:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 15:05:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2020-07-10 15:05:55,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:55,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2020-07-10 15:05:55,379 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2020-07-10 15:05:55,380 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2020-07-10 15:05:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:55,389 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-07-10 15:05:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2020-07-10 15:05:55,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:55,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:55,391 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2020-07-10 15:05:55,391 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2020-07-10 15:05:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:55,399 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-07-10 15:05:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2020-07-10 15:05:55,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:55,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:55,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:55,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 15:05:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2020-07-10 15:05:55,409 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 26 [2020-07-10 15:05:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:55,409 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2020-07-10 15:05:55,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:05:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2020-07-10 15:05:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:05:55,411 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:55,411 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-10 15:05:55,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:05:55,412 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:55,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1676370897, now seen corresponding path program 1 times [2020-07-10 15:05:55,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:55,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789658055] [2020-07-10 15:05:55,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,544 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {421#true} is VALID [2020-07-10 15:05:55,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,545 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {421#true} {421#true} #112#return; {421#true} is VALID [2020-07-10 15:05:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {476#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {421#true} is VALID [2020-07-10 15:05:55,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,672 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {421#true} {421#true} #110#return; {421#true} is VALID [2020-07-10 15:05:55,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {472#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {421#true} is VALID [2020-07-10 15:05:55,674 INFO L263 TraceCheckUtils]: 1: Hoare triple {421#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {476#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:55,675 INFO L280 TraceCheckUtils]: 2: Hoare triple {476#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {421#true} is VALID [2020-07-10 15:05:55,675 INFO L280 TraceCheckUtils]: 3: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,675 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {421#true} {421#true} #110#return; {421#true} is VALID [2020-07-10 15:05:55,676 INFO L280 TraceCheckUtils]: 5: Hoare triple {421#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {421#true} is VALID [2020-07-10 15:05:55,676 INFO L280 TraceCheckUtils]: 6: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,676 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {421#true} {421#true} #90#return; {421#true} is VALID [2020-07-10 15:05:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {476#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {421#true} is VALID [2020-07-10 15:05:55,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,755 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {421#true} {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {472#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,758 INFO L263 TraceCheckUtils]: 1: Hoare triple {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {476#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:55,758 INFO L280 TraceCheckUtils]: 2: Hoare triple {476#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {421#true} is VALID [2020-07-10 15:05:55,758 INFO L280 TraceCheckUtils]: 3: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,763 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {421#true} {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,764 INFO L280 TraceCheckUtils]: 5: Hoare triple {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:55,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:55,767 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {421#true} #92#return; {470#(not (= 0 |ebda_rsrc_controller_#t~ret5.base|))} is VALID [2020-07-10 15:05:55,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {453#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} havoc ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset;havoc ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset;havoc ~rc~0; {421#true} is VALID [2020-07-10 15:05:55,768 INFO L263 TraceCheckUtils]: 1: Hoare triple {421#true} call #t~ret4.base, #t~ret4.offset := kzalloc(8, 1); {472#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:55,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {421#true} is VALID [2020-07-10 15:05:55,771 INFO L263 TraceCheckUtils]: 3: Hoare triple {421#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {476#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:55,771 INFO L280 TraceCheckUtils]: 4: Hoare triple {476#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {421#true} is VALID [2020-07-10 15:05:55,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,772 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {421#true} {421#true} #110#return; {421#true} is VALID [2020-07-10 15:05:55,773 INFO L280 TraceCheckUtils]: 7: Hoare triple {421#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {421#true} is VALID [2020-07-10 15:05:55,773 INFO L280 TraceCheckUtils]: 8: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,773 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {421#true} {421#true} #90#return; {421#true} is VALID [2020-07-10 15:05:55,774 INFO L280 TraceCheckUtils]: 10: Hoare triple {421#true} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {421#true} is VALID [2020-07-10 15:05:55,774 INFO L280 TraceCheckUtils]: 11: Hoare triple {421#true} assume !(~hp_slot_ptr~0.base == 0 && ~hp_slot_ptr~0.offset == 0);call write~int(5, ~hp_slot_ptr~0.base, 4 + ~hp_slot_ptr~0.offset, 4); {421#true} is VALID [2020-07-10 15:05:55,776 INFO L263 TraceCheckUtils]: 12: Hoare triple {421#true} call #t~ret5.base, #t~ret5.offset := kzalloc(16, 1); {472#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:55,778 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,781 INFO L263 TraceCheckUtils]: 14: Hoare triple {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {476#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:55,782 INFO L280 TraceCheckUtils]: 15: Hoare triple {476#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {421#true} is VALID [2020-07-10 15:05:55,782 INFO L280 TraceCheckUtils]: 16: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,783 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {421#true} {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,784 INFO L280 TraceCheckUtils]: 18: Hoare triple {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:55,785 INFO L280 TraceCheckUtils]: 19: Hoare triple {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:55,787 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {421#true} #92#return; {470#(not (= 0 |ebda_rsrc_controller_#t~ret5.base|))} is VALID [2020-07-10 15:05:55,792 INFO L280 TraceCheckUtils]: 21: Hoare triple {470#(not (= 0 |ebda_rsrc_controller_#t~ret5.base|))} ~tmp_slot~0.base, ~tmp_slot~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {471#(not (= 0 ~tmp_slot~0.base))} is VALID [2020-07-10 15:05:55,793 INFO L280 TraceCheckUtils]: 22: Hoare triple {471#(not (= 0 ~tmp_slot~0.base))} assume ~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0;~rc~0 := -2; {422#false} is VALID [2020-07-10 15:05:55,793 INFO L280 TraceCheckUtils]: 23: Hoare triple {422#false} #res := ~rc~0; {422#false} is VALID [2020-07-10 15:05:55,793 INFO L280 TraceCheckUtils]: 24: Hoare triple {422#false} assume true; {422#false} is VALID [2020-07-10 15:05:55,794 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {422#false} {421#true} #104#return; {422#false} is VALID [2020-07-10 15:05:55,798 INFO L263 TraceCheckUtils]: 0: Hoare triple {421#true} call ULTIMATE.init(); {452#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} is VALID [2020-07-10 15:05:55,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {452#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {421#true} is VALID [2020-07-10 15:05:55,799 INFO L280 TraceCheckUtils]: 2: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,799 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {421#true} {421#true} #112#return; {421#true} is VALID [2020-07-10 15:05:55,800 INFO L263 TraceCheckUtils]: 4: Hoare triple {421#true} call #t~ret11 := main(); {421#true} is VALID [2020-07-10 15:05:55,802 INFO L263 TraceCheckUtils]: 5: Hoare triple {421#true} call #t~ret10 := ebda_rsrc_controller(); {453#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} is VALID [2020-07-10 15:05:55,803 INFO L280 TraceCheckUtils]: 6: Hoare triple {453#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} havoc ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset;havoc ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset;havoc ~rc~0; {421#true} is VALID [2020-07-10 15:05:55,805 INFO L263 TraceCheckUtils]: 7: Hoare triple {421#true} call #t~ret4.base, #t~ret4.offset := kzalloc(8, 1); {472#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:55,805 INFO L280 TraceCheckUtils]: 8: Hoare triple {472#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {421#true} is VALID [2020-07-10 15:05:55,806 INFO L263 TraceCheckUtils]: 9: Hoare triple {421#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {476#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:55,807 INFO L280 TraceCheckUtils]: 10: Hoare triple {476#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {421#true} is VALID [2020-07-10 15:05:55,807 INFO L280 TraceCheckUtils]: 11: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,808 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {421#true} {421#true} #110#return; {421#true} is VALID [2020-07-10 15:05:55,808 INFO L280 TraceCheckUtils]: 13: Hoare triple {421#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {421#true} is VALID [2020-07-10 15:05:55,809 INFO L280 TraceCheckUtils]: 14: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,809 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {421#true} {421#true} #90#return; {421#true} is VALID [2020-07-10 15:05:55,809 INFO L280 TraceCheckUtils]: 16: Hoare triple {421#true} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {421#true} is VALID [2020-07-10 15:05:55,809 INFO L280 TraceCheckUtils]: 17: Hoare triple {421#true} assume !(~hp_slot_ptr~0.base == 0 && ~hp_slot_ptr~0.offset == 0);call write~int(5, ~hp_slot_ptr~0.base, 4 + ~hp_slot_ptr~0.offset, 4); {421#true} is VALID [2020-07-10 15:05:55,822 INFO L263 TraceCheckUtils]: 18: Hoare triple {421#true} call #t~ret5.base, #t~ret5.offset := kzalloc(16, 1); {472#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:55,826 INFO L280 TraceCheckUtils]: 19: Hoare triple {472#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,829 INFO L263 TraceCheckUtils]: 20: Hoare triple {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {476#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:55,830 INFO L280 TraceCheckUtils]: 21: Hoare triple {476#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {421#true} is VALID [2020-07-10 15:05:55,830 INFO L280 TraceCheckUtils]: 22: Hoare triple {421#true} assume true; {421#true} is VALID [2020-07-10 15:05:55,838 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {421#true} {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,839 INFO L280 TraceCheckUtils]: 24: Hoare triple {477#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:55,841 INFO L280 TraceCheckUtils]: 25: Hoare triple {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:55,842 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {481#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {421#true} #92#return; {470#(not (= 0 |ebda_rsrc_controller_#t~ret5.base|))} is VALID [2020-07-10 15:05:55,843 INFO L280 TraceCheckUtils]: 27: Hoare triple {470#(not (= 0 |ebda_rsrc_controller_#t~ret5.base|))} ~tmp_slot~0.base, ~tmp_slot~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {471#(not (= 0 ~tmp_slot~0.base))} is VALID [2020-07-10 15:05:55,844 INFO L280 TraceCheckUtils]: 28: Hoare triple {471#(not (= 0 ~tmp_slot~0.base))} assume ~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0;~rc~0 := -2; {422#false} is VALID [2020-07-10 15:05:55,844 INFO L280 TraceCheckUtils]: 29: Hoare triple {422#false} #res := ~rc~0; {422#false} is VALID [2020-07-10 15:05:55,844 INFO L280 TraceCheckUtils]: 30: Hoare triple {422#false} assume true; {422#false} is VALID [2020-07-10 15:05:55,844 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {422#false} {421#true} #104#return; {422#false} is VALID [2020-07-10 15:05:55,845 INFO L280 TraceCheckUtils]: 32: Hoare triple {422#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;havoc #t~ret10; {422#false} is VALID [2020-07-10 15:05:55,845 INFO L280 TraceCheckUtils]: 33: Hoare triple {422#false} assume 0 == ~used_tmp_slot~0; {422#false} is VALID [2020-07-10 15:05:55,845 INFO L280 TraceCheckUtils]: 34: Hoare triple {422#false} assume !(0 != ~freed_tmp_slot~0); {422#false} is VALID [2020-07-10 15:05:55,845 INFO L263 TraceCheckUtils]: 35: Hoare triple {422#false} call __blast_assert(); {422#false} is VALID [2020-07-10 15:05:55,845 INFO L280 TraceCheckUtils]: 36: Hoare triple {422#false} assume !false; {422#false} is VALID [2020-07-10 15:05:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:05:55,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789658055] [2020-07-10 15:05:55,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:55,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 15:05:55,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744623435] [2020-07-10 15:05:55,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-10 15:05:55,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:55,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:05:55,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:55,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:05:55,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:55,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:05:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:05:55,894 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 10 states. [2020-07-10 15:05:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:57,572 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2020-07-10 15:05:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:05:57,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-10 15:05:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:05:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2020-07-10 15:05:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:05:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2020-07-10 15:05:57,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 83 transitions. [2020-07-10 15:05:57,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:57,746 INFO L225 Difference]: With dead ends: 77 [2020-07-10 15:05:57,747 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 15:05:57,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:05:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 15:05:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-07-10 15:05:57,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:57,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2020-07-10 15:05:57,840 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2020-07-10 15:05:57,840 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2020-07-10 15:05:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:57,847 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-10 15:05:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-07-10 15:05:57,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:57,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:57,848 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2020-07-10 15:05:57,849 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2020-07-10 15:05:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:57,854 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-10 15:05:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-07-10 15:05:57,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:57,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:57,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:57,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 15:05:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-07-10 15:05:57,861 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 37 [2020-07-10 15:05:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:57,861 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-07-10 15:05:57,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:05:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-07-10 15:05:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-10 15:05:57,864 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:57,864 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:57,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:05:57,864 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:57,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1781879045, now seen corresponding path program 1 times [2020-07-10 15:05:57,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:57,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039088297] [2020-07-10 15:05:57,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:57,957 INFO L280 TraceCheckUtils]: 0: Hoare triple {895#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {837#true} is VALID [2020-07-10 15:05:57,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:57,958 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {837#true} {837#true} #112#return; {837#true} is VALID [2020-07-10 15:05:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,056 INFO L280 TraceCheckUtils]: 0: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,057 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,057 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,057 INFO L280 TraceCheckUtils]: 0: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {837#true} is VALID [2020-07-10 15:05:58,059 INFO L263 TraceCheckUtils]: 1: Hoare triple {837#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {935#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,059 INFO L280 TraceCheckUtils]: 2: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,059 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,060 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,060 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {837#true} is VALID [2020-07-10 15:05:58,060 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,060 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {837#true} {837#true} #90#return; {837#true} is VALID [2020-07-10 15:05:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,070 INFO L280 TraceCheckUtils]: 0: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,071 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {837#true} is VALID [2020-07-10 15:05:58,073 INFO L263 TraceCheckUtils]: 1: Hoare triple {837#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {935#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,073 INFO L280 TraceCheckUtils]: 2: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,073 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,074 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,074 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {837#true} is VALID [2020-07-10 15:05:58,074 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,074 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {837#true} {837#true} #92#return; {837#true} is VALID [2020-07-10 15:05:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,094 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {837#true} is VALID [2020-07-10 15:05:58,096 INFO L263 TraceCheckUtils]: 1: Hoare triple {837#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {935#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,097 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,097 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,098 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {837#true} is VALID [2020-07-10 15:05:58,098 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,098 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {837#true} {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} #108#return; {837#true} is VALID [2020-07-10 15:05:58,100 INFO L263 TraceCheckUtils]: 0: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~ret1.base, #t~ret1.offset := kzalloc(0, 0); {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {837#true} is VALID [2020-07-10 15:05:58,102 INFO L263 TraceCheckUtils]: 2: Hoare triple {837#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {935#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,102 INFO L280 TraceCheckUtils]: 3: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,102 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,103 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,103 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {837#true} is VALID [2020-07-10 15:05:58,103 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,103 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {837#true} {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} #108#return; {837#true} is VALID [2020-07-10 15:05:58,104 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#true} #res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {837#true} is VALID [2020-07-10 15:05:58,104 INFO L280 TraceCheckUtils]: 10: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,104 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {837#true} {837#true} #94#return; {837#true} is VALID [2020-07-10 15:05:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,111 INFO L280 TraceCheckUtils]: 0: Hoare triple {837#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;#res := #t~nondet2;havoc #t~nondet2; {837#true} is VALID [2020-07-10 15:05:58,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,113 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {837#true} {894#(= ~used_tmp_slot~0 1)} #98#return; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {837#true} ~pp.base, ~pp.offset := #in~pp.base, #in~pp.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;#res := #t~nondet3;havoc #t~nondet3; {837#true} is VALID [2020-07-10 15:05:58,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,120 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {837#true} {894#(= ~used_tmp_slot~0 1)} #100#return; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {896#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} havoc ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset;havoc ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset;havoc ~rc~0; {837#true} is VALID [2020-07-10 15:05:58,121 INFO L263 TraceCheckUtils]: 1: Hoare triple {837#true} call #t~ret4.base, #t~ret4.offset := kzalloc(8, 1); {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {837#true} is VALID [2020-07-10 15:05:58,122 INFO L263 TraceCheckUtils]: 3: Hoare triple {837#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {935#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,123 INFO L280 TraceCheckUtils]: 4: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,123 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,123 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,124 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {837#true} is VALID [2020-07-10 15:05:58,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,124 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {837#true} {837#true} #90#return; {837#true} is VALID [2020-07-10 15:05:58,124 INFO L280 TraceCheckUtils]: 10: Hoare triple {837#true} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {837#true} is VALID [2020-07-10 15:05:58,125 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} assume !(~hp_slot_ptr~0.base == 0 && ~hp_slot_ptr~0.offset == 0);call write~int(5, ~hp_slot_ptr~0.base, 4 + ~hp_slot_ptr~0.offset, 4); {837#true} is VALID [2020-07-10 15:05:58,126 INFO L263 TraceCheckUtils]: 12: Hoare triple {837#true} call #t~ret5.base, #t~ret5.offset := kzalloc(16, 1); {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,126 INFO L280 TraceCheckUtils]: 13: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {837#true} is VALID [2020-07-10 15:05:58,127 INFO L263 TraceCheckUtils]: 14: Hoare triple {837#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {935#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,128 INFO L280 TraceCheckUtils]: 15: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,128 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,128 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,128 INFO L280 TraceCheckUtils]: 18: Hoare triple {837#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {837#true} is VALID [2020-07-10 15:05:58,129 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,129 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {837#true} {837#true} #92#return; {837#true} is VALID [2020-07-10 15:05:58,129 INFO L280 TraceCheckUtils]: 21: Hoare triple {837#true} ~tmp_slot~0.base, ~tmp_slot~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {837#true} is VALID [2020-07-10 15:05:58,130 INFO L280 TraceCheckUtils]: 22: Hoare triple {837#true} assume !(~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0);~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 0;call write~int(2, ~tmp_slot~0.base, ~tmp_slot~0.offset, 4);call write~int(3, ~tmp_slot~0.base, 4 + ~tmp_slot~0.offset, 4); {837#true} is VALID [2020-07-10 15:05:58,131 INFO L263 TraceCheckUtils]: 23: Hoare triple {837#true} call #t~ret6.base, #t~ret6.offset := ibmphp_find_same_bus_num(); {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,132 INFO L263 TraceCheckUtils]: 24: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~ret1.base, #t~ret1.offset := kzalloc(0, 0); {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,132 INFO L280 TraceCheckUtils]: 25: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {837#true} is VALID [2020-07-10 15:05:58,133 INFO L263 TraceCheckUtils]: 26: Hoare triple {837#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {935#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,134 INFO L280 TraceCheckUtils]: 27: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,134 INFO L280 TraceCheckUtils]: 28: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,134 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,134 INFO L280 TraceCheckUtils]: 30: Hoare triple {837#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {837#true} is VALID [2020-07-10 15:05:58,135 INFO L280 TraceCheckUtils]: 31: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,135 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {837#true} {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} #108#return; {837#true} is VALID [2020-07-10 15:05:58,135 INFO L280 TraceCheckUtils]: 33: Hoare triple {837#true} #res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {837#true} is VALID [2020-07-10 15:05:58,135 INFO L280 TraceCheckUtils]: 34: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,136 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {837#true} {837#true} #94#return; {837#true} is VALID [2020-07-10 15:05:58,136 INFO L280 TraceCheckUtils]: 36: Hoare triple {837#true} ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {837#true} is VALID [2020-07-10 15:05:58,137 INFO L280 TraceCheckUtils]: 37: Hoare triple {837#true} assume !(~bus_info_ptr1~0.base == 0 && ~bus_info_ptr1~0.offset == 0);call write~$Pointer$(~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset, ~tmp_slot~0.base, 12 + ~tmp_slot~0.offset, 4);~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset := 0, 0;call write~$Pointer$(~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset, ~tmp_slot~0.base, 8 + ~tmp_slot~0.offset, 4);call write~$Pointer$(~tmp_slot~0.base, ~tmp_slot~0.offset, ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset, 4);~used_tmp_slot~0 := 1; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,137 INFO L263 TraceCheckUtils]: 38: Hoare triple {894#(= ~used_tmp_slot~0 1)} call #t~ret7 := fillslotinfo(~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset); {837#true} is VALID [2020-07-10 15:05:58,137 INFO L280 TraceCheckUtils]: 39: Hoare triple {837#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;#res := #t~nondet2;havoc #t~nondet2; {837#true} is VALID [2020-07-10 15:05:58,137 INFO L280 TraceCheckUtils]: 40: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,139 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {837#true} {894#(= ~used_tmp_slot~0 1)} #98#return; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,139 INFO L280 TraceCheckUtils]: 42: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~rc~0 := #t~ret7;havoc #t~ret7; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,140 INFO L280 TraceCheckUtils]: 43: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume !(0 != ~rc~0); {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,140 INFO L263 TraceCheckUtils]: 44: Hoare triple {894#(= ~used_tmp_slot~0 1)} call #t~ret8 := ibmphp_init_devno(~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset); {837#true} is VALID [2020-07-10 15:05:58,140 INFO L280 TraceCheckUtils]: 45: Hoare triple {837#true} ~pp.base, ~pp.offset := #in~pp.base, #in~pp.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;#res := #t~nondet3;havoc #t~nondet3; {837#true} is VALID [2020-07-10 15:05:58,140 INFO L280 TraceCheckUtils]: 46: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,141 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {837#true} {894#(= ~used_tmp_slot~0 1)} #100#return; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,142 INFO L280 TraceCheckUtils]: 48: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~rc~0 := #t~ret8;havoc #t~ret8; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,143 INFO L280 TraceCheckUtils]: 49: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume !(0 != ~rc~0);#res := 0; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,144 INFO L280 TraceCheckUtils]: 50: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume true; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,145 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {894#(= ~used_tmp_slot~0 1)} {837#true} #104#return; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,149 INFO L263 TraceCheckUtils]: 0: Hoare triple {837#true} call ULTIMATE.init(); {895#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} is VALID [2020-07-10 15:05:58,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {895#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {837#true} is VALID [2020-07-10 15:05:58,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,150 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {837#true} {837#true} #112#return; {837#true} is VALID [2020-07-10 15:05:58,150 INFO L263 TraceCheckUtils]: 4: Hoare triple {837#true} call #t~ret11 := main(); {837#true} is VALID [2020-07-10 15:05:58,153 INFO L263 TraceCheckUtils]: 5: Hoare triple {837#true} call #t~ret10 := ebda_rsrc_controller(); {896#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} is VALID [2020-07-10 15:05:58,153 INFO L280 TraceCheckUtils]: 6: Hoare triple {896#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} havoc ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset;havoc ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset;havoc ~rc~0; {837#true} is VALID [2020-07-10 15:05:58,159 INFO L263 TraceCheckUtils]: 7: Hoare triple {837#true} call #t~ret4.base, #t~ret4.offset := kzalloc(8, 1); {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,160 INFO L280 TraceCheckUtils]: 8: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {837#true} is VALID [2020-07-10 15:05:58,162 INFO L263 TraceCheckUtils]: 9: Hoare triple {837#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {935#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,163 INFO L280 TraceCheckUtils]: 10: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,163 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,164 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,165 INFO L280 TraceCheckUtils]: 13: Hoare triple {837#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {837#true} is VALID [2020-07-10 15:05:58,165 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,165 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {837#true} {837#true} #90#return; {837#true} is VALID [2020-07-10 15:05:58,165 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {837#true} is VALID [2020-07-10 15:05:58,165 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} assume !(~hp_slot_ptr~0.base == 0 && ~hp_slot_ptr~0.offset == 0);call write~int(5, ~hp_slot_ptr~0.base, 4 + ~hp_slot_ptr~0.offset, 4); {837#true} is VALID [2020-07-10 15:05:58,166 INFO L263 TraceCheckUtils]: 18: Hoare triple {837#true} call #t~ret5.base, #t~ret5.offset := kzalloc(16, 1); {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,167 INFO L280 TraceCheckUtils]: 19: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {837#true} is VALID [2020-07-10 15:05:58,168 INFO L263 TraceCheckUtils]: 20: Hoare triple {837#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {935#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,168 INFO L280 TraceCheckUtils]: 21: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,168 INFO L280 TraceCheckUtils]: 22: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,168 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,168 INFO L280 TraceCheckUtils]: 24: Hoare triple {837#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {837#true} is VALID [2020-07-10 15:05:58,169 INFO L280 TraceCheckUtils]: 25: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,169 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {837#true} {837#true} #92#return; {837#true} is VALID [2020-07-10 15:05:58,169 INFO L280 TraceCheckUtils]: 27: Hoare triple {837#true} ~tmp_slot~0.base, ~tmp_slot~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {837#true} is VALID [2020-07-10 15:05:58,169 INFO L280 TraceCheckUtils]: 28: Hoare triple {837#true} assume !(~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0);~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 0;call write~int(2, ~tmp_slot~0.base, ~tmp_slot~0.offset, 4);call write~int(3, ~tmp_slot~0.base, 4 + ~tmp_slot~0.offset, 4); {837#true} is VALID [2020-07-10 15:05:58,176 INFO L263 TraceCheckUtils]: 29: Hoare triple {837#true} call #t~ret6.base, #t~ret6.offset := ibmphp_find_same_bus_num(); {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,177 INFO L263 TraceCheckUtils]: 30: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~ret1.base, #t~ret1.offset := kzalloc(0, 0); {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,177 INFO L280 TraceCheckUtils]: 31: Hoare triple {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {837#true} is VALID [2020-07-10 15:05:58,179 INFO L263 TraceCheckUtils]: 32: Hoare triple {837#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {935#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,179 INFO L280 TraceCheckUtils]: 33: Hoare triple {935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {837#true} is VALID [2020-07-10 15:05:58,179 INFO L280 TraceCheckUtils]: 34: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,179 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {837#true} {837#true} #110#return; {837#true} is VALID [2020-07-10 15:05:58,180 INFO L280 TraceCheckUtils]: 36: Hoare triple {837#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {837#true} is VALID [2020-07-10 15:05:58,180 INFO L280 TraceCheckUtils]: 37: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,180 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {837#true} {931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} #108#return; {837#true} is VALID [2020-07-10 15:05:58,180 INFO L280 TraceCheckUtils]: 39: Hoare triple {837#true} #res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {837#true} is VALID [2020-07-10 15:05:58,180 INFO L280 TraceCheckUtils]: 40: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,192 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {837#true} {837#true} #94#return; {837#true} is VALID [2020-07-10 15:05:58,192 INFO L280 TraceCheckUtils]: 42: Hoare triple {837#true} ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {837#true} is VALID [2020-07-10 15:05:58,195 INFO L280 TraceCheckUtils]: 43: Hoare triple {837#true} assume !(~bus_info_ptr1~0.base == 0 && ~bus_info_ptr1~0.offset == 0);call write~$Pointer$(~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset, ~tmp_slot~0.base, 12 + ~tmp_slot~0.offset, 4);~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset := 0, 0;call write~$Pointer$(~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset, ~tmp_slot~0.base, 8 + ~tmp_slot~0.offset, 4);call write~$Pointer$(~tmp_slot~0.base, ~tmp_slot~0.offset, ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset, 4);~used_tmp_slot~0 := 1; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,195 INFO L263 TraceCheckUtils]: 44: Hoare triple {894#(= ~used_tmp_slot~0 1)} call #t~ret7 := fillslotinfo(~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset); {837#true} is VALID [2020-07-10 15:05:58,195 INFO L280 TraceCheckUtils]: 45: Hoare triple {837#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;#res := #t~nondet2;havoc #t~nondet2; {837#true} is VALID [2020-07-10 15:05:58,196 INFO L280 TraceCheckUtils]: 46: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,197 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {837#true} {894#(= ~used_tmp_slot~0 1)} #98#return; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,197 INFO L280 TraceCheckUtils]: 48: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~rc~0 := #t~ret7;havoc #t~ret7; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,198 INFO L280 TraceCheckUtils]: 49: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume !(0 != ~rc~0); {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,198 INFO L263 TraceCheckUtils]: 50: Hoare triple {894#(= ~used_tmp_slot~0 1)} call #t~ret8 := ibmphp_init_devno(~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset); {837#true} is VALID [2020-07-10 15:05:58,198 INFO L280 TraceCheckUtils]: 51: Hoare triple {837#true} ~pp.base, ~pp.offset := #in~pp.base, #in~pp.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;#res := #t~nondet3;havoc #t~nondet3; {837#true} is VALID [2020-07-10 15:05:58,198 INFO L280 TraceCheckUtils]: 52: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 15:05:58,199 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {837#true} {894#(= ~used_tmp_slot~0 1)} #100#return; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,200 INFO L280 TraceCheckUtils]: 54: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~rc~0 := #t~ret8;havoc #t~ret8; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,201 INFO L280 TraceCheckUtils]: 55: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume !(0 != ~rc~0);#res := 0; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,201 INFO L280 TraceCheckUtils]: 56: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume true; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,202 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {894#(= ~used_tmp_slot~0 1)} {837#true} #104#return; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,202 INFO L280 TraceCheckUtils]: 58: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;havoc #t~ret10; {894#(= ~used_tmp_slot~0 1)} is VALID [2020-07-10 15:05:58,204 INFO L280 TraceCheckUtils]: 59: Hoare triple {894#(= ~used_tmp_slot~0 1)} assume 0 == ~used_tmp_slot~0; {838#false} is VALID [2020-07-10 15:05:58,204 INFO L280 TraceCheckUtils]: 60: Hoare triple {838#false} assume !(0 != ~freed_tmp_slot~0); {838#false} is VALID [2020-07-10 15:05:58,204 INFO L263 TraceCheckUtils]: 61: Hoare triple {838#false} call __blast_assert(); {838#false} is VALID [2020-07-10 15:05:58,204 INFO L280 TraceCheckUtils]: 62: Hoare triple {838#false} assume !false; {838#false} is VALID [2020-07-10 15:05:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-10 15:05:58,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039088297] [2020-07-10 15:05:58,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:58,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:05:58,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919407388] [2020-07-10 15:05:58,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-07-10 15:05:58,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:58,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:05:58,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:58,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:05:58,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:05:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:05:58,276 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 7 states. [2020-07-10 15:05:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:59,330 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2020-07-10 15:05:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:05:59,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-07-10 15:05:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:05:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2020-07-10 15:05:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:05:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2020-07-10 15:05:59,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 85 transitions. [2020-07-10 15:05:59,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:59,476 INFO L225 Difference]: With dead ends: 86 [2020-07-10 15:05:59,476 INFO L226 Difference]: Without dead ends: 56 [2020-07-10 15:05:59,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:05:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-10 15:05:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2020-07-10 15:05:59,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:59,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 54 states. [2020-07-10 15:05:59,542 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 54 states. [2020-07-10 15:05:59,542 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 54 states. [2020-07-10 15:05:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:59,547 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-10 15:05:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-10 15:05:59,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:59,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:59,548 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 56 states. [2020-07-10 15:05:59,548 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 56 states. [2020-07-10 15:05:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:59,552 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-10 15:05:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-10 15:05:59,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:59,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:59,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:59,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 15:05:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2020-07-10 15:05:59,557 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 63 [2020-07-10 15:05:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:59,557 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-07-10 15:05:59,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:05:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-10 15:05:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-10 15:05:59,559 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:59,560 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:59,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:05:59,560 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1679478666, now seen corresponding path program 1 times [2020-07-10 15:05:59,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:59,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398413474] [2020-07-10 15:05:59,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {1325#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {1266#true} is VALID [2020-07-10 15:05:59,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,623 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1266#true} {1266#true} #112#return; {1266#true} is VALID [2020-07-10 15:05:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,733 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1266#true} {1266#true} #110#return; {1266#true} is VALID [2020-07-10 15:05:59,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {1266#true} is VALID [2020-07-10 15:05:59,735 INFO L263 TraceCheckUtils]: 1: Hoare triple {1266#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {1369#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:59,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,735 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1266#true} {1266#true} #110#return; {1266#true} is VALID [2020-07-10 15:05:59,736 INFO L280 TraceCheckUtils]: 5: Hoare triple {1266#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {1266#true} is VALID [2020-07-10 15:05:59,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,736 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1266#true} {1266#true} #90#return; {1266#true} is VALID [2020-07-10 15:05:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,745 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1266#true} {1266#true} #110#return; {1266#true} is VALID [2020-07-10 15:05:59,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {1266#true} is VALID [2020-07-10 15:05:59,747 INFO L263 TraceCheckUtils]: 1: Hoare triple {1266#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {1369#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:59,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,747 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,748 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1266#true} {1266#true} #110#return; {1266#true} is VALID [2020-07-10 15:05:59,748 INFO L280 TraceCheckUtils]: 5: Hoare triple {1266#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {1266#true} is VALID [2020-07-10 15:05:59,748 INFO L280 TraceCheckUtils]: 6: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,748 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1266#true} {1266#true} #92#return; {1266#true} is VALID [2020-07-10 15:05:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,864 INFO L280 TraceCheckUtils]: 0: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,864 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,866 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1266#true} {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:59,867 INFO L280 TraceCheckUtils]: 0: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:59,869 INFO L263 TraceCheckUtils]: 1: Hoare triple {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {1369#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:59,870 INFO L280 TraceCheckUtils]: 2: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,870 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,871 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1266#true} {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:59,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:59,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:59,875 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} #108#return; {1381#(or (<= 1 |ibmphp_find_same_bus_num_#t~ret1.base|) (<= (+ |ibmphp_find_same_bus_num_#t~ret1.base| 1) 0))} is VALID [2020-07-10 15:05:59,877 INFO L263 TraceCheckUtils]: 0: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~ret1.base, #t~ret1.offset := kzalloc(0, 0); {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:59,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:59,880 INFO L263 TraceCheckUtils]: 2: Hoare triple {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {1369#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:59,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,881 INFO L280 TraceCheckUtils]: 4: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,882 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1266#true} {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:59,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:59,884 INFO L280 TraceCheckUtils]: 7: Hoare triple {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:59,886 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} #108#return; {1381#(or (<= 1 |ibmphp_find_same_bus_num_#t~ret1.base|) (<= (+ |ibmphp_find_same_bus_num_#t~ret1.base| 1) 0))} is VALID [2020-07-10 15:05:59,886 INFO L280 TraceCheckUtils]: 9: Hoare triple {1381#(or (<= 1 |ibmphp_find_same_bus_num_#t~ret1.base|) (<= (+ |ibmphp_find_same_bus_num_#t~ret1.base| 1) 0))} #res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} is VALID [2020-07-10 15:05:59,887 INFO L280 TraceCheckUtils]: 10: Hoare triple {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} assume true; {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} is VALID [2020-07-10 15:05:59,888 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} {1266#true} #94#return; {1355#(not (= 0 |ebda_rsrc_controller_#t~ret6.base|))} is VALID [2020-07-10 15:05:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,909 INFO L280 TraceCheckUtils]: 0: Hoare triple {1388#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1266#true} is VALID [2020-07-10 15:05:59,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} assume (~p.base != 0 || ~p.offset != 0) && ~p.base == ~tmp_slot~0.base && ~p.offset == ~tmp_slot~0.offset;~freed_tmp_slot~0 := 1; {1266#true} is VALID [2020-07-10 15:05:59,910 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,910 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1267#false} #96#return; {1267#false} is VALID [2020-07-10 15:05:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:59,914 INFO L280 TraceCheckUtils]: 0: Hoare triple {1388#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1266#true} is VALID [2020-07-10 15:05:59,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} assume (~p.base != 0 || ~p.offset != 0) && ~p.base == ~tmp_slot~0.base && ~p.offset == ~tmp_slot~0.offset;~freed_tmp_slot~0 := 1; {1266#true} is VALID [2020-07-10 15:05:59,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,915 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1267#false} #102#return; {1267#false} is VALID [2020-07-10 15:05:59,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {1326#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} havoc ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset;havoc ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset;havoc ~rc~0; {1266#true} is VALID [2020-07-10 15:05:59,916 INFO L263 TraceCheckUtils]: 1: Hoare triple {1266#true} call #t~ret4.base, #t~ret4.offset := kzalloc(8, 1); {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:59,917 INFO L280 TraceCheckUtils]: 2: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {1266#true} is VALID [2020-07-10 15:05:59,918 INFO L263 TraceCheckUtils]: 3: Hoare triple {1266#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {1369#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:59,918 INFO L280 TraceCheckUtils]: 4: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,919 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1266#true} {1266#true} #110#return; {1266#true} is VALID [2020-07-10 15:05:59,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {1266#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {1266#true} is VALID [2020-07-10 15:05:59,920 INFO L280 TraceCheckUtils]: 8: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,920 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1266#true} {1266#true} #90#return; {1266#true} is VALID [2020-07-10 15:05:59,920 INFO L280 TraceCheckUtils]: 10: Hoare triple {1266#true} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {1266#true} is VALID [2020-07-10 15:05:59,920 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} assume !(~hp_slot_ptr~0.base == 0 && ~hp_slot_ptr~0.offset == 0);call write~int(5, ~hp_slot_ptr~0.base, 4 + ~hp_slot_ptr~0.offset, 4); {1266#true} is VALID [2020-07-10 15:05:59,922 INFO L263 TraceCheckUtils]: 12: Hoare triple {1266#true} call #t~ret5.base, #t~ret5.offset := kzalloc(16, 1); {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:59,922 INFO L280 TraceCheckUtils]: 13: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {1266#true} is VALID [2020-07-10 15:05:59,923 INFO L263 TraceCheckUtils]: 14: Hoare triple {1266#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {1369#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:59,923 INFO L280 TraceCheckUtils]: 15: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,924 INFO L280 TraceCheckUtils]: 16: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,924 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1266#true} {1266#true} #110#return; {1266#true} is VALID [2020-07-10 15:05:59,924 INFO L280 TraceCheckUtils]: 18: Hoare triple {1266#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {1266#true} is VALID [2020-07-10 15:05:59,924 INFO L280 TraceCheckUtils]: 19: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,925 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1266#true} {1266#true} #92#return; {1266#true} is VALID [2020-07-10 15:05:59,925 INFO L280 TraceCheckUtils]: 21: Hoare triple {1266#true} ~tmp_slot~0.base, ~tmp_slot~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {1266#true} is VALID [2020-07-10 15:05:59,925 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#true} assume !(~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0);~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 0;call write~int(2, ~tmp_slot~0.base, ~tmp_slot~0.offset, 4);call write~int(3, ~tmp_slot~0.base, 4 + ~tmp_slot~0.offset, 4); {1266#true} is VALID [2020-07-10 15:05:59,926 INFO L263 TraceCheckUtils]: 23: Hoare triple {1266#true} call #t~ret6.base, #t~ret6.offset := ibmphp_find_same_bus_num(); {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:59,927 INFO L263 TraceCheckUtils]: 24: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~ret1.base, #t~ret1.offset := kzalloc(0, 0); {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:59,928 INFO L280 TraceCheckUtils]: 25: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:59,929 INFO L263 TraceCheckUtils]: 26: Hoare triple {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {1369#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:59,930 INFO L280 TraceCheckUtils]: 27: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,930 INFO L280 TraceCheckUtils]: 28: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,931 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1266#true} {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:59,932 INFO L280 TraceCheckUtils]: 30: Hoare triple {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:59,933 INFO L280 TraceCheckUtils]: 31: Hoare triple {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:59,934 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} #108#return; {1381#(or (<= 1 |ibmphp_find_same_bus_num_#t~ret1.base|) (<= (+ |ibmphp_find_same_bus_num_#t~ret1.base| 1) 0))} is VALID [2020-07-10 15:05:59,935 INFO L280 TraceCheckUtils]: 33: Hoare triple {1381#(or (<= 1 |ibmphp_find_same_bus_num_#t~ret1.base|) (<= (+ |ibmphp_find_same_bus_num_#t~ret1.base| 1) 0))} #res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} is VALID [2020-07-10 15:05:59,936 INFO L280 TraceCheckUtils]: 34: Hoare triple {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} assume true; {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} is VALID [2020-07-10 15:05:59,937 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} {1266#true} #94#return; {1355#(not (= 0 |ebda_rsrc_controller_#t~ret6.base|))} is VALID [2020-07-10 15:05:59,937 INFO L280 TraceCheckUtils]: 36: Hoare triple {1355#(not (= 0 |ebda_rsrc_controller_#t~ret6.base|))} ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {1356#(not (= ebda_rsrc_controller_~bus_info_ptr1~0.base 0))} is VALID [2020-07-10 15:05:59,938 INFO L280 TraceCheckUtils]: 37: Hoare triple {1356#(not (= ebda_rsrc_controller_~bus_info_ptr1~0.base 0))} assume ~bus_info_ptr1~0.base == 0 && ~bus_info_ptr1~0.offset == 0;~rc~0 := -3; {1267#false} is VALID [2020-07-10 15:05:59,938 INFO L263 TraceCheckUtils]: 38: Hoare triple {1267#false} call kfree(~tmp_slot~0.base, ~tmp_slot~0.offset); {1388#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} is VALID [2020-07-10 15:05:59,939 INFO L280 TraceCheckUtils]: 39: Hoare triple {1388#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1266#true} is VALID [2020-07-10 15:05:59,939 INFO L280 TraceCheckUtils]: 40: Hoare triple {1266#true} assume (~p.base != 0 || ~p.offset != 0) && ~p.base == ~tmp_slot~0.base && ~p.offset == ~tmp_slot~0.offset;~freed_tmp_slot~0 := 1; {1266#true} is VALID [2020-07-10 15:05:59,939 INFO L280 TraceCheckUtils]: 41: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,939 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1266#true} {1267#false} #96#return; {1267#false} is VALID [2020-07-10 15:05:59,940 INFO L280 TraceCheckUtils]: 43: Hoare triple {1267#false} ~freed_tmp_slot~0 := 1; {1267#false} is VALID [2020-07-10 15:05:59,940 INFO L280 TraceCheckUtils]: 44: Hoare triple {1267#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset, 4); {1267#false} is VALID [2020-07-10 15:05:59,940 INFO L263 TraceCheckUtils]: 45: Hoare triple {1267#false} call kfree(#t~mem9.base, #t~mem9.offset); {1388#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} is VALID [2020-07-10 15:05:59,940 INFO L280 TraceCheckUtils]: 46: Hoare triple {1388#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1266#true} is VALID [2020-07-10 15:05:59,940 INFO L280 TraceCheckUtils]: 47: Hoare triple {1266#true} assume (~p.base != 0 || ~p.offset != 0) && ~p.base == ~tmp_slot~0.base && ~p.offset == ~tmp_slot~0.offset;~freed_tmp_slot~0 := 1; {1266#true} is VALID [2020-07-10 15:05:59,941 INFO L280 TraceCheckUtils]: 48: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,941 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {1266#true} {1267#false} #102#return; {1267#false} is VALID [2020-07-10 15:05:59,941 INFO L280 TraceCheckUtils]: 50: Hoare triple {1267#false} havoc #t~mem9.base, #t~mem9.offset; {1267#false} is VALID [2020-07-10 15:05:59,941 INFO L280 TraceCheckUtils]: 51: Hoare triple {1267#false} #res := ~rc~0; {1267#false} is VALID [2020-07-10 15:05:59,941 INFO L280 TraceCheckUtils]: 52: Hoare triple {1267#false} assume true; {1267#false} is VALID [2020-07-10 15:05:59,942 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {1267#false} {1266#true} #104#return; {1267#false} is VALID [2020-07-10 15:05:59,946 INFO L263 TraceCheckUtils]: 0: Hoare triple {1266#true} call ULTIMATE.init(); {1325#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} is VALID [2020-07-10 15:05:59,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {1325#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp_slot~0.base, ~tmp_slot~0.offset := 0, 0;~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 1; {1266#true} is VALID [2020-07-10 15:05:59,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,946 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1266#true} #112#return; {1266#true} is VALID [2020-07-10 15:05:59,947 INFO L263 TraceCheckUtils]: 4: Hoare triple {1266#true} call #t~ret11 := main(); {1266#true} is VALID [2020-07-10 15:05:59,948 INFO L263 TraceCheckUtils]: 5: Hoare triple {1266#true} call #t~ret10 := ebda_rsrc_controller(); {1326#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} is VALID [2020-07-10 15:05:59,948 INFO L280 TraceCheckUtils]: 6: Hoare triple {1326#(and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|))} havoc ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset;havoc ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset;havoc ~rc~0; {1266#true} is VALID [2020-07-10 15:05:59,949 INFO L263 TraceCheckUtils]: 7: Hoare triple {1266#true} call #t~ret4.base, #t~ret4.offset := kzalloc(8, 1); {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:59,949 INFO L280 TraceCheckUtils]: 8: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {1266#true} is VALID [2020-07-10 15:05:59,950 INFO L263 TraceCheckUtils]: 9: Hoare triple {1266#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {1369#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:59,951 INFO L280 TraceCheckUtils]: 10: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,951 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,951 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1266#true} {1266#true} #110#return; {1266#true} is VALID [2020-07-10 15:05:59,951 INFO L280 TraceCheckUtils]: 13: Hoare triple {1266#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {1266#true} is VALID [2020-07-10 15:05:59,951 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,952 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1266#true} {1266#true} #90#return; {1266#true} is VALID [2020-07-10 15:05:59,952 INFO L280 TraceCheckUtils]: 16: Hoare triple {1266#true} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {1266#true} is VALID [2020-07-10 15:05:59,952 INFO L280 TraceCheckUtils]: 17: Hoare triple {1266#true} assume !(~hp_slot_ptr~0.base == 0 && ~hp_slot_ptr~0.offset == 0);call write~int(5, ~hp_slot_ptr~0.base, 4 + ~hp_slot_ptr~0.offset, 4); {1266#true} is VALID [2020-07-10 15:05:59,953 INFO L263 TraceCheckUtils]: 18: Hoare triple {1266#true} call #t~ret5.base, #t~ret5.offset := kzalloc(16, 1); {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:59,953 INFO L280 TraceCheckUtils]: 19: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {1266#true} is VALID [2020-07-10 15:05:59,955 INFO L263 TraceCheckUtils]: 20: Hoare triple {1266#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {1369#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:59,955 INFO L280 TraceCheckUtils]: 21: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,955 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,955 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1266#true} {1266#true} #110#return; {1266#true} is VALID [2020-07-10 15:05:59,956 INFO L280 TraceCheckUtils]: 24: Hoare triple {1266#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {1266#true} is VALID [2020-07-10 15:05:59,956 INFO L280 TraceCheckUtils]: 25: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,956 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1266#true} {1266#true} #92#return; {1266#true} is VALID [2020-07-10 15:05:59,956 INFO L280 TraceCheckUtils]: 27: Hoare triple {1266#true} ~tmp_slot~0.base, ~tmp_slot~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {1266#true} is VALID [2020-07-10 15:05:59,956 INFO L280 TraceCheckUtils]: 28: Hoare triple {1266#true} assume !(~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0);~used_tmp_slot~0 := 0;~freed_tmp_slot~0 := 0;call write~int(2, ~tmp_slot~0.base, ~tmp_slot~0.offset, 4);call write~int(3, ~tmp_slot~0.base, 4 + ~tmp_slot~0.offset, 4); {1266#true} is VALID [2020-07-10 15:05:59,957 INFO L263 TraceCheckUtils]: 29: Hoare triple {1266#true} call #t~ret6.base, #t~ret6.offset := ibmphp_find_same_bus_num(); {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:59,959 INFO L263 TraceCheckUtils]: 30: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~ret1.base, #t~ret1.offset := kzalloc(0, 0); {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:59,960 INFO L280 TraceCheckUtils]: 31: Hoare triple {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~size := #in~size;~flags := #in~flags;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(~size); {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:59,961 INFO L263 TraceCheckUtils]: 32: Hoare triple {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {1369#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:59,962 INFO L280 TraceCheckUtils]: 33: Hoare triple {1369#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1266#true} is VALID [2020-07-10 15:05:59,962 INFO L280 TraceCheckUtils]: 34: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,963 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1266#true} {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #110#return; {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:59,964 INFO L280 TraceCheckUtils]: 36: Hoare triple {1383#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:59,965 INFO L280 TraceCheckUtils]: 37: Hoare triple {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:59,966 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1387#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {1365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} #108#return; {1381#(or (<= 1 |ibmphp_find_same_bus_num_#t~ret1.base|) (<= (+ |ibmphp_find_same_bus_num_#t~ret1.base| 1) 0))} is VALID [2020-07-10 15:05:59,967 INFO L280 TraceCheckUtils]: 39: Hoare triple {1381#(or (<= 1 |ibmphp_find_same_bus_num_#t~ret1.base|) (<= (+ |ibmphp_find_same_bus_num_#t~ret1.base| 1) 0))} #res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} is VALID [2020-07-10 15:05:59,968 INFO L280 TraceCheckUtils]: 40: Hoare triple {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} assume true; {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} is VALID [2020-07-10 15:05:59,969 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1382#(or (<= (+ |ibmphp_find_same_bus_num_#res.base| 1) 0) (<= 1 |ibmphp_find_same_bus_num_#res.base|))} {1266#true} #94#return; {1355#(not (= 0 |ebda_rsrc_controller_#t~ret6.base|))} is VALID [2020-07-10 15:05:59,969 INFO L280 TraceCheckUtils]: 42: Hoare triple {1355#(not (= 0 |ebda_rsrc_controller_#t~ret6.base|))} ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {1356#(not (= ebda_rsrc_controller_~bus_info_ptr1~0.base 0))} is VALID [2020-07-10 15:05:59,970 INFO L280 TraceCheckUtils]: 43: Hoare triple {1356#(not (= ebda_rsrc_controller_~bus_info_ptr1~0.base 0))} assume ~bus_info_ptr1~0.base == 0 && ~bus_info_ptr1~0.offset == 0;~rc~0 := -3; {1267#false} is VALID [2020-07-10 15:05:59,970 INFO L263 TraceCheckUtils]: 44: Hoare triple {1267#false} call kfree(~tmp_slot~0.base, ~tmp_slot~0.offset); {1388#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} is VALID [2020-07-10 15:05:59,970 INFO L280 TraceCheckUtils]: 45: Hoare triple {1388#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1266#true} is VALID [2020-07-10 15:05:59,971 INFO L280 TraceCheckUtils]: 46: Hoare triple {1266#true} assume (~p.base != 0 || ~p.offset != 0) && ~p.base == ~tmp_slot~0.base && ~p.offset == ~tmp_slot~0.offset;~freed_tmp_slot~0 := 1; {1266#true} is VALID [2020-07-10 15:05:59,971 INFO L280 TraceCheckUtils]: 47: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,971 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1266#true} {1267#false} #96#return; {1267#false} is VALID [2020-07-10 15:05:59,971 INFO L280 TraceCheckUtils]: 49: Hoare triple {1267#false} ~freed_tmp_slot~0 := 1; {1267#false} is VALID [2020-07-10 15:05:59,971 INFO L280 TraceCheckUtils]: 50: Hoare triple {1267#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset, 4); {1267#false} is VALID [2020-07-10 15:05:59,972 INFO L263 TraceCheckUtils]: 51: Hoare triple {1267#false} call kfree(#t~mem9.base, #t~mem9.offset); {1388#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} is VALID [2020-07-10 15:05:59,972 INFO L280 TraceCheckUtils]: 52: Hoare triple {1388#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {1266#true} is VALID [2020-07-10 15:05:59,972 INFO L280 TraceCheckUtils]: 53: Hoare triple {1266#true} assume (~p.base != 0 || ~p.offset != 0) && ~p.base == ~tmp_slot~0.base && ~p.offset == ~tmp_slot~0.offset;~freed_tmp_slot~0 := 1; {1266#true} is VALID [2020-07-10 15:05:59,972 INFO L280 TraceCheckUtils]: 54: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 15:05:59,972 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {1266#true} {1267#false} #102#return; {1267#false} is VALID [2020-07-10 15:05:59,973 INFO L280 TraceCheckUtils]: 56: Hoare triple {1267#false} havoc #t~mem9.base, #t~mem9.offset; {1267#false} is VALID [2020-07-10 15:05:59,973 INFO L280 TraceCheckUtils]: 57: Hoare triple {1267#false} #res := ~rc~0; {1267#false} is VALID [2020-07-10 15:05:59,973 INFO L280 TraceCheckUtils]: 58: Hoare triple {1267#false} assume true; {1267#false} is VALID [2020-07-10 15:05:59,973 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {1267#false} {1266#true} #104#return; {1267#false} is VALID [2020-07-10 15:05:59,973 INFO L280 TraceCheckUtils]: 60: Hoare triple {1267#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;havoc #t~ret10; {1267#false} is VALID [2020-07-10 15:05:59,974 INFO L280 TraceCheckUtils]: 61: Hoare triple {1267#false} assume 0 == ~used_tmp_slot~0; {1267#false} is VALID [2020-07-10 15:05:59,974 INFO L280 TraceCheckUtils]: 62: Hoare triple {1267#false} assume !(0 != ~freed_tmp_slot~0); {1267#false} is VALID [2020-07-10 15:05:59,974 INFO L263 TraceCheckUtils]: 63: Hoare triple {1267#false} call __blast_assert(); {1267#false} is VALID [2020-07-10 15:05:59,974 INFO L280 TraceCheckUtils]: 64: Hoare triple {1267#false} assume !false; {1267#false} is VALID [2020-07-10 15:05:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-10 15:05:59,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398413474] [2020-07-10 15:05:59,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:59,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 15:05:59,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563064826] [2020-07-10 15:05:59,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-10 15:05:59,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:59,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:06:00,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:00,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:06:00,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:00,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:06:00,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:06:00,044 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 13 states. [2020-07-10 15:06:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:00,971 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-10 15:06:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:06:00,971 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-10 15:06:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:06:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2020-07-10 15:06:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:06:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2020-07-10 15:06:00,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2020-07-10 15:06:01,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:01,059 INFO L225 Difference]: With dead ends: 54 [2020-07-10 15:06:01,059 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:06:01,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:06:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:06:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:06:01,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:01,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:01,061 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:01,061 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:01,062 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:06:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:01,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:01,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:01,062 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:01,062 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:01,063 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:06:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:01,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:01,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:01,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:01,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:06:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:06:01,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2020-07-10 15:06:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:01,065 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:06:01,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:06:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:01,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:01,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:06:01,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:06:01,595 INFO L268 CegarLoopResult]: For program point ibmphp_find_same_bus_numEXIT(lines 54 56) no Hoare annotation was computed. [2020-07-10 15:06:01,595 INFO L268 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2020-07-10 15:06:01,595 INFO L264 CegarLoopResult]: At program point ibmphp_find_same_bus_numENTRY(lines 54 56) the Hoare annotation is: (or (= 0 ~tmp_slot~0.base) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))) [2020-07-10 15:06:01,595 INFO L268 CegarLoopResult]: For program point ibmphp_find_same_bus_numFINAL(lines 54 56) no Hoare annotation was computed. [2020-07-10 15:06:01,595 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:01,595 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |old(~freed_tmp_slot~0)| ~freed_tmp_slot~0) (= |#NULL.offset| |old(#NULL.offset)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|)) [2020-07-10 15:06:01,595 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:01,595 INFO L268 CegarLoopResult]: For program point L49(lines 49 50) no Hoare annotation was computed. [2020-07-10 15:06:01,596 INFO L268 CegarLoopResult]: For program point kfreeEXIT(lines 48 51) no Hoare annotation was computed. [2020-07-10 15:06:01,596 INFO L268 CegarLoopResult]: For program point L49-2(lines 48 51) no Hoare annotation was computed. [2020-07-10 15:06:01,596 INFO L264 CegarLoopResult]: At program point kfreeENTRY(lines 48 51) the Hoare annotation is: (or (= |old(~freed_tmp_slot~0)| ~freed_tmp_slot~0) (not (= ~used_tmp_slot~0 1)) (= 0 ~tmp_slot~0.base)) [2020-07-10 15:06:01,596 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0)) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 15:06:01,596 INFO L268 CegarLoopResult]: For program point L46-1(line 46) no Hoare annotation was computed. [2020-07-10 15:06:01,596 INFO L268 CegarLoopResult]: For program point kzallocEXIT(line 46) no Hoare annotation was computed. [2020-07-10 15:06:01,596 INFO L264 CegarLoopResult]: At program point kzallocENTRY(line 46) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|)) [2020-07-10 15:06:01,596 INFO L268 CegarLoopResult]: For program point kzallocFINAL(line 46) no Hoare annotation was computed. [2020-07-10 15:06:01,596 INFO L268 CegarLoopResult]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-10 15:06:01,596 INFO L268 CegarLoopResult]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2020-07-10 15:06:01,596 INFO L268 CegarLoopResult]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2020-07-10 15:06:01,597 INFO L271 CegarLoopResult]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2020-07-10 15:06:01,597 INFO L271 CegarLoopResult]: At program point ibmphp_init_devnoENTRY(lines 65 68) the Hoare annotation is: true [2020-07-10 15:06:01,597 INFO L268 CegarLoopResult]: For program point ibmphp_init_devnoFINAL(lines 65 68) no Hoare annotation was computed. [2020-07-10 15:06:01,597 INFO L268 CegarLoopResult]: For program point ibmphp_init_devnoEXIT(lines 65 68) no Hoare annotation was computed. [2020-07-10 15:06:01,597 INFO L268 CegarLoopResult]: For program point L97(lines 97 105) no Hoare annotation was computed. [2020-07-10 15:06:01,597 INFO L268 CegarLoopResult]: For program point ebda_rsrc_controllerEXIT(lines 70 131) no Hoare annotation was computed. [2020-07-10 15:06:01,597 INFO L264 CegarLoopResult]: At program point L126(lines 70 131) the Hoare annotation is: (and (= ~used_tmp_slot~0 1) (not (= 0 ~tmp_slot~0.base)) (not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))) [2020-07-10 15:06:01,597 INFO L264 CegarLoopResult]: At program point L120(lines 70 131) the Hoare annotation is: (and (= ~used_tmp_slot~0 1) (not (= 0 ~tmp_slot~0.base)) (not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))) [2020-07-10 15:06:01,597 INFO L264 CegarLoopResult]: At program point L118(line 118) the Hoare annotation is: (and (= ~used_tmp_slot~0 1) (not (= 0 ~tmp_slot~0.base)) (not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))) [2020-07-10 15:06:01,597 INFO L268 CegarLoopResult]: For program point L85(lines 85 88) no Hoare annotation was computed. [2020-07-10 15:06:01,597 INFO L268 CegarLoopResult]: For program point L118-1(line 118) no Hoare annotation was computed. [2020-07-10 15:06:01,598 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (and (not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base)) (= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)) [2020-07-10 15:06:01,598 INFO L268 CegarLoopResult]: For program point L83-1(line 83) no Hoare annotation was computed. [2020-07-10 15:06:01,598 INFO L264 CegarLoopResult]: At program point L114(line 114) the Hoare annotation is: (and (= ~used_tmp_slot~0 1) (not (= 0 ~tmp_slot~0.base)) (not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))) [2020-07-10 15:06:01,598 INFO L268 CegarLoopResult]: For program point L114-1(line 114) no Hoare annotation was computed. [2020-07-10 15:06:01,598 INFO L268 CegarLoopResult]: For program point L77(lines 77 80) no Hoare annotation was computed. [2020-07-10 15:06:01,598 INFO L264 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (and (not (= 0 ~tmp_slot~0.base)) (not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))) [2020-07-10 15:06:01,598 INFO L268 CegarLoopResult]: For program point L96-1(line 96) no Hoare annotation was computed. [2020-07-10 15:06:01,598 INFO L264 CegarLoopResult]: At program point ebda_rsrc_controllerENTRY(lines 70 131) the Hoare annotation is: (and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |old(~freed_tmp_slot~0)| ~freed_tmp_slot~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|)) [2020-07-10 15:06:01,599 INFO L264 CegarLoopResult]: At program point L125(line 125) the Hoare annotation is: (and (= ~used_tmp_slot~0 1) (not (= 0 ~tmp_slot~0.base)) (not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))) [2020-07-10 15:06:01,599 INFO L268 CegarLoopResult]: For program point ebda_rsrc_controllerFINAL(lines 70 131) no Hoare annotation was computed. [2020-07-10 15:06:01,599 INFO L268 CegarLoopResult]: For program point L125-1(line 125) no Hoare annotation was computed. [2020-07-10 15:06:01,599 INFO L268 CegarLoopResult]: For program point L119(lines 119 120) no Hoare annotation was computed. [2020-07-10 15:06:01,599 INFO L268 CegarLoopResult]: For program point L115(lines 115 116) no Hoare annotation was computed. [2020-07-10 15:06:01,599 INFO L264 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |old(~freed_tmp_slot~0)| ~freed_tmp_slot~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|)) [2020-07-10 15:06:01,599 INFO L268 CegarLoopResult]: For program point L76-1(line 76) no Hoare annotation was computed. [2020-07-10 15:06:01,599 INFO L264 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: false [2020-07-10 15:06:01,600 INFO L268 CegarLoopResult]: For program point L101-1(line 101) no Hoare annotation was computed. [2020-07-10 15:06:01,600 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:01,600 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:06:01,600 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:06:01,600 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:01,600 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 133 137) the Hoare annotation is: (and (= ~used_tmp_slot~0 |old(~used_tmp_slot~0)|) (= |#valid| |old(#valid)|) (= |old(~freed_tmp_slot~0)| ~freed_tmp_slot~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~tmp_slot~0.base |old(~tmp_slot~0.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tmp_slot~0.offset |old(~tmp_slot~0.offset)|)) [2020-07-10 15:06:01,600 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 133 137) no Hoare annotation was computed. [2020-07-10 15:06:01,600 INFO L268 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2020-07-10 15:06:01,600 INFO L268 CegarLoopResult]: For program point L135(lines 135 136) no Hoare annotation was computed. [2020-07-10 15:06:01,601 INFO L268 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-07-10 15:06:01,601 INFO L264 CegarLoopResult]: At program point L136-2(line 136) the Hoare annotation is: false [2020-07-10 15:06:01,601 INFO L268 CegarLoopResult]: For program point L135-1(lines 133 137) no Hoare annotation was computed. [2020-07-10 15:06:01,601 INFO L271 CegarLoopResult]: At program point fillslotinfoENTRY(lines 60 63) the Hoare annotation is: true [2020-07-10 15:06:01,601 INFO L268 CegarLoopResult]: For program point fillslotinfoEXIT(lines 60 63) no Hoare annotation was computed. [2020-07-10 15:06:01,601 INFO L268 CegarLoopResult]: For program point fillslotinfoFINAL(lines 60 63) no Hoare annotation was computed. [2020-07-10 15:06:01,601 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-10 15:06:01,601 INFO L268 CegarLoopResult]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:01,601 INFO L268 CegarLoopResult]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:01,605 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-10 15:06:01,606 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:01,607 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:06:01,608 WARN L170 areAnnotationChecker]: __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:06:01,608 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2020-07-10 15:06:01,608 WARN L170 areAnnotationChecker]: ibmphp_init_devnoFINAL has no Hoare annotation [2020-07-10 15:06:01,609 WARN L170 areAnnotationChecker]: fillslotinfoFINAL has no Hoare annotation [2020-07-10 15:06:01,609 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-10 15:06:01,611 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-10 15:06:01,611 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-10 15:06:01,611 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:01,611 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:06:01,611 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:06:01,611 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-10 15:06:01,612 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:01,613 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2020-07-10 15:06:01,613 WARN L170 areAnnotationChecker]: ibmphp_init_devnoFINAL has no Hoare annotation [2020-07-10 15:06:01,614 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-10 15:06:01,615 WARN L170 areAnnotationChecker]: fillslotinfoFINAL has no Hoare annotation [2020-07-10 15:06:01,615 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-10 15:06:01,615 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-10 15:06:01,615 WARN L170 areAnnotationChecker]: ibmphp_find_same_bus_numFINAL has no Hoare annotation [2020-07-10 15:06:01,615 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: ibmphp_init_devnoEXIT has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: fillslotinfoEXIT has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: ibmphp_find_same_bus_numEXIT has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: kfreeEXIT has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: kfreeEXIT has no Hoare annotation [2020-07-10 15:06:01,616 WARN L170 areAnnotationChecker]: kzallocFINAL has no Hoare annotation [2020-07-10 15:06:01,617 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2020-07-10 15:06:01,617 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-10 15:06:01,617 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-10 15:06:01,617 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-10 15:06:01,617 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2020-07-10 15:06:01,617 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2020-07-10 15:06:01,617 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2020-07-10 15:06:01,617 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2020-07-10 15:06:01,618 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2020-07-10 15:06:01,618 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2020-07-10 15:06:01,618 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2020-07-10 15:06:01,618 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2020-07-10 15:06:01,618 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2020-07-10 15:06:01,618 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:06:01,618 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2020-07-10 15:06:01,618 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2020-07-10 15:06:01,618 WARN L170 areAnnotationChecker]: ebda_rsrc_controllerFINAL has no Hoare annotation [2020-07-10 15:06:01,618 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2020-07-10 15:06:01,619 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-10 15:06:01,619 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-10 15:06:01,619 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2020-07-10 15:06:01,620 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-10 15:06:01,620 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-10 15:06:01,620 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2020-07-10 15:06:01,620 WARN L170 areAnnotationChecker]: ebda_rsrc_controllerFINAL has no Hoare annotation [2020-07-10 15:06:01,620 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-10 15:06:01,620 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2020-07-10 15:06:01,620 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2020-07-10 15:06:01,621 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2020-07-10 15:06:01,621 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 15:06:01,621 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 15:06:01,621 WARN L170 areAnnotationChecker]: ebda_rsrc_controllerEXIT has no Hoare annotation [2020-07-10 15:06:01,621 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2020-07-10 15:06:01,622 INFO L163 areAnnotationChecker]: CFG has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:06:01,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:06:01 BoogieIcfgContainer [2020-07-10 15:06:01,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:06:01,637 INFO L168 Benchmark]: Toolchain (without parser) took 10180.30 ms. Allocated memory was 142.6 MB in the beginning and 332.9 MB in the end (delta: 190.3 MB). Free memory was 103.4 MB in the beginning and 265.5 MB in the end (delta: -162.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:01,638 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 142.6 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 15:06:01,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.38 ms. Allocated memory was 142.6 MB in the beginning and 203.4 MB in the end (delta: 60.8 MB). Free memory was 103.2 MB in the beginning and 181.7 MB in the end (delta: -78.5 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:01,639 INFO L168 Benchmark]: Boogie Preprocessor took 51.60 ms. Allocated memory is still 203.4 MB. Free memory was 181.7 MB in the beginning and 178.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:01,640 INFO L168 Benchmark]: RCFGBuilder took 722.81 ms. Allocated memory is still 203.4 MB. Free memory was 178.6 MB in the beginning and 142.7 MB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:01,641 INFO L168 Benchmark]: TraceAbstraction took 8993.78 ms. Allocated memory was 203.4 MB in the beginning and 332.9 MB in the end (delta: 129.5 MB). Free memory was 142.1 MB in the beginning and 265.5 MB in the end (delta: -123.4 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:01,644 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 142.6 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 403.38 ms. Allocated memory was 142.6 MB in the beginning and 203.4 MB in the end (delta: 60.8 MB). Free memory was 103.2 MB in the beginning and 181.7 MB in the end (delta: -78.5 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.60 ms. Allocated memory is still 203.4 MB. Free memory was 181.7 MB in the beginning and 178.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 722.81 ms. Allocated memory is still 203.4 MB. Free memory was 178.6 MB in the beginning and 142.7 MB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8993.78 ms. Allocated memory was 203.4 MB in the beginning and 332.9 MB in the end (delta: 129.5 MB). Free memory was 142.1 MB in the beginning and 265.5 MB in the end (delta: -123.4 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 70]: Loop Invariant Derived loop invariant: (used_tmp_slot == 1 && !(0 == tmp_slot)) && !(0 == hp_slot_ptr) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: (used_tmp_slot == 1 && !(0 == tmp_slot)) && !(0 == hp_slot_ptr) - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.3s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 204 SDtfs, 162 SDslu, 625 SDs, 0 SdLazy, 705 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 33 PreInvPairs, 36 NumberOfFragments, 241 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 358 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 32978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 60/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...