/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_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:05:52,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:05:52,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:05:52,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:05:52,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:05:52,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:05:52,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:05:52,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:05:52,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:05:52,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:05:52,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:05:52,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:05:52,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:05:52,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:05:52,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:05:52,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:05:52,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:05:52,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:05:52,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:05:52,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:05:52,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:05:52,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:05:52,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:05:52,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:05:52,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:05:52,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:05:52,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:05:52,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:05:52,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:05:52,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:05:52,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:05:52,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:05:52,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:05:52,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:05:52,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:05:52,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:05:52,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:05:52,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:05:52,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:05:52,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:05:52,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:05:52,483 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:52,499 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:05:52,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:05:52,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:05:52,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:05:52,501 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:05:52,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:05:52,501 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:05:52,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:05:52,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:05:52,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:05:52,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:05:52,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:05:52,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:05:52,504 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:05:52,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:05:52,505 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:05:52,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:05:52,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:05:52,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:05:52,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:05:52,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:05:52,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:05:52,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:05:52,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:05:52,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:05:52,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:05:52,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:05:52,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:05:52,508 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:05:52,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:05:52,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:05:52,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:05:52,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:05:52,848 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:05:52,849 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:05:52,850 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule57_ebda_blast_2.i [2020-07-10 15:05:52,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92637e4e4/c7265b57c80144b4ad4ab25738065896/FLAG155f741bd [2020-07-10 15:05:53,460 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:05:53,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule57_ebda_blast_2.i [2020-07-10 15:05:53,470 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92637e4e4/c7265b57c80144b4ad4ab25738065896/FLAG155f741bd [2020-07-10 15:05:53,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92637e4e4/c7265b57c80144b4ad4ab25738065896 [2020-07-10 15:05:53,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:05:53,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:05:53,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:05:53,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:05:53,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:05:53,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:05:53" (1/1) ... [2020-07-10 15:05:53,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7913cb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:53, skipping insertion in model container [2020-07-10 15:05:53,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:05:53" (1/1) ... [2020-07-10 15:05:53,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:05:53,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:05:54,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:05:54,174 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:05:54,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:05:54,334 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:05:54,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:54 WrapperNode [2020-07-10 15:05:54,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:05:54,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:05:54,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:05:54,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:05:54,352 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:54" (1/1) ... [2020-07-10 15:05:54,354 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:54" (1/1) ... [2020-07-10 15:05:54,379 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:54" (1/1) ... [2020-07-10 15:05:54,379 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:54" (1/1) ... [2020-07-10 15:05:54,422 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:54" (1/1) ... [2020-07-10 15:05:54,434 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:54" (1/1) ... [2020-07-10 15:05:54,440 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:54" (1/1) ... [2020-07-10 15:05:54,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:05:54,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:05:54,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:05:54,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:05:54,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:54" (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:54,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:05:54,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:05:54,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-07-10 15:05:54,549 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2020-07-10 15:05:54,549 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2020-07-10 15:05:54,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmphp_find_same_bus_num [2020-07-10 15:05:54,550 INFO L138 BoogieDeclarations]: Found implementation of procedure fillslotinfo [2020-07-10 15:05:54,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmphp_init_devno [2020-07-10 15:05:54,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ebda_rsrc_controller [2020-07-10 15:05:54,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:05:54,551 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-10 15:05:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:05:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:05:54,552 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-07-10 15:05:54,552 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:05:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2020-07-10 15:05:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:05:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-10 15:05:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2020-07-10 15:05:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure ibmphp_find_same_bus_num [2020-07-10 15:05:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure fillslotinfo [2020-07-10 15:05:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure ibmphp_init_devno [2020-07-10 15:05:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure ebda_rsrc_controller [2020-07-10 15:05:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:05:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:05:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:05:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:05:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:05:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:05:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:05:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:05:55,185 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:05:55,186 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:05:55,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:05:55 BoogieIcfgContainer [2020-07-10 15:05:55,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:05:55,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:05:55,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:05:55,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:05:55,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:05:53" (1/3) ... [2020-07-10 15:05:55,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127830ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:05:55, skipping insertion in model container [2020-07-10 15:05:55,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:54" (2/3) ... [2020-07-10 15:05:55,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127830ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:05:55, skipping insertion in model container [2020-07-10 15:05:55,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:05:55" (3/3) ... [2020-07-10 15:05:55,200 INFO L109 eAbstractionObserver]: Analyzing ICFG rule57_ebda_blast_2.i [2020-07-10 15:05:55,212 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:05:55,220 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:05:55,235 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:05:55,262 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:05:55,263 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:05:55,263 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:05:55,263 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:05:55,264 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:05:55,264 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:05:55,264 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:05:55,264 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:05:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2020-07-10 15:05:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:05:55,291 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:55,292 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:55,292 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:55,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash 502124135, now seen corresponding path program 1 times [2020-07-10 15:05:55,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:55,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818620654] [2020-07-10 15:05:55,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,597 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:55,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:55,598 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #113#return; {67#true} is VALID [2020-07-10 15:05:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,903 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:55,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:55,906 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {67#true} {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #111#return; {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,908 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:55,911 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:55,911 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:55,912 INFO L280 TraceCheckUtils]: 3: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:55,913 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {67#true} {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #111#return; {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,915 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:55,916 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:55,918 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {67#true} #93#return; {97#(not (= 0 |ebda_rsrc_controller_#t~ret5.base|))} is VALID [2020-07-10 15:05:55,920 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:55,922 INFO L263 TraceCheckUtils]: 1: Hoare triple {67#true} call #t~ret5.base, #t~ret5.offset := kzalloc(8, 1); {99#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:55,923 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:55,926 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:55,926 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:55,926 INFO L280 TraceCheckUtils]: 5: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:55,928 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {67#true} {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #111#return; {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,930 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:55,931 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:55,932 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {67#true} #93#return; {97#(not (= 0 |ebda_rsrc_controller_#t~ret5.base|))} is VALID [2020-07-10 15:05:55,934 INFO L280 TraceCheckUtils]: 10: Hoare triple {97#(not (= 0 |ebda_rsrc_controller_#t~ret5.base|))} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {98#(not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))} is VALID [2020-07-10 15:05:55,935 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:55,935 INFO L280 TraceCheckUtils]: 12: Hoare triple {68#false} #res := ~rc~0; {68#false} is VALID [2020-07-10 15:05:55,936 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#false} assume true; {68#false} is VALID [2020-07-10 15:05:55,936 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {68#false} {67#true} #105#return; {68#false} is VALID [2020-07-10 15:05:55,940 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:55,940 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:55,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:55,941 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #113#return; {67#true} is VALID [2020-07-10 15:05:55,942 INFO L263 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret12 := main(); {67#true} is VALID [2020-07-10 15:05:55,944 INFO L263 TraceCheckUtils]: 5: Hoare triple {67#true} call #t~ret11 := 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:55,944 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:55,946 INFO L263 TraceCheckUtils]: 7: Hoare triple {67#true} call #t~ret5.base, #t~ret5.offset := kzalloc(8, 1); {99#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:55,947 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:55,950 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:55,950 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:55,965 INFO L280 TraceCheckUtils]: 11: Hoare triple {67#true} assume true; {67#true} is VALID [2020-07-10 15:05:55,971 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {67#true} {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #111#return; {100#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:55,973 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:55,974 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:55,975 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {104#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {67#true} #93#return; {97#(not (= 0 |ebda_rsrc_controller_#t~ret5.base|))} is VALID [2020-07-10 15:05:55,976 INFO L280 TraceCheckUtils]: 16: Hoare triple {97#(not (= 0 |ebda_rsrc_controller_#t~ret5.base|))} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {98#(not (= 0 ebda_rsrc_controller_~hp_slot_ptr~0.base))} is VALID [2020-07-10 15:05:55,977 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:55,977 INFO L280 TraceCheckUtils]: 18: Hoare triple {68#false} #res := ~rc~0; {68#false} is VALID [2020-07-10 15:05:55,978 INFO L280 TraceCheckUtils]: 19: Hoare triple {68#false} assume true; {68#false} is VALID [2020-07-10 15:05:55,978 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {68#false} {67#true} #105#return; {68#false} is VALID [2020-07-10 15:05:55,978 INFO L280 TraceCheckUtils]: 21: Hoare triple {68#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;havoc #t~ret11; {68#false} is VALID [2020-07-10 15:05:55,979 INFO L280 TraceCheckUtils]: 22: Hoare triple {68#false} assume 0 == ~used_tmp_slot~0; {68#false} is VALID [2020-07-10 15:05:55,979 INFO L280 TraceCheckUtils]: 23: Hoare triple {68#false} assume !(0 != ~freed_tmp_slot~0); {68#false} is VALID [2020-07-10 15:05:55,979 INFO L263 TraceCheckUtils]: 24: Hoare triple {68#false} call __blast_assert(); {68#false} is VALID [2020-07-10 15:05:55,980 INFO L280 TraceCheckUtils]: 25: Hoare triple {68#false} assume !false; {68#false} is VALID [2020-07-10 15:05:55,983 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:55,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818620654] [2020-07-10 15:05:55,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:55,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 15:05:55,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150963766] [2020-07-10 15:05:55,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 15:05:55,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:56,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:05:56,056 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:56,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:05:56,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:56,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:05:56,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:05:56,069 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 10 states. [2020-07-10 15:05:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:57,579 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2020-07-10 15:05:57,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:05:57,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 15:05:57,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:05:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2020-07-10 15:05:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:05:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2020-07-10 15:05:57,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 93 transitions. [2020-07-10 15:05:57,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:57,765 INFO L225 Difference]: With dead ends: 81 [2020-07-10 15:05:57,765 INFO L226 Difference]: Without dead ends: 62 [2020-07-10 15:05:57,769 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:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-10 15:05:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2020-07-10 15:05:57,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:57,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 58 states. [2020-07-10 15:05:57,908 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 58 states. [2020-07-10 15:05:57,908 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 58 states. [2020-07-10 15:05:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:57,924 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2020-07-10 15:05:57,925 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2020-07-10 15:05:57,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:57,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:57,926 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 62 states. [2020-07-10 15:05:57,926 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 62 states. [2020-07-10 15:05:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:57,940 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2020-07-10 15:05:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2020-07-10 15:05:57,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:57,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:57,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:57,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 15:05:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2020-07-10 15:05:57,958 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 26 [2020-07-10 15:05:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:57,959 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2020-07-10 15:05:57,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:05:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2020-07-10 15:05:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:05:57,962 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:57,963 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:57,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:05:57,963 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:57,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:57,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1817820821, now seen corresponding path program 1 times [2020-07-10 15:05:57,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:57,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202270585] [2020-07-10 15:05:57,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,116 INFO L280 TraceCheckUtils]: 0: Hoare triple {458#(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; {427#true} is VALID [2020-07-10 15:05:58,117 INFO L280 TraceCheckUtils]: 1: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,117 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {427#true} {427#true} #113#return; {427#true} is VALID [2020-07-10 15:05:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {482#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {427#true} is VALID [2020-07-10 15:05:58,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,234 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {427#true} {427#true} #111#return; {427#true} is VALID [2020-07-10 15:05:58,235 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#(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); {427#true} is VALID [2020-07-10 15:05:58,236 INFO L263 TraceCheckUtils]: 1: Hoare triple {427#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {482#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,237 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {427#true} is VALID [2020-07-10 15:05:58,237 INFO L280 TraceCheckUtils]: 3: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,237 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {427#true} {427#true} #111#return; {427#true} is VALID [2020-07-10 15:05:58,238 INFO L280 TraceCheckUtils]: 5: Hoare triple {427#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {427#true} is VALID [2020-07-10 15:05:58,238 INFO L280 TraceCheckUtils]: 6: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,238 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {427#true} {427#true} #93#return; {427#true} is VALID [2020-07-10 15:05:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {482#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {427#true} is VALID [2020-07-10 15:05:58,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,299 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {427#true} {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #111#return; {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:58,300 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#(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); {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:58,301 INFO L263 TraceCheckUtils]: 1: Hoare triple {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {482#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,302 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {427#true} is VALID [2020-07-10 15:05:58,302 INFO L280 TraceCheckUtils]: 3: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,303 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {427#true} {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #111#return; {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:58,304 INFO L280 TraceCheckUtils]: 5: Hoare triple {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:58,305 INFO L280 TraceCheckUtils]: 6: Hoare triple {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:58,306 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {427#true} #95#return; {476#(not (= 0 |ebda_rsrc_controller_#t~ret6.base|))} is VALID [2020-07-10 15:05:58,307 INFO L280 TraceCheckUtils]: 0: Hoare triple {459#(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; {427#true} is VALID [2020-07-10 15:05:58,308 INFO L263 TraceCheckUtils]: 1: Hoare triple {427#true} call #t~ret5.base, #t~ret5.offset := kzalloc(8, 1); {478#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,308 INFO L280 TraceCheckUtils]: 2: Hoare triple {478#(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); {427#true} is VALID [2020-07-10 15:05:58,310 INFO L263 TraceCheckUtils]: 3: Hoare triple {427#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {482#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {482#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {427#true} is VALID [2020-07-10 15:05:58,310 INFO L280 TraceCheckUtils]: 5: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,311 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {427#true} {427#true} #111#return; {427#true} is VALID [2020-07-10 15:05:58,311 INFO L280 TraceCheckUtils]: 7: Hoare triple {427#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {427#true} is VALID [2020-07-10 15:05:58,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,312 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {427#true} {427#true} #93#return; {427#true} is VALID [2020-07-10 15:05:58,312 INFO L280 TraceCheckUtils]: 10: Hoare triple {427#true} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {427#true} is VALID [2020-07-10 15:05:58,312 INFO L280 TraceCheckUtils]: 11: Hoare triple {427#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); {427#true} is VALID [2020-07-10 15:05:58,313 INFO L263 TraceCheckUtils]: 12: Hoare triple {427#true} call #t~ret6.base, #t~ret6.offset := kzalloc(16, 1); {478#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,315 INFO L280 TraceCheckUtils]: 13: Hoare triple {478#(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); {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:58,316 INFO L263 TraceCheckUtils]: 14: Hoare triple {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {482#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,317 INFO L280 TraceCheckUtils]: 15: Hoare triple {482#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {427#true} is VALID [2020-07-10 15:05:58,317 INFO L280 TraceCheckUtils]: 16: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,318 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {427#true} {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #111#return; {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:58,319 INFO L280 TraceCheckUtils]: 18: Hoare triple {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:58,320 INFO L280 TraceCheckUtils]: 19: Hoare triple {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:58,321 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {427#true} #95#return; {476#(not (= 0 |ebda_rsrc_controller_#t~ret6.base|))} is VALID [2020-07-10 15:05:58,322 INFO L280 TraceCheckUtils]: 21: Hoare triple {476#(not (= 0 |ebda_rsrc_controller_#t~ret6.base|))} ~tmp_slot~0.base, ~tmp_slot~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {477#(not (= 0 ~tmp_slot~0.base))} is VALID [2020-07-10 15:05:58,323 INFO L280 TraceCheckUtils]: 22: Hoare triple {477#(not (= 0 ~tmp_slot~0.base))} assume ~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0;~rc~0 := -2; {428#false} is VALID [2020-07-10 15:05:58,323 INFO L280 TraceCheckUtils]: 23: Hoare triple {428#false} #res := ~rc~0; {428#false} is VALID [2020-07-10 15:05:58,323 INFO L280 TraceCheckUtils]: 24: Hoare triple {428#false} assume true; {428#false} is VALID [2020-07-10 15:05:58,324 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {428#false} {427#true} #105#return; {428#false} is VALID [2020-07-10 15:05:58,326 INFO L263 TraceCheckUtils]: 0: Hoare triple {427#true} call ULTIMATE.init(); {458#(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,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {458#(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; {427#true} is VALID [2020-07-10 15:05:58,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,327 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {427#true} {427#true} #113#return; {427#true} is VALID [2020-07-10 15:05:58,327 INFO L263 TraceCheckUtils]: 4: Hoare triple {427#true} call #t~ret12 := main(); {427#true} is VALID [2020-07-10 15:05:58,329 INFO L263 TraceCheckUtils]: 5: Hoare triple {427#true} call #t~ret11 := ebda_rsrc_controller(); {459#(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,329 INFO L280 TraceCheckUtils]: 6: Hoare triple {459#(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; {427#true} is VALID [2020-07-10 15:05:58,330 INFO L263 TraceCheckUtils]: 7: Hoare triple {427#true} call #t~ret5.base, #t~ret5.offset := kzalloc(8, 1); {478#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,330 INFO L280 TraceCheckUtils]: 8: Hoare triple {478#(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); {427#true} is VALID [2020-07-10 15:05:58,332 INFO L263 TraceCheckUtils]: 9: Hoare triple {427#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {482#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,332 INFO L280 TraceCheckUtils]: 10: Hoare triple {482#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {427#true} is VALID [2020-07-10 15:05:58,332 INFO L280 TraceCheckUtils]: 11: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,332 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {427#true} {427#true} #111#return; {427#true} is VALID [2020-07-10 15:05:58,333 INFO L280 TraceCheckUtils]: 13: Hoare triple {427#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {427#true} is VALID [2020-07-10 15:05:58,333 INFO L280 TraceCheckUtils]: 14: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,333 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {427#true} {427#true} #93#return; {427#true} is VALID [2020-07-10 15:05:58,334 INFO L280 TraceCheckUtils]: 16: Hoare triple {427#true} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {427#true} is VALID [2020-07-10 15:05:58,334 INFO L280 TraceCheckUtils]: 17: Hoare triple {427#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); {427#true} is VALID [2020-07-10 15:05:58,335 INFO L263 TraceCheckUtils]: 18: Hoare triple {427#true} call #t~ret6.base, #t~ret6.offset := kzalloc(16, 1); {478#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:05:58,336 INFO L280 TraceCheckUtils]: 19: Hoare triple {478#(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); {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:58,338 INFO L263 TraceCheckUtils]: 20: Hoare triple {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {482#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:05:58,338 INFO L280 TraceCheckUtils]: 21: Hoare triple {482#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {427#true} is VALID [2020-07-10 15:05:58,339 INFO L280 TraceCheckUtils]: 22: Hoare triple {427#true} assume true; {427#true} is VALID [2020-07-10 15:05:58,340 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {427#true} {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #111#return; {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} is VALID [2020-07-10 15:05:58,341 INFO L280 TraceCheckUtils]: 24: Hoare triple {483#(or (< 0 |kzalloc_#t~malloc0.base|) (<= (+ |kzalloc_#t~malloc0.base| 1) 0))} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:58,341 INFO L280 TraceCheckUtils]: 25: Hoare triple {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} assume true; {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} is VALID [2020-07-10 15:05:58,343 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {487#(or (<= 1 |kzalloc_#res.base|) (<= (+ |kzalloc_#res.base| 1) 0))} {427#true} #95#return; {476#(not (= 0 |ebda_rsrc_controller_#t~ret6.base|))} is VALID [2020-07-10 15:05:58,344 INFO L280 TraceCheckUtils]: 27: Hoare triple {476#(not (= 0 |ebda_rsrc_controller_#t~ret6.base|))} ~tmp_slot~0.base, ~tmp_slot~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {477#(not (= 0 ~tmp_slot~0.base))} is VALID [2020-07-10 15:05:58,344 INFO L280 TraceCheckUtils]: 28: Hoare triple {477#(not (= 0 ~tmp_slot~0.base))} assume ~tmp_slot~0.base == 0 && ~tmp_slot~0.offset == 0;~rc~0 := -2; {428#false} is VALID [2020-07-10 15:05:58,345 INFO L280 TraceCheckUtils]: 29: Hoare triple {428#false} #res := ~rc~0; {428#false} is VALID [2020-07-10 15:05:58,345 INFO L280 TraceCheckUtils]: 30: Hoare triple {428#false} assume true; {428#false} is VALID [2020-07-10 15:05:58,345 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {428#false} {427#true} #105#return; {428#false} is VALID [2020-07-10 15:05:58,346 INFO L280 TraceCheckUtils]: 32: Hoare triple {428#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;havoc #t~ret11; {428#false} is VALID [2020-07-10 15:05:58,346 INFO L280 TraceCheckUtils]: 33: Hoare triple {428#false} assume 0 == ~used_tmp_slot~0; {428#false} is VALID [2020-07-10 15:05:58,346 INFO L280 TraceCheckUtils]: 34: Hoare triple {428#false} assume !(0 != ~freed_tmp_slot~0); {428#false} is VALID [2020-07-10 15:05:58,347 INFO L263 TraceCheckUtils]: 35: Hoare triple {428#false} call __blast_assert(); {428#false} is VALID [2020-07-10 15:05:58,347 INFO L280 TraceCheckUtils]: 36: Hoare triple {428#false} assume !false; {428#false} is VALID [2020-07-10 15:05:58,350 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:58,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202270585] [2020-07-10 15:05:58,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:58,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 15:05:58,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843373911] [2020-07-10 15:05:58,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-10 15:05:58,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:58,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:05:58,407 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:58,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:05:58,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:58,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:05:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:05:58,409 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 10 states. [2020-07-10 15:05:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:59,820 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2020-07-10 15:05:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:05:59,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-10 15:05:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:05:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2020-07-10 15:05:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:05:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2020-07-10 15:05:59,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 84 transitions. [2020-07-10 15:05:59,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:59,995 INFO L225 Difference]: With dead ends: 79 [2020-07-10 15:05:59,995 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 15:05:59,996 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:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 15:06:00,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2020-07-10 15:06:00,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:00,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 66 states. [2020-07-10 15:06:00,093 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 66 states. [2020-07-10 15:06:00,093 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 66 states. [2020-07-10 15:06:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:00,098 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2020-07-10 15:06:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2020-07-10 15:06:00,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:00,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:00,100 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 70 states. [2020-07-10 15:06:00,100 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 70 states. [2020-07-10 15:06:00,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:00,105 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2020-07-10 15:06:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2020-07-10 15:06:00,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:00,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:00,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:00,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 15:06:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-07-10 15:06:00,110 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 37 [2020-07-10 15:06:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:00,111 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-07-10 15:06:00,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:06:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-07-10 15:06:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 15:06:00,113 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:00,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:00,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:06:00,114 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:00,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:00,114 INFO L82 PathProgramCache]: Analyzing trace with hash -759518161, now seen corresponding path program 1 times [2020-07-10 15:06:00,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:00,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343446204] [2020-07-10 15:06:00,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:00,199 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; {849#true} is VALID [2020-07-10 15:06:00,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,200 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {849#true} {849#true} #113#return; {849#true} is VALID [2020-07-10 15:06:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:00,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {849#true} is VALID [2020-07-10 15:06:00,316 INFO L280 TraceCheckUtils]: 1: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,316 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {849#true} {849#true} #111#return; {849#true} is VALID [2020-07-10 15:06:00,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {921#(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); {849#true} is VALID [2020-07-10 15:06:00,318 INFO L263 TraceCheckUtils]: 1: Hoare triple {849#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:06:00,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {849#true} is VALID [2020-07-10 15:06:00,319 INFO L280 TraceCheckUtils]: 3: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,319 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {849#true} {849#true} #111#return; {849#true} is VALID [2020-07-10 15:06:00,319 INFO L280 TraceCheckUtils]: 5: Hoare triple {849#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {849#true} is VALID [2020-07-10 15:06:00,319 INFO L280 TraceCheckUtils]: 6: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,320 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {849#true} {849#true} #93#return; {849#true} is VALID [2020-07-10 15:06:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:00,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {849#true} is VALID [2020-07-10 15:06:00,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,330 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {849#true} {849#true} #111#return; {849#true} is VALID [2020-07-10 15:06:00,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {921#(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); {849#true} is VALID [2020-07-10 15:06:00,332 INFO L263 TraceCheckUtils]: 1: Hoare triple {849#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:06:00,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {849#true} is VALID [2020-07-10 15:06:00,333 INFO L280 TraceCheckUtils]: 3: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,333 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {849#true} {849#true} #111#return; {849#true} is VALID [2020-07-10 15:06:00,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {849#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {849#true} is VALID [2020-07-10 15:06:00,334 INFO L280 TraceCheckUtils]: 6: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,334 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {849#true} {849#true} #95#return; {849#true} is VALID [2020-07-10 15:06:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:00,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {921#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {849#true} is VALID [2020-07-10 15:06:00,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {849#true} assume 0 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {849#true} is VALID [2020-07-10 15:06:00,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,340 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {849#true} {849#true} #97#return; {849#true} is VALID [2020-07-10 15:06:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:00,358 INFO L280 TraceCheckUtils]: 0: Hoare triple {929#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {849#true} is VALID [2020-07-10 15:06:00,359 INFO L280 TraceCheckUtils]: 1: Hoare triple {849#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; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} assume true; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,360 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {894#(= 1 ~freed_tmp_slot~0)} {849#true} #103#return; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,361 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; {849#true} is VALID [2020-07-10 15:06:00,362 INFO L263 TraceCheckUtils]: 1: Hoare triple {849#true} call #t~ret5.base, #t~ret5.offset := kzalloc(8, 1); {921#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:06:00,362 INFO L280 TraceCheckUtils]: 2: Hoare triple {921#(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); {849#true} is VALID [2020-07-10 15:06:00,364 INFO L263 TraceCheckUtils]: 3: Hoare triple {849#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:06:00,364 INFO L280 TraceCheckUtils]: 4: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {849#true} is VALID [2020-07-10 15:06:00,364 INFO L280 TraceCheckUtils]: 5: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,364 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {849#true} {849#true} #111#return; {849#true} is VALID [2020-07-10 15:06:00,365 INFO L280 TraceCheckUtils]: 7: Hoare triple {849#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {849#true} is VALID [2020-07-10 15:06:00,365 INFO L280 TraceCheckUtils]: 8: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,365 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {849#true} {849#true} #93#return; {849#true} is VALID [2020-07-10 15:06:00,366 INFO L280 TraceCheckUtils]: 10: Hoare triple {849#true} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {849#true} is VALID [2020-07-10 15:06:00,366 INFO L280 TraceCheckUtils]: 11: Hoare triple {849#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); {849#true} is VALID [2020-07-10 15:06:00,367 INFO L263 TraceCheckUtils]: 12: Hoare triple {849#true} call #t~ret6.base, #t~ret6.offset := kzalloc(16, 1); {921#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:06:00,367 INFO L280 TraceCheckUtils]: 13: Hoare triple {921#(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); {849#true} is VALID [2020-07-10 15:06:00,369 INFO L263 TraceCheckUtils]: 14: Hoare triple {849#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:06:00,369 INFO L280 TraceCheckUtils]: 15: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {849#true} is VALID [2020-07-10 15:06:00,369 INFO L280 TraceCheckUtils]: 16: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,369 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {849#true} {849#true} #111#return; {849#true} is VALID [2020-07-10 15:06:00,370 INFO L280 TraceCheckUtils]: 18: Hoare triple {849#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {849#true} is VALID [2020-07-10 15:06:00,370 INFO L280 TraceCheckUtils]: 19: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,370 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {849#true} {849#true} #95#return; {849#true} is VALID [2020-07-10 15:06:00,370 INFO L280 TraceCheckUtils]: 21: Hoare triple {849#true} ~tmp_slot~0.base, ~tmp_slot~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {849#true} is VALID [2020-07-10 15:06:00,371 INFO L280 TraceCheckUtils]: 22: Hoare triple {849#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); {849#true} is VALID [2020-07-10 15:06:00,372 INFO L263 TraceCheckUtils]: 23: Hoare triple {849#true} call #t~ret7.base, #t~ret7.offset := ibmphp_find_same_bus_num(); {921#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:06:00,372 INFO L280 TraceCheckUtils]: 24: Hoare triple {921#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {849#true} is VALID [2020-07-10 15:06:00,372 INFO L280 TraceCheckUtils]: 25: Hoare triple {849#true} assume 0 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {849#true} is VALID [2020-07-10 15:06:00,372 INFO L280 TraceCheckUtils]: 26: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,373 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {849#true} {849#true} #97#return; {849#true} is VALID [2020-07-10 15:06:00,373 INFO L280 TraceCheckUtils]: 28: Hoare triple {849#true} ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {849#true} is VALID [2020-07-10 15:06:00,373 INFO L280 TraceCheckUtils]: 29: Hoare triple {849#true} assume ~bus_info_ptr1~0.base == 0 && ~bus_info_ptr1~0.offset == 0;~rc~0 := -3; {849#true} is VALID [2020-07-10 15:06:00,373 INFO L280 TraceCheckUtils]: 30: Hoare triple {849#true} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset, 4); {849#true} is VALID [2020-07-10 15:06:00,374 INFO L263 TraceCheckUtils]: 31: Hoare triple {849#true} call kfree(#t~mem10.base, #t~mem10.offset); {929#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} is VALID [2020-07-10 15:06:00,375 INFO L280 TraceCheckUtils]: 32: Hoare triple {929#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {849#true} is VALID [2020-07-10 15:06:00,375 INFO L280 TraceCheckUtils]: 33: Hoare triple {849#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; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,376 INFO L280 TraceCheckUtils]: 34: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} assume true; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,377 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {894#(= 1 ~freed_tmp_slot~0)} {849#true} #103#return; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,377 INFO L280 TraceCheckUtils]: 36: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} havoc #t~mem10.base, #t~mem10.offset; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,378 INFO L280 TraceCheckUtils]: 37: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} #res := ~rc~0; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,379 INFO L280 TraceCheckUtils]: 38: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} assume true; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,379 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {894#(= 1 ~freed_tmp_slot~0)} {849#true} #105#return; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,383 INFO L263 TraceCheckUtils]: 0: Hoare triple {849#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:06:00,383 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; {849#true} is VALID [2020-07-10 15:06:00,383 INFO L280 TraceCheckUtils]: 2: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,384 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {849#true} {849#true} #113#return; {849#true} is VALID [2020-07-10 15:06:00,384 INFO L263 TraceCheckUtils]: 4: Hoare triple {849#true} call #t~ret12 := main(); {849#true} is VALID [2020-07-10 15:06:00,385 INFO L263 TraceCheckUtils]: 5: Hoare triple {849#true} call #t~ret11 := 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:06:00,386 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; {849#true} is VALID [2020-07-10 15:06:00,387 INFO L263 TraceCheckUtils]: 7: Hoare triple {849#true} call #t~ret5.base, #t~ret5.offset := kzalloc(8, 1); {921#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:06:00,387 INFO L280 TraceCheckUtils]: 8: Hoare triple {921#(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); {849#true} is VALID [2020-07-10 15:06:00,388 INFO L263 TraceCheckUtils]: 9: Hoare triple {849#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:06:00,388 INFO L280 TraceCheckUtils]: 10: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {849#true} is VALID [2020-07-10 15:06:00,389 INFO L280 TraceCheckUtils]: 11: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,389 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {849#true} {849#true} #111#return; {849#true} is VALID [2020-07-10 15:06:00,389 INFO L280 TraceCheckUtils]: 13: Hoare triple {849#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {849#true} is VALID [2020-07-10 15:06:00,389 INFO L280 TraceCheckUtils]: 14: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,390 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {849#true} {849#true} #93#return; {849#true} is VALID [2020-07-10 15:06:00,390 INFO L280 TraceCheckUtils]: 16: Hoare triple {849#true} ~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset := #t~ret5.base, #t~ret5.offset;havoc #t~ret5.base, #t~ret5.offset; {849#true} is VALID [2020-07-10 15:06:00,390 INFO L280 TraceCheckUtils]: 17: Hoare triple {849#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); {849#true} is VALID [2020-07-10 15:06:00,391 INFO L263 TraceCheckUtils]: 18: Hoare triple {849#true} call #t~ret6.base, #t~ret6.offset := kzalloc(16, 1); {921#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:06:00,392 INFO L280 TraceCheckUtils]: 19: Hoare triple {921#(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); {849#true} is VALID [2020-07-10 15:06:00,393 INFO L263 TraceCheckUtils]: 20: Hoare triple {849#true} call #Ultimate.meminit(#t~malloc0.base, #t~malloc0.offset, 1, ~size, ~size); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:06:00,393 INFO L280 TraceCheckUtils]: 21: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {849#true} is VALID [2020-07-10 15:06:00,393 INFO L280 TraceCheckUtils]: 22: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,394 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {849#true} {849#true} #111#return; {849#true} is VALID [2020-07-10 15:06:00,394 INFO L280 TraceCheckUtils]: 24: Hoare triple {849#true} #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset; {849#true} is VALID [2020-07-10 15:06:00,394 INFO L280 TraceCheckUtils]: 25: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,394 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {849#true} {849#true} #95#return; {849#true} is VALID [2020-07-10 15:06:00,395 INFO L280 TraceCheckUtils]: 27: Hoare triple {849#true} ~tmp_slot~0.base, ~tmp_slot~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {849#true} is VALID [2020-07-10 15:06:00,395 INFO L280 TraceCheckUtils]: 28: Hoare triple {849#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); {849#true} is VALID [2020-07-10 15:06:00,396 INFO L263 TraceCheckUtils]: 29: Hoare triple {849#true} call #t~ret7.base, #t~ret7.offset := ibmphp_find_same_bus_num(); {921#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:06:00,396 INFO L280 TraceCheckUtils]: 30: Hoare triple {921#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {849#true} is VALID [2020-07-10 15:06:00,396 INFO L280 TraceCheckUtils]: 31: Hoare triple {849#true} assume 0 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {849#true} is VALID [2020-07-10 15:06:00,396 INFO L280 TraceCheckUtils]: 32: Hoare triple {849#true} assume true; {849#true} is VALID [2020-07-10 15:06:00,397 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {849#true} {849#true} #97#return; {849#true} is VALID [2020-07-10 15:06:00,397 INFO L280 TraceCheckUtils]: 34: Hoare triple {849#true} ~bus_info_ptr1~0.base, ~bus_info_ptr1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {849#true} is VALID [2020-07-10 15:06:00,397 INFO L280 TraceCheckUtils]: 35: Hoare triple {849#true} assume ~bus_info_ptr1~0.base == 0 && ~bus_info_ptr1~0.offset == 0;~rc~0 := -3; {849#true} is VALID [2020-07-10 15:06:00,398 INFO L280 TraceCheckUtils]: 36: Hoare triple {849#true} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~hp_slot_ptr~0.base, ~hp_slot_ptr~0.offset, 4); {849#true} is VALID [2020-07-10 15:06:00,399 INFO L263 TraceCheckUtils]: 37: Hoare triple {849#true} call kfree(#t~mem10.base, #t~mem10.offset); {929#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} is VALID [2020-07-10 15:06:00,399 INFO L280 TraceCheckUtils]: 38: Hoare triple {929#(= ~freed_tmp_slot~0 |old(~freed_tmp_slot~0)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {849#true} is VALID [2020-07-10 15:06:00,400 INFO L280 TraceCheckUtils]: 39: Hoare triple {849#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; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,400 INFO L280 TraceCheckUtils]: 40: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} assume true; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,402 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {894#(= 1 ~freed_tmp_slot~0)} {849#true} #103#return; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,402 INFO L280 TraceCheckUtils]: 42: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} havoc #t~mem10.base, #t~mem10.offset; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,403 INFO L280 TraceCheckUtils]: 43: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} #res := ~rc~0; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,404 INFO L280 TraceCheckUtils]: 44: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} assume true; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,404 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {894#(= 1 ~freed_tmp_slot~0)} {849#true} #105#return; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,405 INFO L280 TraceCheckUtils]: 46: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;havoc #t~ret11; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,406 INFO L280 TraceCheckUtils]: 47: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} assume 0 == ~used_tmp_slot~0; {894#(= 1 ~freed_tmp_slot~0)} is VALID [2020-07-10 15:06:00,406 INFO L280 TraceCheckUtils]: 48: Hoare triple {894#(= 1 ~freed_tmp_slot~0)} assume !(0 != ~freed_tmp_slot~0); {850#false} is VALID [2020-07-10 15:06:00,406 INFO L263 TraceCheckUtils]: 49: Hoare triple {850#false} call __blast_assert(); {850#false} is VALID [2020-07-10 15:06:00,407 INFO L280 TraceCheckUtils]: 50: Hoare triple {850#false} assume !false; {850#false} is VALID [2020-07-10 15:06:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-10 15:06:00,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343446204] [2020-07-10 15:06:00,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:00,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:06:00,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862254489] [2020-07-10 15:06:00,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-10 15:06:00,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:00,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:06:00,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:00,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:06:00,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:06:00,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:06:00,463 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 8 states. [2020-07-10 15:06:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:01,583 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2020-07-10 15:06:01,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:06:01,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-10 15:06:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:06:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2020-07-10 15:06:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:06:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2020-07-10 15:06:01,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 84 transitions. [2020-07-10 15:06:01,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:01,738 INFO L225 Difference]: With dead ends: 80 [2020-07-10 15:06:01,738 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 15:06:01,739 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:06:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 15:06:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-07-10 15:06:01,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:01,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2020-07-10 15:06:01,832 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2020-07-10 15:06:01,832 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2020-07-10 15:06:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:01,836 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-10 15:06:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-10 15:06:01,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:01,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:01,838 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2020-07-10 15:06:01,838 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2020-07-10 15:06:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:01,843 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-10 15:06:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-10 15:06:01,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:01,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:01,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:01,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 15:06:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2020-07-10 15:06:01,848 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 51 [2020-07-10 15:06:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:01,848 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2020-07-10 15:06:01,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:06:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-07-10 15:06:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 15:06:01,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:01,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:01,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:06:01,851 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash -501352723, now seen corresponding path program 1 times [2020-07-10 15:06:01,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:01,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50694530] [2020-07-10 15:06:01,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:06:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:06:01,936 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:06:01,936 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:06:01,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:06:02,003 WARN L170 areAnnotationChecker]: ibmphp_find_same_bus_numENTRY has no Hoare annotation [2020-07-10 15:06:02,003 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:06:02,003 WARN L170 areAnnotationChecker]: kfreeENTRY has no Hoare annotation [2020-07-10 15:06:02,003 WARN L170 areAnnotationChecker]: kzallocENTRY has no Hoare annotation [2020-07-10 15:06:02,004 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:06:02,004 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:06:02,004 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2020-07-10 15:06:02,004 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2020-07-10 15:06:02,004 WARN L170 areAnnotationChecker]: ibmphp_init_devnoENTRY has no Hoare annotation [2020-07-10 15:06:02,004 WARN L170 areAnnotationChecker]: ebda_rsrc_controllerENTRY has no Hoare annotation [2020-07-10 15:06:02,004 WARN L170 areAnnotationChecker]: fillslotinfoENTRY has no Hoare annotation [2020-07-10 15:06:02,004 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:06:02,005 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:06:02,005 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2020-07-10 15:06:02,005 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-10 15:06:02,005 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-10 15:06:02,005 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:02,005 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:06:02,005 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:06:02,005 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 15:06:02,005 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 15:06:02,006 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:06:02,006 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:06:02,006 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2020-07-10 15:06:02,006 WARN L170 areAnnotationChecker]: ibmphp_init_devnoFINAL has no Hoare annotation [2020-07-10 15:06:02,006 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-10 15:06:02,006 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-10 15:06:02,006 WARN L170 areAnnotationChecker]: fillslotinfoFINAL has no Hoare annotation [2020-07-10 15:06:02,006 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2020-07-10 15:06:02,007 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-10 15:06:02,007 WARN L170 areAnnotationChecker]: ibmphp_find_same_bus_numFINAL has no Hoare annotation [2020-07-10 15:06:02,007 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-10 15:06:02,007 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-10 15:06:02,007 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:06:02,007 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-10 15:06:02,007 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 15:06:02,007 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:02,007 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2020-07-10 15:06:02,008 WARN L170 areAnnotationChecker]: ibmphp_init_devnoEXIT has no Hoare annotation [2020-07-10 15:06:02,008 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-10 15:06:02,008 WARN L170 areAnnotationChecker]: fillslotinfoEXIT has no Hoare annotation [2020-07-10 15:06:02,008 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2020-07-10 15:06:02,008 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2020-07-10 15:06:02,008 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-10 15:06:02,008 WARN L170 areAnnotationChecker]: ibmphp_find_same_bus_numEXIT has no Hoare annotation [2020-07-10 15:06:02,008 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-10 15:06:02,009 WARN L170 areAnnotationChecker]: kfreeEXIT has no Hoare annotation [2020-07-10 15:06:02,009 WARN L170 areAnnotationChecker]: kzallocFINAL has no Hoare annotation [2020-07-10 15:06:02,009 WARN L170 areAnnotationChecker]: L137-1 has no Hoare annotation [2020-07-10 15:06:02,009 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2020-07-10 15:06:02,009 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-10 15:06:02,009 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-10 15:06:02,009 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2020-07-10 15:06:02,009 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2020-07-10 15:06:02,010 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2020-07-10 15:06:02,010 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2020-07-10 15:06:02,010 WARN L170 areAnnotationChecker]: L127-1 has no Hoare annotation [2020-07-10 15:06:02,010 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2020-07-10 15:06:02,010 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2020-07-10 15:06:02,010 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2020-07-10 15:06:02,010 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:06:02,010 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2020-07-10 15:06:02,011 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2020-07-10 15:06:02,011 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2020-07-10 15:06:02,011 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 15:06:02,011 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 15:06:02,011 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2020-07-10 15:06:02,011 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2020-07-10 15:06:02,011 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2020-07-10 15:06:02,011 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2020-07-10 15:06:02,011 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-10 15:06:02,012 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-10 15:06:02,012 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-10 15:06:02,012 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-10 15:06:02,012 WARN L170 areAnnotationChecker]: ebda_rsrc_controllerFINAL has no Hoare annotation [2020-07-10 15:06:02,012 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2020-07-10 15:06:02,012 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2020-07-10 15:06:02,012 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-10 15:06:02,012 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-10 15:06:02,013 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-10 15:06:02,013 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-10 15:06:02,013 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2020-07-10 15:06:02,013 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2020-07-10 15:06:02,013 WARN L170 areAnnotationChecker]: ebda_rsrc_controllerEXIT has no Hoare annotation [2020-07-10 15:06:02,013 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-10 15:06:02,013 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-10 15:06:02,013 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:06:02,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:06:02 BoogieIcfgContainer [2020-07-10 15:06:02,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:06:02,020 INFO L168 Benchmark]: Toolchain (without parser) took 8164.87 ms. Allocated memory was 136.8 MB in the beginning and 329.3 MB in the end (delta: 192.4 MB). Free memory was 100.7 MB in the beginning and 138.1 MB in the end (delta: -37.4 MB). Peak memory consumption was 155.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:02,021 INFO L168 Benchmark]: CDTParser took 1.55 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:06:02,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.51 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 100.5 MB in the beginning and 177.7 MB in the end (delta: -77.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:02,022 INFO L168 Benchmark]: Boogie Preprocessor took 110.43 ms. Allocated memory is still 199.8 MB. Free memory was 177.7 MB in the beginning and 175.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:02,023 INFO L168 Benchmark]: RCFGBuilder took 741.75 ms. Allocated memory is still 199.8 MB. Free memory was 175.0 MB in the beginning and 138.3 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:02,024 INFO L168 Benchmark]: TraceAbstraction took 6823.90 ms. Allocated memory was 199.8 MB in the beginning and 329.3 MB in the end (delta: 129.5 MB). Free memory was 137.6 MB in the beginning and 138.1 MB in the end (delta: -473.5 kB). Peak memory consumption was 129.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:02,028 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 1.55 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 479.51 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 100.5 MB in the beginning and 177.7 MB in the end (delta: -77.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.43 ms. Allocated memory is still 199.8 MB. Free memory was 177.7 MB in the beginning and 175.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 741.75 ms. Allocated memory is still 199.8 MB. Free memory was 175.0 MB in the beginning and 138.3 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6823.90 ms. Allocated memory was 199.8 MB in the beginning and 329.3 MB in the end (delta: 129.5 MB). Free memory was 137.6 MB in the beginning and 138.1 MB in the end (delta: -473.5 kB). Peak memory consumption was 129.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] struct slot *tmp_slot; [L41] int used_tmp_slot = 0; [L42] int freed_tmp_slot = 1; VAL [\old(freed_tmp_slot)=26, \old(tmp_slot)=19, \old(tmp_slot)=22, \old(used_tmp_slot)=23, freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L136] CALL ebda_rsrc_controller() VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L73] struct hotplug_slot *hp_slot_ptr; [L75] struct bus_info *bus_info_ptr1; [L76] int rc; VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L78] CALL, EXPR kzalloc(sizeof(*hp_slot_ptr), 1) VAL [\old(flags)=1, \old(freed_tmp_slot)=1, \old(size)=8, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L47] EXPR, FCALL calloc(1, size) VAL [\old(flags)=1, \old(freed_tmp_slot)=1, \old(size)=8, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, calloc(1, size)={-1:0}, flags=1, freed_tmp_slot=1, size=8, tmp_slot={0:0}, used_tmp_slot=0] [L47] return calloc(1, size); VAL [\old(flags)=1, \old(freed_tmp_slot)=1, \old(size)=8, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, \result={-1:0}, calloc(1, size)={-1:0}, flags=1, freed_tmp_slot=1, size=8, tmp_slot={0:0}, used_tmp_slot=0] [L78] RET, EXPR kzalloc(sizeof(*hp_slot_ptr), 1) VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=1, kzalloc(sizeof(*hp_slot_ptr), 1)={-1:0}, tmp_slot={0:0}, used_tmp_slot=0] [L78] hp_slot_ptr = kzalloc(sizeof(*hp_slot_ptr), 1) [L79] COND FALSE !(!hp_slot_ptr) [L83] hp_slot_ptr->b = 5 VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=1, hp_slot_ptr={-1:0}, tmp_slot={0:0}, used_tmp_slot=0] [L85] CALL, EXPR kzalloc(sizeof(*tmp_slot), 1) VAL [\old(flags)=1, \old(freed_tmp_slot)=1, \old(size)=16, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L47] EXPR, FCALL calloc(1, size) VAL [\old(flags)=1, \old(freed_tmp_slot)=1, \old(size)=16, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, calloc(1, size)={-2:0}, flags=1, freed_tmp_slot=1, size=16, tmp_slot={0:0}, used_tmp_slot=0] [L47] return calloc(1, size); VAL [\old(flags)=1, \old(freed_tmp_slot)=1, \old(size)=16, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, \result={-2:0}, calloc(1, size)={-2:0}, flags=1, freed_tmp_slot=1, size=16, tmp_slot={0:0}, used_tmp_slot=0] [L85] RET, EXPR kzalloc(sizeof(*tmp_slot), 1) VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=1, hp_slot_ptr={-1:0}, kzalloc(sizeof(*tmp_slot), 1)={-2:0}, tmp_slot={0:0}, used_tmp_slot=0] [L85] tmp_slot = kzalloc(sizeof(*tmp_slot), 1) [L87] COND FALSE !(!tmp_slot) [L92] used_tmp_slot = 0 [L93] freed_tmp_slot = 0 [L95] tmp_slot->a = 2 [L96] tmp_slot->b = 3 VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L98] CALL, EXPR ibmphp_find_same_bus_num() VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L56] COND TRUE __VERIFIER_nondet_int() [L57] return 0; VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, \result={0:0}, freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L98] RET, EXPR ibmphp_find_same_bus_num() VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=0, hp_slot_ptr={-1:0}, ibmphp_find_same_bus_num()={0:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L98] bus_info_ptr1 = ibmphp_find_same_bus_num() [L99] COND TRUE !bus_info_ptr1 [L100] rc = -3 VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, rc=-3, tmp_slot={-2:0}, used_tmp_slot=0] [L127] EXPR hp_slot_ptr->private VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, hp_slot_ptr->private={0:0}, rc=-3, tmp_slot={-2:0}, used_tmp_slot=0] [L127] CALL kfree(hp_slot_ptr->private) VAL [\old(freed_tmp_slot)=0, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=0, p={0:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L50] COND FALSE !(p!=0 && p==tmp_slot) VAL [\old(freed_tmp_slot)=0, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=0, p={0:0}, p={0:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L127] RET kfree(hp_slot_ptr->private) VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, hp_slot_ptr->private={0:0}, rc=-3, tmp_slot={-2:0}, used_tmp_slot=0] [L132] return rc; VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, \result=-3, bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, rc=-3, tmp_slot={-2:0}, used_tmp_slot=0] [L136] RET ebda_rsrc_controller() VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, ebda_rsrc_controller()=-3, freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L137] COND TRUE !used_tmp_slot VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L138] (freed_tmp_slot) ? (0) : __blast_assert () VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L138] CALL __blast_assert () VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L7] __VERIFIER_error() VAL [\old(freed_tmp_slot)=1, \old(tmp_slot)=0, \old(tmp_slot)=0, \old(used_tmp_slot)=0, freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.6s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 174 SDtfs, 197 SDslu, 445 SDs, 0 SdLazy, 525 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s 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, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 15684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...