java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:57,520 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:57,523 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:57,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:57,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:57,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:57,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:57,544 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:57,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:57,548 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:57,548 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:57,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:57,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:57,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:57,552 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:57,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:57,553 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:57,555 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:57,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:57,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:57,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:57,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:57,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:57,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:57,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:57,565 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:57,566 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:57,567 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:57,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:57,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:57,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:57,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:57,570 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:57,570 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:57,571 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:57,572 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:57,573 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:53:57,590 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:57,590 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:57,591 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:57,591 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:57,592 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:57,592 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:57,592 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:57,592 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:57,593 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:57,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:57,593 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:57,593 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:57,593 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:57,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:57,594 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:57,594 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:57,594 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:57,594 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:57,594 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:57,595 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:57,595 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:57,595 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:57,595 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:57,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:57,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:57,596 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:57,596 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:57,596 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:57,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:57,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:57,597 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:57,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:57,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:57,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:57,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:57,663 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:57,664 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-11-23 12:53:57,725 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8332c6e0/eac0d2aed41c4d3f8dd31ec79d76e067/FLAGc368e7236 [2018-11-23 12:53:58,233 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:58,234 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-11-23 12:53:58,247 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8332c6e0/eac0d2aed41c4d3f8dd31ec79d76e067/FLAGc368e7236 [2018-11-23 12:53:58,523 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8332c6e0/eac0d2aed41c4d3f8dd31ec79d76e067 [2018-11-23 12:53:58,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:58,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:58,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:58,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:58,542 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:58,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:58" (1/1) ... [2018-11-23 12:53:58,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bfcd775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:58, skipping insertion in model container [2018-11-23 12:53:58,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:58" (1/1) ... [2018-11-23 12:53:58,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:58,618 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:59,027 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:59,033 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:59,108 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:59,188 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:59,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59 WrapperNode [2018-11-23 12:53:59,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:59,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:59,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:59,191 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:59,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (1/1) ... [2018-11-23 12:53:59,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (1/1) ... [2018-11-23 12:53:59,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:59,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:59,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:59,331 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:59,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (1/1) ... [2018-11-23 12:53:59,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (1/1) ... [2018-11-23 12:53:59,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (1/1) ... [2018-11-23 12:53:59,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (1/1) ... [2018-11-23 12:53:59,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (1/1) ... [2018-11-23 12:53:59,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (1/1) ... [2018-11-23 12:53:59,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (1/1) ... [2018-11-23 12:53:59,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:59,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:59,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:59,386 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:59,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (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 [2018-11-23 12:53:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2018-11-23 12:53:59,459 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2018-11-23 12:53:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:59,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:59,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-11-23 12:53:59,460 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-11-23 12:53:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:53:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-23 12:53:59,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-23 12:53:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-11-23 12:53:59,461 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2018-11-23 12:53:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2018-11-23 12:53:59,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2018-11-23 12:53:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:59,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:00,330 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:00,330 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:54:00,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:00 BoogieIcfgContainer [2018-11-23 12:54:00,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:00,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:00,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:00,336 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:00,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:58" (1/3) ... [2018-11-23 12:54:00,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c89e385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:00, skipping insertion in model container [2018-11-23 12:54:00,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:59" (2/3) ... [2018-11-23 12:54:00,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c89e385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:00, skipping insertion in model container [2018-11-23 12:54:00,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:00" (3/3) ... [2018-11-23 12:54:00,340 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2_true-termination.c_true-unreach-call.i [2018-11-23 12:54:00,351 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:00,361 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:00,381 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:00,415 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:00,416 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:00,417 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:00,417 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:00,417 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:00,417 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:00,418 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:00,418 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:00,418 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-23 12:54:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:54:00,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:00,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:00,451 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:00,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash 713355486, now seen corresponding path program 1 times [2018-11-23 12:54:00,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:00,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:00,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:00,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:00,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:00,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {50#true} is VALID [2018-11-23 12:54:00,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {50#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {50#true} is VALID [2018-11-23 12:54:00,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {50#true} assume true; {50#true} is VALID [2018-11-23 12:54:00,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50#true} {50#true} #72#return; {50#true} is VALID [2018-11-23 12:54:00,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {50#true} call #t~ret34 := main(); {50#true} is VALID [2018-11-23 12:54:00,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {50#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {50#true} is VALID [2018-11-23 12:54:00,982 INFO L256 TraceCheckUtils]: 6: Hoare triple {50#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {52#(= 8 |my_malloc_#in~size|)} is VALID [2018-11-23 12:54:00,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {52#(= 8 |my_malloc_#in~size|)} ~size := #in~size; {53#(= 8 my_malloc_~size)} is VALID [2018-11-23 12:54:00,988 INFO L256 TraceCheckUtils]: 8: Hoare triple {53#(= 8 my_malloc_~size)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {54#(= 8 |__getMemory_#in~size|)} is VALID [2018-11-23 12:54:00,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {54#(= 8 |__getMemory_#in~size|)} ~size := #in~size; {55#(= __getMemory_~size 8)} is VALID [2018-11-23 12:54:00,989 INFO L273 TraceCheckUtils]: 10: Hoare triple {55#(= __getMemory_~size 8)} assume !(~size > 0); {51#false} is VALID [2018-11-23 12:54:00,990 INFO L256 TraceCheckUtils]: 11: Hoare triple {51#false} call __blast_assert(); {51#false} is VALID [2018-11-23 12:54:00,990 INFO L273 TraceCheckUtils]: 12: Hoare triple {51#false} assume !false; {51#false} is VALID [2018-11-23 12:54:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:00,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:00,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:54:01,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 12:54:01,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:01,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:54:01,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:01,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:54:01,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:54:01,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:54:01,080 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 6 states. [2018-11-23 12:54:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:02,208 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-11-23 12:54:02,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:54:02,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 12:54:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2018-11-23 12:54:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2018-11-23 12:54:02,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 107 transitions. [2018-11-23 12:54:02,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:02,552 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:54:02,552 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:54:02,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:54:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 12:54:02,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:02,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 12:54:02,626 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:54:02,626 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:54:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:02,633 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 12:54:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 12:54:02,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:02,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:02,635 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:54:02,635 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:54:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:02,641 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 12:54:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 12:54:02,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:02,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:02,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:02,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:54:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-23 12:54:02,649 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2018-11-23 12:54:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:02,650 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 12:54:02,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:54:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 12:54:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:54:02,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:02,652 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:02,652 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:02,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1315059296, now seen corresponding path program 1 times [2018-11-23 12:54:02,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:02,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:02,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:02,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:02,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:02,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {310#true} is VALID [2018-11-23 12:54:02,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {310#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {310#true} is VALID [2018-11-23 12:54:02,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2018-11-23 12:54:02,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #72#return; {310#true} is VALID [2018-11-23 12:54:02,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret34 := main(); {310#true} is VALID [2018-11-23 12:54:02,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {310#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {310#true} is VALID [2018-11-23 12:54:02,996 INFO L256 TraceCheckUtils]: 6: Hoare triple {310#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {310#true} is VALID [2018-11-23 12:54:02,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {310#true} ~size := #in~size; {310#true} is VALID [2018-11-23 12:54:02,997 INFO L256 TraceCheckUtils]: 8: Hoare triple {310#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {310#true} is VALID [2018-11-23 12:54:02,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {310#true} ~size := #in~size; {310#true} is VALID [2018-11-23 12:54:02,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {310#true} assume ~size > 0; {310#true} is VALID [2018-11-23 12:54:02,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {310#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {310#true} is VALID [2018-11-23 12:54:02,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {310#true} assume 0 == #t~nondet29;havoc #t~nondet29;#res.base, #res.offset := 0, 0; {310#true} is VALID [2018-11-23 12:54:02,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {310#true} assume true; {310#true} is VALID [2018-11-23 12:54:02,999 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {310#true} {310#true} #68#return; {310#true} is VALID [2018-11-23 12:54:03,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {310#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {310#true} is VALID [2018-11-23 12:54:03,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {310#true} assume true; {310#true} is VALID [2018-11-23 12:54:03,000 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {310#true} {310#true} #76#return; {310#true} is VALID [2018-11-23 12:54:03,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {310#true} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {310#true} is VALID [2018-11-23 12:54:03,001 INFO L256 TraceCheckUtils]: 19: Hoare triple {310#true} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {310#true} is VALID [2018-11-23 12:54:03,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {310#true} ~size := #in~size; {310#true} is VALID [2018-11-23 12:54:03,002 INFO L256 TraceCheckUtils]: 21: Hoare triple {310#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {310#true} is VALID [2018-11-23 12:54:03,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {310#true} ~size := #in~size; {310#true} is VALID [2018-11-23 12:54:03,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {310#true} assume ~size > 0; {310#true} is VALID [2018-11-23 12:54:03,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {310#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {310#true} is VALID [2018-11-23 12:54:03,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {310#true} assume 0 == #t~nondet29;havoc #t~nondet29;#res.base, #res.offset := 0, 0; {312#(and (= 0 |__getMemory_#res.base|) (= 0 |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:03,033 INFO L273 TraceCheckUtils]: 26: Hoare triple {312#(and (= 0 |__getMemory_#res.base|) (= 0 |__getMemory_#res.offset|))} assume true; {312#(and (= 0 |__getMemory_#res.base|) (= 0 |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:03,034 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {312#(and (= 0 |__getMemory_#res.base|) (= 0 |__getMemory_#res.offset|))} {310#true} #68#return; {313#(and (= 0 |my_malloc_#t~ret30.offset|) (= 0 |my_malloc_#t~ret30.base|))} is VALID [2018-11-23 12:54:03,036 INFO L273 TraceCheckUtils]: 28: Hoare triple {313#(and (= 0 |my_malloc_#t~ret30.offset|) (= 0 |my_malloc_#t~ret30.base|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {314#(and (= 0 |my_malloc_#res.offset|) (= 0 |my_malloc_#res.base|))} is VALID [2018-11-23 12:54:03,036 INFO L273 TraceCheckUtils]: 29: Hoare triple {314#(and (= 0 |my_malloc_#res.offset|) (= 0 |my_malloc_#res.base|))} assume true; {314#(and (= 0 |my_malloc_#res.offset|) (= 0 |my_malloc_#res.base|))} is VALID [2018-11-23 12:54:03,037 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {314#(and (= 0 |my_malloc_#res.offset|) (= 0 |my_malloc_#res.base|))} {310#true} #78#return; {315#(and (= 0 |main_#t~ret33.base|) (= 0 |main_#t~ret33.offset|))} is VALID [2018-11-23 12:54:03,039 INFO L273 TraceCheckUtils]: 31: Hoare triple {315#(and (= 0 |main_#t~ret33.base|) (= 0 |main_#t~ret33.offset|))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {316#(and (= main_~dev2~0.base 0) (= 0 main_~dev2~0.offset))} is VALID [2018-11-23 12:54:03,040 INFO L273 TraceCheckUtils]: 32: Hoare triple {316#(and (= main_~dev2~0.base 0) (= 0 main_~dev2~0.offset))} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {311#false} is VALID [2018-11-23 12:54:03,040 INFO L256 TraceCheckUtils]: 33: Hoare triple {311#false} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {311#false} is VALID [2018-11-23 12:54:03,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {311#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {311#false} is VALID [2018-11-23 12:54:03,041 INFO L273 TraceCheckUtils]: 35: Hoare triple {311#false} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {311#false} is VALID [2018-11-23 12:54:03,042 INFO L256 TraceCheckUtils]: 36: Hoare triple {311#false} call __blast_assert(); {311#false} is VALID [2018-11-23 12:54:03,042 INFO L273 TraceCheckUtils]: 37: Hoare triple {311#false} assume !false; {311#false} is VALID [2018-11-23 12:54:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:54:03,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:03,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:54:03,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-23 12:54:03,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:03,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:54:03,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:03,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:54:03,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:54:03,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:03,134 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-11-23 12:54:03,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:03,533 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 12:54:03,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:54:03,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-23 12:54:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-23 12:54:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-23 12:54:03,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-23 12:54:03,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:03,683 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:54:03,684 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:54:03,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:54:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 12:54:03,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:03,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 12:54:03,722 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:54:03,723 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:54:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:03,727 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 12:54:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:54:03,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:03,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:03,729 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:54:03,729 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:54:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:03,734 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 12:54:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:54:03,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:03,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:03,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:03,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:54:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 12:54:03,740 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 38 [2018-11-23 12:54:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:03,740 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 12:54:03,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:54:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:54:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:54:03,742 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:03,742 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:03,743 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:03,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:03,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1021656289, now seen corresponding path program 1 times [2018-11-23 12:54:03,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:03,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:03,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:03,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:03,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:03,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {556#true} call ULTIMATE.init(); {556#true} is VALID [2018-11-23 12:54:03,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {556#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {556#true} is VALID [2018-11-23 12:54:03,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {556#true} assume true; {556#true} is VALID [2018-11-23 12:54:03,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} #72#return; {556#true} is VALID [2018-11-23 12:54:03,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {556#true} call #t~ret34 := main(); {556#true} is VALID [2018-11-23 12:54:03,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {556#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {556#true} is VALID [2018-11-23 12:54:03,935 INFO L256 TraceCheckUtils]: 6: Hoare triple {556#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {556#true} is VALID [2018-11-23 12:54:03,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {556#true} ~size := #in~size; {556#true} is VALID [2018-11-23 12:54:03,936 INFO L256 TraceCheckUtils]: 8: Hoare triple {556#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {556#true} is VALID [2018-11-23 12:54:03,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {556#true} ~size := #in~size; {556#true} is VALID [2018-11-23 12:54:03,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {556#true} assume ~size > 0; {556#true} is VALID [2018-11-23 12:54:03,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {556#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {556#true} is VALID [2018-11-23 12:54:03,939 INFO L273 TraceCheckUtils]: 12: Hoare triple {556#true} assume 0 == #t~nondet29;havoc #t~nondet29;#res.base, #res.offset := 0, 0; {558#(and (= 0 |__getMemory_#res.base|) (= 0 |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:03,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {558#(and (= 0 |__getMemory_#res.base|) (= 0 |__getMemory_#res.offset|))} assume true; {558#(and (= 0 |__getMemory_#res.base|) (= 0 |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:03,941 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {558#(and (= 0 |__getMemory_#res.base|) (= 0 |__getMemory_#res.offset|))} {556#true} #68#return; {559#(and (= 0 |my_malloc_#t~ret30.offset|) (= 0 |my_malloc_#t~ret30.base|))} is VALID [2018-11-23 12:54:03,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {559#(and (= 0 |my_malloc_#t~ret30.offset|) (= 0 |my_malloc_#t~ret30.base|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {560#(and (= 0 |my_malloc_#res.offset|) (= 0 |my_malloc_#res.base|))} is VALID [2018-11-23 12:54:03,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {560#(and (= 0 |my_malloc_#res.offset|) (= 0 |my_malloc_#res.base|))} assume true; {560#(and (= 0 |my_malloc_#res.offset|) (= 0 |my_malloc_#res.base|))} is VALID [2018-11-23 12:54:03,944 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {560#(and (= 0 |my_malloc_#res.offset|) (= 0 |my_malloc_#res.base|))} {556#true} #76#return; {561#(and (= 0 |main_#t~ret32.offset|) (= 0 |main_#t~ret32.base|))} is VALID [2018-11-23 12:54:03,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {561#(and (= 0 |main_#t~ret32.offset|) (= 0 |main_#t~ret32.base|))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {562#(and (= main_~dev1~0.base 0) (= 0 main_~dev1~0.offset))} is VALID [2018-11-23 12:54:03,945 INFO L256 TraceCheckUtils]: 19: Hoare triple {562#(and (= main_~dev1~0.base 0) (= 0 main_~dev1~0.offset))} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {556#true} is VALID [2018-11-23 12:54:03,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {556#true} ~size := #in~size; {556#true} is VALID [2018-11-23 12:54:03,946 INFO L256 TraceCheckUtils]: 21: Hoare triple {556#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {556#true} is VALID [2018-11-23 12:54:03,947 INFO L273 TraceCheckUtils]: 22: Hoare triple {556#true} ~size := #in~size; {556#true} is VALID [2018-11-23 12:54:03,947 INFO L273 TraceCheckUtils]: 23: Hoare triple {556#true} assume ~size > 0; {556#true} is VALID [2018-11-23 12:54:03,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {556#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {556#true} is VALID [2018-11-23 12:54:03,948 INFO L273 TraceCheckUtils]: 25: Hoare triple {556#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {556#true} is VALID [2018-11-23 12:54:03,948 INFO L273 TraceCheckUtils]: 26: Hoare triple {556#true} assume true; {556#true} is VALID [2018-11-23 12:54:03,949 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {556#true} {556#true} #68#return; {556#true} is VALID [2018-11-23 12:54:03,949 INFO L273 TraceCheckUtils]: 28: Hoare triple {556#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {556#true} is VALID [2018-11-23 12:54:03,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {556#true} assume true; {556#true} is VALID [2018-11-23 12:54:03,958 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {556#true} {562#(and (= main_~dev1~0.base 0) (= 0 main_~dev1~0.offset))} #78#return; {562#(and (= main_~dev1~0.base 0) (= 0 main_~dev1~0.offset))} is VALID [2018-11-23 12:54:03,960 INFO L273 TraceCheckUtils]: 31: Hoare triple {562#(and (= main_~dev1~0.base 0) (= 0 main_~dev1~0.offset))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {562#(and (= main_~dev1~0.base 0) (= 0 main_~dev1~0.offset))} is VALID [2018-11-23 12:54:03,960 INFO L273 TraceCheckUtils]: 32: Hoare triple {562#(and (= main_~dev1~0.base 0) (= 0 main_~dev1~0.offset))} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {557#false} is VALID [2018-11-23 12:54:03,961 INFO L256 TraceCheckUtils]: 33: Hoare triple {557#false} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {557#false} is VALID [2018-11-23 12:54:03,961 INFO L273 TraceCheckUtils]: 34: Hoare triple {557#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {557#false} is VALID [2018-11-23 12:54:03,961 INFO L273 TraceCheckUtils]: 35: Hoare triple {557#false} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {557#false} is VALID [2018-11-23 12:54:03,962 INFO L256 TraceCheckUtils]: 36: Hoare triple {557#false} call __blast_assert(); {557#false} is VALID [2018-11-23 12:54:03,962 INFO L273 TraceCheckUtils]: 37: Hoare triple {557#false} assume !false; {557#false} is VALID [2018-11-23 12:54:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:54:03,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:03,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:03,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:04,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:05,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {556#true} call ULTIMATE.init(); {556#true} is VALID [2018-11-23 12:54:05,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {556#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume true; {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,046 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} {556#true} #72#return; {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,047 INFO L256 TraceCheckUtils]: 4: Hoare triple {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} call #t~ret34 := main(); {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,053 INFO L256 TraceCheckUtils]: 6: Hoare triple {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} ~size := #in~size; {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,055 INFO L256 TraceCheckUtils]: 8: Hoare triple {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} ~size := #in~size; {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume ~size > 0; {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume 0 == #t~nondet29;havoc #t~nondet29;#res.base, #res.offset := 0, 0; {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume true; {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,066 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} #68#return; {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume true; {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,079 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} {569#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} #76#return; {620#(and (<= 1 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,080 INFO L273 TraceCheckUtils]: 18: Hoare triple {620#(and (<= 1 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {620#(and (<= 1 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,081 INFO L256 TraceCheckUtils]: 19: Hoare triple {620#(and (<= 1 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} ~size := #in~size; {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,084 INFO L256 TraceCheckUtils]: 21: Hoare triple {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} ~size := #in~size; {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume ~size > 0; {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {601#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {645#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {645#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|) (<= ~elem~0.offset 0))} assume true; {645#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,094 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {645#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|) (<= ~elem~0.offset 0))} {585#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} #68#return; {652#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |my_malloc_#t~ret30.offset|) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,095 INFO L273 TraceCheckUtils]: 28: Hoare triple {652#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |my_malloc_#t~ret30.offset|) (<= ~elem~0.offset 0))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {656#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {656#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume true; {656#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,098 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {656#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} {620#(and (<= 1 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} #78#return; {663#(and (<= ~elem~0.offset 0) (<= 2 |main_#t~ret33.offset|))} is VALID [2018-11-23 12:54:05,101 INFO L273 TraceCheckUtils]: 31: Hoare triple {663#(and (<= ~elem~0.offset 0) (<= 2 |main_#t~ret33.offset|))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {667#(and (<= 2 main_~dev2~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {667#(and (<= 2 main_~dev2~0.offset) (<= ~elem~0.offset 0))} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {667#(and (<= 2 main_~dev2~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,120 INFO L256 TraceCheckUtils]: 33: Hoare triple {667#(and (<= 2 main_~dev2~0.offset) (<= ~elem~0.offset 0))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {674#(and (<= 2 |list_add_#in~new.offset|) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {674#(and (<= 2 |list_add_#in~new.offset|) (<= ~elem~0.offset 0))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {678#(and (<= 2 list_add_~new.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:05,121 INFO L273 TraceCheckUtils]: 35: Hoare triple {678#(and (<= 2 list_add_~new.offset) (<= ~elem~0.offset 0))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {557#false} is VALID [2018-11-23 12:54:05,122 INFO L256 TraceCheckUtils]: 36: Hoare triple {557#false} call __blast_assert(); {557#false} is VALID [2018-11-23 12:54:05,122 INFO L273 TraceCheckUtils]: 37: Hoare triple {557#false} assume !false; {557#false} is VALID [2018-11-23 12:54:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:54:05,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:54:05,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-11-23 12:54:05,150 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-11-23 12:54:05,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:05,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:54:05,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:05,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:54:05,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:54:05,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:54:05,294 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 18 states. [2018-11-23 12:54:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:09,482 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2018-11-23 12:54:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:54:09,482 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-11-23 12:54:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:54:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2018-11-23 12:54:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:54:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2018-11-23 12:54:09,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 110 transitions. [2018-11-23 12:54:09,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:09,843 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:54:09,843 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:54:09,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:54:09,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:54:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-11-23 12:54:09,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:09,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 50 states. [2018-11-23 12:54:09,900 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 50 states. [2018-11-23 12:54:09,901 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 50 states. [2018-11-23 12:54:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:09,905 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-23 12:54:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-23 12:54:09,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:09,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:09,907 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 60 states. [2018-11-23 12:54:09,907 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 60 states. [2018-11-23 12:54:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:09,911 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-23 12:54:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-23 12:54:09,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:09,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:09,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:09,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:54:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-23 12:54:09,916 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 38 [2018-11-23 12:54:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:09,916 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-23 12:54:09,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:54:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 12:54:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:54:09,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:09,918 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:09,918 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:09,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:09,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1531629844, now seen corresponding path program 1 times [2018-11-23 12:54:09,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:09,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:09,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:09,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:09,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:10,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {1045#true} call ULTIMATE.init(); {1045#true} is VALID [2018-11-23 12:54:10,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {1045#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {1045#true} is VALID [2018-11-23 12:54:10,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {1045#true} assume true; {1045#true} is VALID [2018-11-23 12:54:10,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1045#true} {1045#true} #72#return; {1045#true} is VALID [2018-11-23 12:54:10,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {1045#true} call #t~ret34 := main(); {1045#true} is VALID [2018-11-23 12:54:10,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {1045#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {1045#true} is VALID [2018-11-23 12:54:10,653 INFO L256 TraceCheckUtils]: 6: Hoare triple {1045#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {1045#true} is VALID [2018-11-23 12:54:10,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {1045#true} ~size := #in~size; {1045#true} is VALID [2018-11-23 12:54:10,653 INFO L256 TraceCheckUtils]: 8: Hoare triple {1045#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1045#true} is VALID [2018-11-23 12:54:10,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {1045#true} ~size := #in~size; {1045#true} is VALID [2018-11-23 12:54:10,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {1045#true} assume ~size > 0; {1045#true} is VALID [2018-11-23 12:54:10,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {1045#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {1045#true} is VALID [2018-11-23 12:54:10,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {1045#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1047#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {1047#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} assume true; {1047#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,656 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1047#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} {1045#true} #68#return; {1048#(<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {1048#(<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1049#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} assume true; {1049#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,662 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1049#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} {1045#true} #76#return; {1050#(<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,663 INFO L273 TraceCheckUtils]: 18: Hoare triple {1050#(<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset)} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {1051#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,665 INFO L256 TraceCheckUtils]: 19: Hoare triple {1051#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,666 INFO L256 TraceCheckUtils]: 21: Hoare triple {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,667 INFO L273 TraceCheckUtils]: 22: Hoare triple {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~size > 0; {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {1053#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:10,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {1053#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1054#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} is VALID [2018-11-23 12:54:10,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {1054#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} assume true; {1054#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} is VALID [2018-11-23 12:54:10,680 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1054#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} {1052#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #68#return; {1055#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#t~ret30.offset|)} is VALID [2018-11-23 12:54:10,680 INFO L273 TraceCheckUtils]: 28: Hoare triple {1055#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#t~ret30.offset|)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1056#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} is VALID [2018-11-23 12:54:10,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {1056#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} assume true; {1056#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} is VALID [2018-11-23 12:54:10,685 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1056#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} {1051#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} #78#return; {1057#(<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|)} is VALID [2018-11-23 12:54:10,685 INFO L273 TraceCheckUtils]: 31: Hoare triple {1057#(<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|)} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {1058#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:10,687 INFO L273 TraceCheckUtils]: 32: Hoare triple {1058#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {1058#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:10,687 INFO L256 TraceCheckUtils]: 33: Hoare triple {1058#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1045#true} is VALID [2018-11-23 12:54:10,687 INFO L273 TraceCheckUtils]: 34: Hoare triple {1045#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} is VALID [2018-11-23 12:54:10,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} is VALID [2018-11-23 12:54:10,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} is VALID [2018-11-23 12:54:10,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {1060#(<= |list_add_#in~new.offset| ~elem~0.offset)} is VALID [2018-11-23 12:54:10,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {1060#(<= |list_add_#in~new.offset| ~elem~0.offset)} assume true; {1060#(<= |list_add_#in~new.offset| ~elem~0.offset)} is VALID [2018-11-23 12:54:10,693 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1060#(<= |list_add_#in~new.offset| ~elem~0.offset)} {1058#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} #80#return; {1061#(<= (+ main_~dev1~0.offset 1) ~elem~0.offset)} is VALID [2018-11-23 12:54:10,695 INFO L256 TraceCheckUtils]: 40: Hoare triple {1061#(<= (+ main_~dev1~0.offset 1) ~elem~0.offset)} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {1062#(<= (+ |list_add_#in~new.offset| 1) ~elem~0.offset)} is VALID [2018-11-23 12:54:10,696 INFO L273 TraceCheckUtils]: 41: Hoare triple {1062#(<= (+ |list_add_#in~new.offset| 1) ~elem~0.offset)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1063#(not (= list_add_~new.offset ~elem~0.offset))} is VALID [2018-11-23 12:54:10,697 INFO L273 TraceCheckUtils]: 42: Hoare triple {1063#(not (= list_add_~new.offset ~elem~0.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {1046#false} is VALID [2018-11-23 12:54:10,697 INFO L256 TraceCheckUtils]: 43: Hoare triple {1046#false} call __blast_assert(); {1046#false} is VALID [2018-11-23 12:54:10,697 INFO L273 TraceCheckUtils]: 44: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2018-11-23 12:54:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:10,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:10,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:10,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:10,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:11,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {1045#true} call ULTIMATE.init(); {1045#true} is VALID [2018-11-23 12:54:11,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {1045#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {1045#true} is VALID [2018-11-23 12:54:11,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {1045#true} assume true; {1045#true} is VALID [2018-11-23 12:54:11,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1045#true} {1045#true} #72#return; {1045#true} is VALID [2018-11-23 12:54:11,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {1045#true} call #t~ret34 := main(); {1045#true} is VALID [2018-11-23 12:54:11,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {1045#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {1045#true} is VALID [2018-11-23 12:54:11,138 INFO L256 TraceCheckUtils]: 6: Hoare triple {1045#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {1045#true} is VALID [2018-11-23 12:54:11,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {1045#true} ~size := #in~size; {1045#true} is VALID [2018-11-23 12:54:11,139 INFO L256 TraceCheckUtils]: 8: Hoare triple {1045#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1045#true} is VALID [2018-11-23 12:54:11,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {1045#true} ~size := #in~size; {1045#true} is VALID [2018-11-23 12:54:11,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {1045#true} assume ~size > 0; {1045#true} is VALID [2018-11-23 12:54:11,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {1045#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {1045#true} is VALID [2018-11-23 12:54:11,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {1045#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1047#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {1047#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} assume true; {1047#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,141 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1047#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} {1045#true} #68#return; {1048#(<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {1048#(<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1049#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} assume true; {1049#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,143 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1049#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} {1045#true} #76#return; {1050#(<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,143 INFO L273 TraceCheckUtils]: 18: Hoare triple {1050#(<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset)} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {1051#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,144 INFO L256 TraceCheckUtils]: 19: Hoare triple {1051#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,147 INFO L256 TraceCheckUtils]: 21: Hoare triple {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,148 INFO L273 TraceCheckUtils]: 22: Hoare triple {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~size > 0; {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {1053#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:11,150 INFO L273 TraceCheckUtils]: 25: Hoare triple {1053#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1143#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:11,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {1143#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} assume true; {1143#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:11,152 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1143#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} {1124#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #68#return; {1150#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |my_malloc_#t~ret30.offset|))} is VALID [2018-11-23 12:54:11,153 INFO L273 TraceCheckUtils]: 28: Hoare triple {1150#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |my_malloc_#t~ret30.offset|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1154#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:11,154 INFO L273 TraceCheckUtils]: 29: Hoare triple {1154#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} assume true; {1154#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:11,155 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1154#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} {1051#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} #78#return; {1057#(<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|)} is VALID [2018-11-23 12:54:11,156 INFO L273 TraceCheckUtils]: 31: Hoare triple {1057#(<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|)} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {1058#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:11,157 INFO L273 TraceCheckUtils]: 32: Hoare triple {1058#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {1058#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:11,157 INFO L256 TraceCheckUtils]: 33: Hoare triple {1058#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1045#true} is VALID [2018-11-23 12:54:11,158 INFO L273 TraceCheckUtils]: 34: Hoare triple {1045#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} is VALID [2018-11-23 12:54:11,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} is VALID [2018-11-23 12:54:11,159 INFO L273 TraceCheckUtils]: 36: Hoare triple {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} is VALID [2018-11-23 12:54:11,160 INFO L273 TraceCheckUtils]: 37: Hoare triple {1059#(<= |list_add_#in~new.offset| list_add_~new.offset)} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {1060#(<= |list_add_#in~new.offset| ~elem~0.offset)} is VALID [2018-11-23 12:54:11,161 INFO L273 TraceCheckUtils]: 38: Hoare triple {1060#(<= |list_add_#in~new.offset| ~elem~0.offset)} assume true; {1060#(<= |list_add_#in~new.offset| ~elem~0.offset)} is VALID [2018-11-23 12:54:11,163 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1060#(<= |list_add_#in~new.offset| ~elem~0.offset)} {1058#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} #80#return; {1061#(<= (+ main_~dev1~0.offset 1) ~elem~0.offset)} is VALID [2018-11-23 12:54:11,164 INFO L256 TraceCheckUtils]: 40: Hoare triple {1061#(<= (+ main_~dev1~0.offset 1) ~elem~0.offset)} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {1062#(<= (+ |list_add_#in~new.offset| 1) ~elem~0.offset)} is VALID [2018-11-23 12:54:11,165 INFO L273 TraceCheckUtils]: 41: Hoare triple {1062#(<= (+ |list_add_#in~new.offset| 1) ~elem~0.offset)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1194#(<= (+ list_add_~new.offset 1) ~elem~0.offset)} is VALID [2018-11-23 12:54:11,166 INFO L273 TraceCheckUtils]: 42: Hoare triple {1194#(<= (+ list_add_~new.offset 1) ~elem~0.offset)} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {1046#false} is VALID [2018-11-23 12:54:11,166 INFO L256 TraceCheckUtils]: 43: Hoare triple {1046#false} call __blast_assert(); {1046#false} is VALID [2018-11-23 12:54:11,166 INFO L273 TraceCheckUtils]: 44: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2018-11-23 12:54:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:11,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:11,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2018-11-23 12:54:11,190 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-23 12:54:11,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:11,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:54:11,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:11,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:54:11,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:54:11,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:54:11,260 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 24 states. [2018-11-23 12:54:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:14,180 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:54:14,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:54:14,181 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-23 12:54:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:54:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2018-11-23 12:54:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:54:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2018-11-23 12:54:14,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 59 transitions. [2018-11-23 12:54:14,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:14,329 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:54:14,329 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:54:14,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:54:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:54:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 12:54:14,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:14,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-23 12:54:14,406 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-23 12:54:14,406 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-23 12:54:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:14,410 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 12:54:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:54:14,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:14,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:14,412 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-23 12:54:14,412 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-23 12:54:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:14,416 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 12:54:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:54:14,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:14,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:14,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:14,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:54:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-11-23 12:54:14,421 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 45 [2018-11-23 12:54:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:14,421 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-11-23 12:54:14,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:54:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-23 12:54:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:54:14,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:14,423 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:14,423 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:14,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash 722283218, now seen corresponding path program 1 times [2018-11-23 12:54:14,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:14,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:14,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:14,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:14,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:14,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {1498#true} call ULTIMATE.init(); {1498#true} is VALID [2018-11-23 12:54:14,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {1498#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:14,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} assume true; {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:14,958 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} {1498#true} #72#return; {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:14,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} call #t~ret34 := main(); {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:14,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:14,961 INFO L256 TraceCheckUtils]: 6: Hoare triple {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {1501#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:14,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {1501#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1501#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:14,963 INFO L256 TraceCheckUtils]: 8: Hoare triple {1501#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1502#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:14,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {1502#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} ~size := #in~size; {1502#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:14,966 INFO L273 TraceCheckUtils]: 10: Hoare triple {1502#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} assume ~size > 0; {1502#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:14,967 INFO L273 TraceCheckUtils]: 11: Hoare triple {1502#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {1503#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:14,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1504#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:14,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {1504#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 |__getMemory_#res.offset|))} assume true; {1504#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:14,971 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1504#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 |__getMemory_#res.offset|))} {1501#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #68#return; {1505#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 |my_malloc_#t~ret30.offset|))} is VALID [2018-11-23 12:54:14,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {1505#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 |my_malloc_#t~ret30.offset|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1506#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 |my_malloc_#res.offset|))} is VALID [2018-11-23 12:54:14,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {1506#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 |my_malloc_#res.offset|))} assume true; {1506#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 |my_malloc_#res.offset|))} is VALID [2018-11-23 12:54:14,975 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1506#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 |my_malloc_#res.offset|))} {1500#(and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset))} #76#return; {1507#(and (= 0 ~elem~0.offset) (<= 1 |main_#t~ret32.offset|))} is VALID [2018-11-23 12:54:14,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {1507#(and (= 0 ~elem~0.offset) (<= 1 |main_#t~ret32.offset|))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:14,978 INFO L256 TraceCheckUtils]: 19: Hoare triple {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {1498#true} is VALID [2018-11-23 12:54:14,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {1498#true} ~size := #in~size; {1498#true} is VALID [2018-11-23 12:54:14,979 INFO L256 TraceCheckUtils]: 21: Hoare triple {1498#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1498#true} is VALID [2018-11-23 12:54:14,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {1498#true} ~size := #in~size; {1498#true} is VALID [2018-11-23 12:54:14,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {1498#true} assume ~size > 0; {1498#true} is VALID [2018-11-23 12:54:14,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {1498#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {1498#true} is VALID [2018-11-23 12:54:14,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {1498#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1498#true} is VALID [2018-11-23 12:54:14,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:54:14,980 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1498#true} {1498#true} #68#return; {1498#true} is VALID [2018-11-23 12:54:14,980 INFO L273 TraceCheckUtils]: 28: Hoare triple {1498#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1498#true} is VALID [2018-11-23 12:54:14,981 INFO L273 TraceCheckUtils]: 29: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:54:14,982 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1498#true} {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} #78#return; {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:14,983 INFO L273 TraceCheckUtils]: 31: Hoare triple {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:14,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:14,987 INFO L256 TraceCheckUtils]: 33: Hoare triple {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 12:54:14,988 INFO L273 TraceCheckUtils]: 34: Hoare triple {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 12:54:14,989 INFO L273 TraceCheckUtils]: 35: Hoare triple {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 12:54:14,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 12:54:14,994 INFO L273 TraceCheckUtils]: 37: Hoare triple {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} assume !(0 != #t~nondet31);havoc #t~nondet31; {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 12:54:14,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} assume true; {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 12:54:15,013 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1509#(= |old(~elem~0.offset)| ~elem~0.offset)} {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} #80#return; {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:15,019 INFO L256 TraceCheckUtils]: 40: Hoare triple {1508#(and (<= 1 main_~dev1~0.offset) (= 0 ~elem~0.offset))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {1510#(and (<= 1 |list_add_#in~new.offset|) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:15,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {1510#(and (<= 1 |list_add_#in~new.offset|) (= 0 ~elem~0.offset))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1511#(and (not (= list_add_~new.offset 0)) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:15,058 INFO L273 TraceCheckUtils]: 42: Hoare triple {1511#(and (not (= list_add_~new.offset 0)) (= 0 ~elem~0.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {1499#false} is VALID [2018-11-23 12:54:15,058 INFO L256 TraceCheckUtils]: 43: Hoare triple {1499#false} call __blast_assert(); {1499#false} is VALID [2018-11-23 12:54:15,059 INFO L273 TraceCheckUtils]: 44: Hoare triple {1499#false} assume !false; {1499#false} is VALID [2018-11-23 12:54:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:15,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:15,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:15,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:15,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:16,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {1498#true} call ULTIMATE.init(); {1498#true} is VALID [2018-11-23 12:54:16,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {1498#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume true; {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} {1498#true} #72#return; {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,227 INFO L256 TraceCheckUtils]: 4: Hoare triple {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} call #t~ret34 := main(); {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,228 INFO L256 TraceCheckUtils]: 6: Hoare triple {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} ~size := #in~size; {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,230 INFO L256 TraceCheckUtils]: 8: Hoare triple {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} ~size := #in~size; {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume ~size > 0; {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {1550#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {1550#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1554#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {1554#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|) (<= ~elem~0.offset 0))} assume true; {1554#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,238 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1554#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|) (<= ~elem~0.offset 0))} {1534#(and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} #68#return; {1561#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |my_malloc_#t~ret30.offset|) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {1561#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |my_malloc_#t~ret30.offset|) (<= ~elem~0.offset 0))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1565#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {1565#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} assume true; {1565#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,241 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1565#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} {1518#(and (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0))} #76#return; {1572#(and (<= 1 |main_#t~ret32.offset|) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,242 INFO L273 TraceCheckUtils]: 18: Hoare triple {1572#(and (<= 1 |main_#t~ret32.offset|) (<= ~elem~0.offset 0))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,243 INFO L256 TraceCheckUtils]: 19: Hoare triple {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {1580#(<= ~elem~0.offset 0)} ~size := #in~size; {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,245 INFO L256 TraceCheckUtils]: 21: Hoare triple {1580#(<= ~elem~0.offset 0)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {1580#(<= ~elem~0.offset 0)} ~size := #in~size; {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {1580#(<= ~elem~0.offset 0)} assume ~size > 0; {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,247 INFO L273 TraceCheckUtils]: 24: Hoare triple {1580#(<= ~elem~0.offset 0)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {1580#(<= ~elem~0.offset 0)} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {1580#(<= ~elem~0.offset 0)} assume true; {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,249 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1580#(<= ~elem~0.offset 0)} {1580#(<= ~elem~0.offset 0)} #68#return; {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,249 INFO L273 TraceCheckUtils]: 28: Hoare triple {1580#(<= ~elem~0.offset 0)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,250 INFO L273 TraceCheckUtils]: 29: Hoare triple {1580#(<= ~elem~0.offset 0)} assume true; {1580#(<= ~elem~0.offset 0)} is VALID [2018-11-23 12:54:16,251 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1580#(<= ~elem~0.offset 0)} {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} #78#return; {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,252 INFO L273 TraceCheckUtils]: 31: Hoare triple {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,253 INFO L273 TraceCheckUtils]: 32: Hoare triple {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,258 INFO L256 TraceCheckUtils]: 33: Hoare triple {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:16,258 INFO L273 TraceCheckUtils]: 34: Hoare triple {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:16,258 INFO L273 TraceCheckUtils]: 35: Hoare triple {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:16,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:16,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} assume !(0 != #t~nondet31);havoc #t~nondet31; {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:16,260 INFO L273 TraceCheckUtils]: 38: Hoare triple {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} assume true; {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:16,261 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1623#(<= ~elem~0.offset |old(~elem~0.offset)|)} {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} #80#return; {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,262 INFO L256 TraceCheckUtils]: 40: Hoare triple {1576#(and (<= 1 main_~dev1~0.offset) (<= ~elem~0.offset 0))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {1645#(and (<= 1 |list_add_#in~new.offset|) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,262 INFO L273 TraceCheckUtils]: 41: Hoare triple {1645#(and (<= 1 |list_add_#in~new.offset|) (<= ~elem~0.offset 0))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1649#(and (<= 1 list_add_~new.offset) (<= ~elem~0.offset 0))} is VALID [2018-11-23 12:54:16,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {1649#(and (<= 1 list_add_~new.offset) (<= ~elem~0.offset 0))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {1499#false} is VALID [2018-11-23 12:54:16,264 INFO L256 TraceCheckUtils]: 43: Hoare triple {1499#false} call __blast_assert(); {1499#false} is VALID [2018-11-23 12:54:16,264 INFO L273 TraceCheckUtils]: 44: Hoare triple {1499#false} assume !false; {1499#false} is VALID [2018-11-23 12:54:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:16,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:16,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 12:54:16,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-11-23 12:54:16,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:16,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:54:16,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:16,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:54:16,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:54:16,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:54:16,384 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 26 states. [2018-11-23 12:54:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:19,263 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-23 12:54:19,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:54:19,264 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-11-23 12:54:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:54:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 74 transitions. [2018-11-23 12:54:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:54:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 74 transitions. [2018-11-23 12:54:19,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 74 transitions. [2018-11-23 12:54:19,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:19,377 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:54:19,377 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 12:54:19,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=249, Invalid=1311, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:54:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 12:54:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-11-23 12:54:19,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:19,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 54 states. [2018-11-23 12:54:19,472 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 54 states. [2018-11-23 12:54:19,472 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 54 states. [2018-11-23 12:54:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:19,476 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-11-23 12:54:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-11-23 12:54:19,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:19,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:19,477 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 67 states. [2018-11-23 12:54:19,477 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 67 states. [2018-11-23 12:54:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:19,481 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-11-23 12:54:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-11-23 12:54:19,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:19,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:19,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:19,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:54:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-11-23 12:54:19,484 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 45 [2018-11-23 12:54:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:19,485 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-23 12:54:19,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:54:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 12:54:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:54:19,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:19,487 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:19,487 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:19,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:19,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1421196377, now seen corresponding path program 1 times [2018-11-23 12:54:19,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:19,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:19,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:19,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {1998#true} call ULTIMATE.init(); {1998#true} is VALID [2018-11-23 12:54:19,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {1998#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {2000#(= 0 ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {2000#(= 0 ~guard_malloc_counter~0.offset)} assume true; {2000#(= 0 ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2000#(= 0 ~guard_malloc_counter~0.offset)} {1998#true} #72#return; {2000#(= 0 ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {2000#(= 0 ~guard_malloc_counter~0.offset)} call #t~ret34 := main(); {2000#(= 0 ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {2000#(= 0 ~guard_malloc_counter~0.offset)} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {2000#(= 0 ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,910 INFO L256 TraceCheckUtils]: 6: Hoare triple {2000#(= 0 ~guard_malloc_counter~0.offset)} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,911 INFO L256 TraceCheckUtils]: 8: Hoare triple {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2002#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:19,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {2002#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} ~size := #in~size; {2002#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:19,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {2002#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} assume ~size > 0; {2002#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:19,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {2002#(or (= ~guard_malloc_counter~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:19,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:19,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} assume true; {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:19,916 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #68#return; {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:19,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:19,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} assume true; {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:19,919 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2003#(or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (<= 1 ~guard_malloc_counter~0.offset))} {2000#(= 0 ~guard_malloc_counter~0.offset)} #76#return; {2004#(<= 1 ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {2004#(<= 1 ~guard_malloc_counter~0.offset)} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {2004#(<= 1 ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,921 INFO L256 TraceCheckUtils]: 19: Hoare triple {2004#(<= 1 ~guard_malloc_counter~0.offset)} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,922 INFO L256 TraceCheckUtils]: 21: Hoare triple {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~size > 0; {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {2005#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:19,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {2005#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2006#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} is VALID [2018-11-23 12:54:19,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {2006#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} assume true; {2006#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} is VALID [2018-11-23 12:54:19,927 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2006#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} {2001#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #68#return; {2007#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#t~ret30.offset|)} is VALID [2018-11-23 12:54:19,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {2007#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#t~ret30.offset|)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2008#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} is VALID [2018-11-23 12:54:19,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {2008#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} assume true; {2008#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} is VALID [2018-11-23 12:54:19,930 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2008#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} {2004#(<= 1 ~guard_malloc_counter~0.offset)} #78#return; {2009#(<= 2 |main_#t~ret33.offset|)} is VALID [2018-11-23 12:54:19,931 INFO L273 TraceCheckUtils]: 31: Hoare triple {2009#(<= 2 |main_#t~ret33.offset|)} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {2010#(<= 2 main_~dev2~0.offset)} is VALID [2018-11-23 12:54:19,931 INFO L273 TraceCheckUtils]: 32: Hoare triple {2010#(<= 2 main_~dev2~0.offset)} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {2010#(<= 2 main_~dev2~0.offset)} is VALID [2018-11-23 12:54:19,931 INFO L256 TraceCheckUtils]: 33: Hoare triple {2010#(<= 2 main_~dev2~0.offset)} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1998#true} is VALID [2018-11-23 12:54:19,932 INFO L273 TraceCheckUtils]: 34: Hoare triple {1998#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1998#true} is VALID [2018-11-23 12:54:19,932 INFO L273 TraceCheckUtils]: 35: Hoare triple {1998#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {1998#true} is VALID [2018-11-23 12:54:19,932 INFO L273 TraceCheckUtils]: 36: Hoare triple {1998#true} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {1998#true} is VALID [2018-11-23 12:54:19,933 INFO L273 TraceCheckUtils]: 37: Hoare triple {1998#true} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {1998#true} is VALID [2018-11-23 12:54:19,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {1998#true} assume true; {1998#true} is VALID [2018-11-23 12:54:19,934 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1998#true} {2010#(<= 2 main_~dev2~0.offset)} #80#return; {2010#(<= 2 main_~dev2~0.offset)} is VALID [2018-11-23 12:54:19,934 INFO L256 TraceCheckUtils]: 40: Hoare triple {2010#(<= 2 main_~dev2~0.offset)} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {1998#true} is VALID [2018-11-23 12:54:19,935 INFO L273 TraceCheckUtils]: 41: Hoare triple {1998#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1998#true} is VALID [2018-11-23 12:54:19,935 INFO L273 TraceCheckUtils]: 42: Hoare triple {1998#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {1998#true} is VALID [2018-11-23 12:54:19,935 INFO L273 TraceCheckUtils]: 43: Hoare triple {1998#true} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {1998#true} is VALID [2018-11-23 12:54:19,935 INFO L273 TraceCheckUtils]: 44: Hoare triple {1998#true} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {1998#true} is VALID [2018-11-23 12:54:19,936 INFO L273 TraceCheckUtils]: 45: Hoare triple {1998#true} assume true; {1998#true} is VALID [2018-11-23 12:54:19,937 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1998#true} {2010#(<= 2 main_~dev2~0.offset)} #82#return; {2010#(<= 2 main_~dev2~0.offset)} is VALID [2018-11-23 12:54:19,937 INFO L256 TraceCheckUtils]: 47: Hoare triple {2010#(<= 2 main_~dev2~0.offset)} call list_del(~dev2~0.base, ~dev2~0.offset); {1998#true} is VALID [2018-11-23 12:54:19,937 INFO L273 TraceCheckUtils]: 48: Hoare triple {1998#true} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {1998#true} is VALID [2018-11-23 12:54:19,937 INFO L273 TraceCheckUtils]: 49: Hoare triple {1998#true} assume ~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset;~elem~0.base, ~elem~0.offset := 0, 0; {2011#(= 0 ~elem~0.offset)} is VALID [2018-11-23 12:54:19,938 INFO L273 TraceCheckUtils]: 50: Hoare triple {2011#(= 0 ~elem~0.offset)} assume true; {2011#(= 0 ~elem~0.offset)} is VALID [2018-11-23 12:54:19,939 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2011#(= 0 ~elem~0.offset)} {2010#(<= 2 main_~dev2~0.offset)} #84#return; {2012#(and (<= 2 main_~dev2~0.offset) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:19,945 INFO L256 TraceCheckUtils]: 52: Hoare triple {2012#(and (<= 2 main_~dev2~0.offset) (= 0 ~elem~0.offset))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {2013#(and (<= 2 |list_add_#in~new.offset|) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:19,946 INFO L273 TraceCheckUtils]: 53: Hoare triple {2013#(and (<= 2 |list_add_#in~new.offset|) (= 0 ~elem~0.offset))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2014#(and (not (= list_add_~new.offset 0)) (= 0 ~elem~0.offset))} is VALID [2018-11-23 12:54:19,946 INFO L273 TraceCheckUtils]: 54: Hoare triple {2014#(and (not (= list_add_~new.offset 0)) (= 0 ~elem~0.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {1999#false} is VALID [2018-11-23 12:54:19,947 INFO L256 TraceCheckUtils]: 55: Hoare triple {1999#false} call __blast_assert(); {1999#false} is VALID [2018-11-23 12:54:19,947 INFO L273 TraceCheckUtils]: 56: Hoare triple {1999#false} assume !false; {1999#false} is VALID [2018-11-23 12:54:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:54:19,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:19,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:19,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:20,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:20,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {1998#true} call ULTIMATE.init(); {1998#true} is VALID [2018-11-23 12:54:20,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {1998#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {1998#true} is VALID [2018-11-23 12:54:20,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {1998#true} assume true; {1998#true} is VALID [2018-11-23 12:54:20,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1998#true} {1998#true} #72#return; {1998#true} is VALID [2018-11-23 12:54:20,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {1998#true} call #t~ret34 := main(); {1998#true} is VALID [2018-11-23 12:54:20,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {1998#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {1998#true} is VALID [2018-11-23 12:54:20,865 INFO L256 TraceCheckUtils]: 6: Hoare triple {1998#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {1998#true} is VALID [2018-11-23 12:54:20,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {1998#true} ~size := #in~size; {1998#true} is VALID [2018-11-23 12:54:20,865 INFO L256 TraceCheckUtils]: 8: Hoare triple {1998#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1998#true} is VALID [2018-11-23 12:54:20,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {1998#true} ~size := #in~size; {1998#true} is VALID [2018-11-23 12:54:20,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {1998#true} assume ~size > 0; {1998#true} is VALID [2018-11-23 12:54:20,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {1998#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {1998#true} is VALID [2018-11-23 12:54:20,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {1998#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2054#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,869 INFO L273 TraceCheckUtils]: 13: Hoare triple {2054#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} assume true; {2054#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,871 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2054#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} {1998#true} #68#return; {2061#(<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {2061#(<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2065#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {2065#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} assume true; {2065#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,875 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2065#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} {1998#true} #76#return; {2072#(<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,878 INFO L273 TraceCheckUtils]: 18: Hoare triple {2072#(<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset)} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {2076#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,884 INFO L256 TraceCheckUtils]: 19: Hoare triple {2076#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,888 INFO L256 TraceCheckUtils]: 21: Hoare triple {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~size > 0; {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {2005#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:20,895 INFO L273 TraceCheckUtils]: 25: Hoare triple {2005#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2099#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:20,895 INFO L273 TraceCheckUtils]: 26: Hoare triple {2099#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} assume true; {2099#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:20,905 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2099#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} {2080#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #68#return; {2106#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |my_malloc_#t~ret30.offset|))} is VALID [2018-11-23 12:54:20,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {2106#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |my_malloc_#t~ret30.offset|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2110#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:20,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {2110#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} assume true; {2110#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:20,917 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2110#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} {2076#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} #78#return; {2117#(<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|)} is VALID [2018-11-23 12:54:20,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {2117#(<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|)} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {2121#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:20,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {2121#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {2121#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:20,920 INFO L256 TraceCheckUtils]: 33: Hoare triple {2121#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1998#true} is VALID [2018-11-23 12:54:20,920 INFO L273 TraceCheckUtils]: 34: Hoare triple {1998#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1998#true} is VALID [2018-11-23 12:54:20,920 INFO L273 TraceCheckUtils]: 35: Hoare triple {1998#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {1998#true} is VALID [2018-11-23 12:54:20,920 INFO L273 TraceCheckUtils]: 36: Hoare triple {1998#true} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {1998#true} is VALID [2018-11-23 12:54:20,921 INFO L273 TraceCheckUtils]: 37: Hoare triple {1998#true} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {1998#true} is VALID [2018-11-23 12:54:20,921 INFO L273 TraceCheckUtils]: 38: Hoare triple {1998#true} assume true; {1998#true} is VALID [2018-11-23 12:54:20,925 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1998#true} {2121#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} #80#return; {2121#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:20,925 INFO L256 TraceCheckUtils]: 40: Hoare triple {2121#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {1998#true} is VALID [2018-11-23 12:54:20,925 INFO L273 TraceCheckUtils]: 41: Hoare triple {1998#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2152#(<= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:20,928 INFO L273 TraceCheckUtils]: 42: Hoare triple {2152#(<= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {2152#(<= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:20,928 INFO L273 TraceCheckUtils]: 43: Hoare triple {2152#(<= list_add_~new.offset |list_add_#in~new.offset|)} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {2152#(<= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:20,930 INFO L273 TraceCheckUtils]: 44: Hoare triple {2152#(<= list_add_~new.offset |list_add_#in~new.offset|)} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {2162#(<= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:20,930 INFO L273 TraceCheckUtils]: 45: Hoare triple {2162#(<= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {2162#(<= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:20,932 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2162#(<= ~elem~0.offset |list_add_#in~new.offset|)} {2121#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} #82#return; {2169#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:20,935 INFO L256 TraceCheckUtils]: 47: Hoare triple {2169#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} call list_del(~dev2~0.base, ~dev2~0.offset); {2173#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:20,935 INFO L273 TraceCheckUtils]: 48: Hoare triple {2173#(<= ~elem~0.offset |old(~elem~0.offset)|)} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {2177#(and (<= ~elem~0.offset |old(~elem~0.offset)|) (<= |list_del_#in~entry.offset| list_del_~entry.offset))} is VALID [2018-11-23 12:54:20,938 INFO L273 TraceCheckUtils]: 49: Hoare triple {2177#(and (<= ~elem~0.offset |old(~elem~0.offset)|) (<= |list_del_#in~entry.offset| list_del_~entry.offset))} assume ~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset;~elem~0.base, ~elem~0.offset := 0, 0; {2181#(<= |list_del_#in~entry.offset| |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:20,938 INFO L273 TraceCheckUtils]: 50: Hoare triple {2181#(<= |list_del_#in~entry.offset| |old(~elem~0.offset)|)} assume true; {2181#(<= |list_del_#in~entry.offset| |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:20,939 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2181#(<= |list_del_#in~entry.offset| |old(~elem~0.offset)|)} {2169#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} #84#return; {1999#false} is VALID [2018-11-23 12:54:20,939 INFO L256 TraceCheckUtils]: 52: Hoare triple {1999#false} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1999#false} is VALID [2018-11-23 12:54:20,939 INFO L273 TraceCheckUtils]: 53: Hoare triple {1999#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1999#false} is VALID [2018-11-23 12:54:20,939 INFO L273 TraceCheckUtils]: 54: Hoare triple {1999#false} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {1999#false} is VALID [2018-11-23 12:54:20,939 INFO L256 TraceCheckUtils]: 55: Hoare triple {1999#false} call __blast_assert(); {1999#false} is VALID [2018-11-23 12:54:20,939 INFO L273 TraceCheckUtils]: 56: Hoare triple {1999#false} assume !false; {1999#false} is VALID [2018-11-23 12:54:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:54:20,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:20,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2018-11-23 12:54:20,967 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 57 [2018-11-23 12:54:20,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:20,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:54:21,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:21,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:54:21,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:54:21,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:54:21,081 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 34 states. [2018-11-23 12:54:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,448 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-11-23 12:54:26,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:54:26,448 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 57 [2018-11-23 12:54:26,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:54:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2018-11-23 12:54:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:54:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2018-11-23 12:54:26,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 79 transitions. [2018-11-23 12:54:26,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:26,626 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:54:26,626 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:54:26,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=377, Invalid=3045, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 12:54:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:54:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-11-23 12:54:26,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:26,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 54 states. [2018-11-23 12:54:26,736 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 54 states. [2018-11-23 12:54:26,737 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 54 states. [2018-11-23 12:54:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,740 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-11-23 12:54:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-11-23 12:54:26,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,741 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 63 states. [2018-11-23 12:54:26,741 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 63 states. [2018-11-23 12:54:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,744 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-11-23 12:54:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-11-23 12:54:26,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:26,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:54:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-23 12:54:26,747 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 57 [2018-11-23 12:54:26,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:26,748 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-23 12:54:26,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:54:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 12:54:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:54:26,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:26,749 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:26,749 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:26,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2064424293, now seen corresponding path program 1 times [2018-11-23 12:54:26,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:26,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:26,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:26,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:27,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2018-11-23 12:54:27,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {2567#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {2567#true} is VALID [2018-11-23 12:54:27,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 12:54:27,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #72#return; {2567#true} is VALID [2018-11-23 12:54:27,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret34 := main(); {2567#true} is VALID [2018-11-23 12:54:27,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {2567#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {2567#true} is VALID [2018-11-23 12:54:27,132 INFO L256 TraceCheckUtils]: 6: Hoare triple {2567#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {2567#true} is VALID [2018-11-23 12:54:27,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {2567#true} ~size := #in~size; {2567#true} is VALID [2018-11-23 12:54:27,132 INFO L256 TraceCheckUtils]: 8: Hoare triple {2567#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2567#true} is VALID [2018-11-23 12:54:27,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {2567#true} ~size := #in~size; {2567#true} is VALID [2018-11-23 12:54:27,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {2567#true} assume ~size > 0; {2567#true} is VALID [2018-11-23 12:54:27,133 INFO L273 TraceCheckUtils]: 11: Hoare triple {2567#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {2567#true} is VALID [2018-11-23 12:54:27,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {2567#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2569#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,133 INFO L273 TraceCheckUtils]: 13: Hoare triple {2569#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} assume true; {2569#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,134 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2569#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} {2567#true} #68#return; {2570#(<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {2570#(<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2571#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,135 INFO L273 TraceCheckUtils]: 16: Hoare triple {2571#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} assume true; {2571#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,136 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2571#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} {2567#true} #76#return; {2572#(<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,136 INFO L273 TraceCheckUtils]: 18: Hoare triple {2572#(<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset)} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {2573#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,137 INFO L256 TraceCheckUtils]: 19: Hoare triple {2573#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,137 INFO L273 TraceCheckUtils]: 20: Hoare triple {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,138 INFO L256 TraceCheckUtils]: 21: Hoare triple {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~size > 0; {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {2575#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {2575#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2576#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} is VALID [2018-11-23 12:54:27,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {2576#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} assume true; {2576#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} is VALID [2018-11-23 12:54:27,142 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2576#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |__getMemory_#res.offset|)} {2574#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #68#return; {2577#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#t~ret30.offset|)} is VALID [2018-11-23 12:54:27,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {2577#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#t~ret30.offset|)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2578#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} is VALID [2018-11-23 12:54:27,143 INFO L273 TraceCheckUtils]: 29: Hoare triple {2578#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} assume true; {2578#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} is VALID [2018-11-23 12:54:27,145 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2578#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) |my_malloc_#res.offset|)} {2573#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} #78#return; {2579#(<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|)} is VALID [2018-11-23 12:54:27,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {2579#(<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|)} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:27,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:27,146 INFO L256 TraceCheckUtils]: 33: Hoare triple {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {2567#true} is VALID [2018-11-23 12:54:27,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {2567#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2567#true} is VALID [2018-11-23 12:54:27,147 INFO L273 TraceCheckUtils]: 35: Hoare triple {2567#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {2567#true} is VALID [2018-11-23 12:54:27,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {2567#true} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {2567#true} is VALID [2018-11-23 12:54:27,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {2567#true} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {2567#true} is VALID [2018-11-23 12:54:27,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 12:54:27,149 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2567#true} {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} #80#return; {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:27,149 INFO L256 TraceCheckUtils]: 40: Hoare triple {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {2567#true} is VALID [2018-11-23 12:54:27,149 INFO L273 TraceCheckUtils]: 41: Hoare triple {2567#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,149 INFO L273 TraceCheckUtils]: 42: Hoare triple {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,150 INFO L273 TraceCheckUtils]: 43: Hoare triple {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,150 INFO L273 TraceCheckUtils]: 44: Hoare triple {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {2582#(<= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {2582#(<= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {2582#(<= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,153 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2582#(<= ~elem~0.offset |list_add_#in~new.offset|)} {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} #82#return; {2583#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:27,154 INFO L256 TraceCheckUtils]: 47: Hoare triple {2583#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} call list_del(~dev2~0.base, ~dev2~0.offset); {2584#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 12:54:27,154 INFO L273 TraceCheckUtils]: 48: Hoare triple {2584#(= |old(~elem~0.offset)| ~elem~0.offset)} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {2584#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 12:54:27,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {2584#(= |old(~elem~0.offset)| ~elem~0.offset)} assume !(~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset); {2584#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 12:54:27,156 INFO L273 TraceCheckUtils]: 50: Hoare triple {2584#(= |old(~elem~0.offset)| ~elem~0.offset)} assume true; {2584#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 12:54:27,156 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2584#(= |old(~elem~0.offset)| ~elem~0.offset)} {2583#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} #84#return; {2583#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:27,158 INFO L256 TraceCheckUtils]: 52: Hoare triple {2583#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {2585#(<= (+ ~elem~0.offset 1) |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,158 INFO L273 TraceCheckUtils]: 53: Hoare triple {2585#(<= (+ ~elem~0.offset 1) |list_add_#in~new.offset|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2586#(not (= list_add_~new.offset ~elem~0.offset))} is VALID [2018-11-23 12:54:27,159 INFO L273 TraceCheckUtils]: 54: Hoare triple {2586#(not (= list_add_~new.offset ~elem~0.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {2568#false} is VALID [2018-11-23 12:54:27,159 INFO L256 TraceCheckUtils]: 55: Hoare triple {2568#false} call __blast_assert(); {2568#false} is VALID [2018-11-23 12:54:27,159 INFO L273 TraceCheckUtils]: 56: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2018-11-23 12:54:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:54:27,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:27,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:27,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:27,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:27,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2018-11-23 12:54:27,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {2567#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {2567#true} is VALID [2018-11-23 12:54:27,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 12:54:27,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #72#return; {2567#true} is VALID [2018-11-23 12:54:27,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret34 := main(); {2567#true} is VALID [2018-11-23 12:54:27,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {2567#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {2567#true} is VALID [2018-11-23 12:54:27,614 INFO L256 TraceCheckUtils]: 6: Hoare triple {2567#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {2567#true} is VALID [2018-11-23 12:54:27,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {2567#true} ~size := #in~size; {2567#true} is VALID [2018-11-23 12:54:27,615 INFO L256 TraceCheckUtils]: 8: Hoare triple {2567#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2567#true} is VALID [2018-11-23 12:54:27,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {2567#true} ~size := #in~size; {2567#true} is VALID [2018-11-23 12:54:27,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {2567#true} assume ~size > 0; {2567#true} is VALID [2018-11-23 12:54:27,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {2567#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {2567#true} is VALID [2018-11-23 12:54:27,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {2567#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2569#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,616 INFO L273 TraceCheckUtils]: 13: Hoare triple {2569#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} assume true; {2569#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,617 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2569#(<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset)} {2567#true} #68#return; {2570#(<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {2570#(<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2571#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {2571#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} assume true; {2571#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,619 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2571#(<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} {2567#true} #76#return; {2572#(<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {2572#(<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset)} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {2573#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,620 INFO L256 TraceCheckUtils]: 19: Hoare triple {2573#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,621 INFO L273 TraceCheckUtils]: 20: Hoare triple {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,621 INFO L256 TraceCheckUtils]: 21: Hoare triple {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,622 INFO L273 TraceCheckUtils]: 22: Hoare triple {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,622 INFO L273 TraceCheckUtils]: 23: Hoare triple {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~size > 0; {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,623 INFO L273 TraceCheckUtils]: 24: Hoare triple {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {2575#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 12:54:27,624 INFO L273 TraceCheckUtils]: 25: Hoare triple {2575#(<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2666#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:27,625 INFO L273 TraceCheckUtils]: 26: Hoare triple {2666#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} assume true; {2666#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} is VALID [2018-11-23 12:54:27,626 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2666#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |__getMemory_#res.offset|))} {2647#(<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #68#return; {2673#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |my_malloc_#t~ret30.offset|))} is VALID [2018-11-23 12:54:27,627 INFO L273 TraceCheckUtils]: 28: Hoare triple {2673#(and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset |my_malloc_#t~ret30.offset|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2677#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:27,628 INFO L273 TraceCheckUtils]: 29: Hoare triple {2677#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} assume true; {2677#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 12:54:27,629 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2677#(and (<= ~guard_malloc_counter~0.offset |my_malloc_#res.offset|) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset))} {2573#(<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)} #78#return; {2579#(<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|)} is VALID [2018-11-23 12:54:27,630 INFO L273 TraceCheckUtils]: 31: Hoare triple {2579#(<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|)} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:27,630 INFO L273 TraceCheckUtils]: 32: Hoare triple {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:27,631 INFO L256 TraceCheckUtils]: 33: Hoare triple {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {2567#true} is VALID [2018-11-23 12:54:27,631 INFO L273 TraceCheckUtils]: 34: Hoare triple {2567#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2567#true} is VALID [2018-11-23 12:54:27,631 INFO L273 TraceCheckUtils]: 35: Hoare triple {2567#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {2567#true} is VALID [2018-11-23 12:54:27,632 INFO L273 TraceCheckUtils]: 36: Hoare triple {2567#true} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {2567#true} is VALID [2018-11-23 12:54:27,632 INFO L273 TraceCheckUtils]: 37: Hoare triple {2567#true} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {2567#true} is VALID [2018-11-23 12:54:27,632 INFO L273 TraceCheckUtils]: 38: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 12:54:27,633 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2567#true} {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} #80#return; {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:27,633 INFO L256 TraceCheckUtils]: 40: Hoare triple {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {2567#true} is VALID [2018-11-23 12:54:27,634 INFO L273 TraceCheckUtils]: 41: Hoare triple {2567#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,634 INFO L273 TraceCheckUtils]: 42: Hoare triple {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,634 INFO L273 TraceCheckUtils]: 43: Hoare triple {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,635 INFO L273 TraceCheckUtils]: 44: Hoare triple {2581#(<= list_add_~new.offset |list_add_#in~new.offset|)} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {2582#(<= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,635 INFO L273 TraceCheckUtils]: 45: Hoare triple {2582#(<= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {2582#(<= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,637 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2582#(<= ~elem~0.offset |list_add_#in~new.offset|)} {2580#(<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)} #82#return; {2583#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:27,637 INFO L256 TraceCheckUtils]: 47: Hoare triple {2583#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} call list_del(~dev2~0.base, ~dev2~0.offset); {2735#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:27,643 INFO L273 TraceCheckUtils]: 48: Hoare triple {2735#(<= ~elem~0.offset |old(~elem~0.offset)|)} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {2735#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:27,644 INFO L273 TraceCheckUtils]: 49: Hoare triple {2735#(<= ~elem~0.offset |old(~elem~0.offset)|)} assume !(~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset); {2735#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:27,644 INFO L273 TraceCheckUtils]: 50: Hoare triple {2735#(<= ~elem~0.offset |old(~elem~0.offset)|)} assume true; {2735#(<= ~elem~0.offset |old(~elem~0.offset)|)} is VALID [2018-11-23 12:54:27,645 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2735#(<= ~elem~0.offset |old(~elem~0.offset)|)} {2583#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} #84#return; {2583#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} is VALID [2018-11-23 12:54:27,646 INFO L256 TraceCheckUtils]: 52: Hoare triple {2583#(<= (+ ~elem~0.offset 1) main_~dev2~0.offset)} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {2585#(<= (+ ~elem~0.offset 1) |list_add_#in~new.offset|)} is VALID [2018-11-23 12:54:27,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {2585#(<= (+ ~elem~0.offset 1) |list_add_#in~new.offset|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2754#(<= (+ ~elem~0.offset 1) list_add_~new.offset)} is VALID [2018-11-23 12:54:27,647 INFO L273 TraceCheckUtils]: 54: Hoare triple {2754#(<= (+ ~elem~0.offset 1) list_add_~new.offset)} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {2568#false} is VALID [2018-11-23 12:54:27,647 INFO L256 TraceCheckUtils]: 55: Hoare triple {2568#false} call __blast_assert(); {2568#false} is VALID [2018-11-23 12:54:27,648 INFO L273 TraceCheckUtils]: 56: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2018-11-23 12:54:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:54:27,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:27,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 26 [2018-11-23 12:54:27,674 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-23 12:54:27,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:27,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:54:27,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:27,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:54:27,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:54:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:54:27,759 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 26 states. [2018-11-23 12:54:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:31,846 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:54:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:54:31,846 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-23 12:54:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:54:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 54 transitions. [2018-11-23 12:54:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:54:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 54 transitions. [2018-11-23 12:54:31,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 54 transitions. [2018-11-23 12:54:31,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:31,942 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:54:31,942 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:54:31,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=206, Invalid=1516, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:54:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:54:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 12:54:32,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:32,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-23 12:54:32,032 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:54:32,032 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:54:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:32,035 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:54:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:54:32,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:32,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:32,035 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:54:32,036 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:54:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:32,037 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:54:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:54:32,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:32,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:32,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:32,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:54:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-23 12:54:32,040 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 57 [2018-11-23 12:54:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:32,040 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-23 12:54:32,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:54:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:54:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:54:32,041 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:32,041 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:32,042 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:32,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:32,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1477618279, now seen corresponding path program 1 times [2018-11-23 12:54:32,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:32,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:32,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:32,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:32,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:32,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3044#true} is VALID [2018-11-23 12:54:32,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {3044#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {3044#true} is VALID [2018-11-23 12:54:32,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2018-11-23 12:54:32,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #72#return; {3044#true} is VALID [2018-11-23 12:54:32,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret34 := main(); {3044#true} is VALID [2018-11-23 12:54:32,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {3044#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {3044#true} is VALID [2018-11-23 12:54:32,253 INFO L256 TraceCheckUtils]: 6: Hoare triple {3044#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {3044#true} is VALID [2018-11-23 12:54:32,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {3044#true} ~size := #in~size; {3044#true} is VALID [2018-11-23 12:54:32,254 INFO L256 TraceCheckUtils]: 8: Hoare triple {3044#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {3044#true} is VALID [2018-11-23 12:54:32,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {3044#true} ~size := #in~size; {3044#true} is VALID [2018-11-23 12:54:32,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {3044#true} assume ~size > 0; {3044#true} is VALID [2018-11-23 12:54:32,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {3044#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {3044#true} is VALID [2018-11-23 12:54:32,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {3044#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {3044#true} is VALID [2018-11-23 12:54:32,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {3044#true} assume true; {3044#true} is VALID [2018-11-23 12:54:32,255 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3044#true} {3044#true} #68#return; {3044#true} is VALID [2018-11-23 12:54:32,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {3044#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3044#true} is VALID [2018-11-23 12:54:32,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {3044#true} assume true; {3044#true} is VALID [2018-11-23 12:54:32,255 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3044#true} {3044#true} #76#return; {3044#true} is VALID [2018-11-23 12:54:32,255 INFO L273 TraceCheckUtils]: 18: Hoare triple {3044#true} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {3044#true} is VALID [2018-11-23 12:54:32,255 INFO L256 TraceCheckUtils]: 19: Hoare triple {3044#true} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {3044#true} is VALID [2018-11-23 12:54:32,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {3044#true} ~size := #in~size; {3044#true} is VALID [2018-11-23 12:54:32,255 INFO L256 TraceCheckUtils]: 21: Hoare triple {3044#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {3044#true} is VALID [2018-11-23 12:54:32,256 INFO L273 TraceCheckUtils]: 22: Hoare triple {3044#true} ~size := #in~size; {3044#true} is VALID [2018-11-23 12:54:32,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {3044#true} assume ~size > 0; {3044#true} is VALID [2018-11-23 12:54:32,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {3044#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {3044#true} is VALID [2018-11-23 12:54:32,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {3044#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {3044#true} is VALID [2018-11-23 12:54:32,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {3044#true} assume true; {3044#true} is VALID [2018-11-23 12:54:32,256 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3044#true} {3044#true} #68#return; {3044#true} is VALID [2018-11-23 12:54:32,256 INFO L273 TraceCheckUtils]: 28: Hoare triple {3044#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3044#true} is VALID [2018-11-23 12:54:32,256 INFO L273 TraceCheckUtils]: 29: Hoare triple {3044#true} assume true; {3044#true} is VALID [2018-11-23 12:54:32,257 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {3044#true} {3044#true} #78#return; {3044#true} is VALID [2018-11-23 12:54:32,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {3044#true} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {3044#true} is VALID [2018-11-23 12:54:32,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {3044#true} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {3044#true} is VALID [2018-11-23 12:54:32,257 INFO L256 TraceCheckUtils]: 33: Hoare triple {3044#true} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {3044#true} is VALID [2018-11-23 12:54:32,258 INFO L273 TraceCheckUtils]: 34: Hoare triple {3044#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 12:54:32,258 INFO L273 TraceCheckUtils]: 35: Hoare triple {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 12:54:32,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 12:54:32,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {3047#(and (= |list_add_#in~new.base| ~elem~0.base) (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 12:54:32,260 INFO L273 TraceCheckUtils]: 38: Hoare triple {3047#(and (= |list_add_#in~new.base| ~elem~0.base) (= ~elem~0.offset |list_add_#in~new.offset|))} assume true; {3047#(and (= |list_add_#in~new.base| ~elem~0.base) (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 12:54:32,261 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3047#(and (= |list_add_#in~new.base| ~elem~0.base) (= ~elem~0.offset |list_add_#in~new.offset|))} {3044#true} #80#return; {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} is VALID [2018-11-23 12:54:32,263 INFO L256 TraceCheckUtils]: 40: Hoare triple {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,264 INFO L273 TraceCheckUtils]: 41: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,264 INFO L273 TraceCheckUtils]: 42: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,265 INFO L273 TraceCheckUtils]: 43: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} assume !(0 != #t~nondet31);havoc #t~nondet31; {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} assume true; {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,269 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} #82#return; {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} is VALID [2018-11-23 12:54:32,270 INFO L256 TraceCheckUtils]: 47: Hoare triple {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} call list_del(~dev2~0.base, ~dev2~0.offset); {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,271 INFO L273 TraceCheckUtils]: 48: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {3050#(and (= list_del_~entry.base |list_del_#in~entry.base|) (= ~elem~0.base |old(~elem~0.base)|) (<= list_del_~entry.offset |list_del_#in~entry.offset|) (= ~elem~0.offset |old(~elem~0.offset)|) (<= |list_del_#in~entry.offset| list_del_~entry.offset))} is VALID [2018-11-23 12:54:32,272 INFO L273 TraceCheckUtils]: 49: Hoare triple {3050#(and (= list_del_~entry.base |list_del_#in~entry.base|) (= ~elem~0.base |old(~elem~0.base)|) (<= list_del_~entry.offset |list_del_#in~entry.offset|) (= ~elem~0.offset |old(~elem~0.offset)|) (<= |list_del_#in~entry.offset| list_del_~entry.offset))} assume !(~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset); {3051#(or (not (= |list_del_#in~entry.offset| |old(~elem~0.offset)|)) (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)))} is VALID [2018-11-23 12:54:32,272 INFO L273 TraceCheckUtils]: 50: Hoare triple {3051#(or (not (= |list_del_#in~entry.offset| |old(~elem~0.offset)|)) (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)))} assume true; {3051#(or (not (= |list_del_#in~entry.offset| |old(~elem~0.offset)|)) (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)))} is VALID [2018-11-23 12:54:32,273 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3051#(or (not (= |list_del_#in~entry.offset| |old(~elem~0.offset)|)) (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)))} {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} #84#return; {3045#false} is VALID [2018-11-23 12:54:32,274 INFO L256 TraceCheckUtils]: 52: Hoare triple {3045#false} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {3045#false} is VALID [2018-11-23 12:54:32,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {3045#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3045#false} is VALID [2018-11-23 12:54:32,274 INFO L273 TraceCheckUtils]: 54: Hoare triple {3045#false} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {3045#false} is VALID [2018-11-23 12:54:32,274 INFO L256 TraceCheckUtils]: 55: Hoare triple {3045#false} call __blast_assert(); {3045#false} is VALID [2018-11-23 12:54:32,275 INFO L273 TraceCheckUtils]: 56: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2018-11-23 12:54:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:54:32,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:32,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:32,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:32,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:32,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3044#true} is VALID [2018-11-23 12:54:32,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {3044#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {3044#true} is VALID [2018-11-23 12:54:32,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2018-11-23 12:54:32,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #72#return; {3044#true} is VALID [2018-11-23 12:54:32,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret34 := main(); {3044#true} is VALID [2018-11-23 12:54:32,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {3044#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {3044#true} is VALID [2018-11-23 12:54:32,560 INFO L256 TraceCheckUtils]: 6: Hoare triple {3044#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8); {3044#true} is VALID [2018-11-23 12:54:32,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {3044#true} ~size := #in~size; {3044#true} is VALID [2018-11-23 12:54:32,560 INFO L256 TraceCheckUtils]: 8: Hoare triple {3044#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {3044#true} is VALID [2018-11-23 12:54:32,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {3044#true} ~size := #in~size; {3044#true} is VALID [2018-11-23 12:54:32,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {3044#true} assume ~size > 0; {3044#true} is VALID [2018-11-23 12:54:32,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {3044#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {3044#true} is VALID [2018-11-23 12:54:32,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {3044#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {3044#true} is VALID [2018-11-23 12:54:32,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {3044#true} assume true; {3044#true} is VALID [2018-11-23 12:54:32,561 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3044#true} {3044#true} #68#return; {3044#true} is VALID [2018-11-23 12:54:32,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {3044#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3044#true} is VALID [2018-11-23 12:54:32,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {3044#true} assume true; {3044#true} is VALID [2018-11-23 12:54:32,562 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3044#true} {3044#true} #76#return; {3044#true} is VALID [2018-11-23 12:54:32,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {3044#true} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {3044#true} is VALID [2018-11-23 12:54:32,562 INFO L256 TraceCheckUtils]: 19: Hoare triple {3044#true} call #t~ret33.base, #t~ret33.offset := my_malloc(8); {3044#true} is VALID [2018-11-23 12:54:32,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {3044#true} ~size := #in~size; {3044#true} is VALID [2018-11-23 12:54:32,562 INFO L256 TraceCheckUtils]: 21: Hoare triple {3044#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {3044#true} is VALID [2018-11-23 12:54:32,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {3044#true} ~size := #in~size; {3044#true} is VALID [2018-11-23 12:54:32,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {3044#true} assume ~size > 0; {3044#true} is VALID [2018-11-23 12:54:32,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {3044#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, 1 + #t~post28.offset;havoc #t~post28.base, #t~post28.offset;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {3044#true} is VALID [2018-11-23 12:54:32,563 INFO L273 TraceCheckUtils]: 25: Hoare triple {3044#true} assume !(0 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {3044#true} is VALID [2018-11-23 12:54:32,563 INFO L273 TraceCheckUtils]: 26: Hoare triple {3044#true} assume true; {3044#true} is VALID [2018-11-23 12:54:32,563 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3044#true} {3044#true} #68#return; {3044#true} is VALID [2018-11-23 12:54:32,563 INFO L273 TraceCheckUtils]: 28: Hoare triple {3044#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3044#true} is VALID [2018-11-23 12:54:32,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {3044#true} assume true; {3044#true} is VALID [2018-11-23 12:54:32,563 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {3044#true} {3044#true} #78#return; {3044#true} is VALID [2018-11-23 12:54:32,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {3044#true} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {3044#true} is VALID [2018-11-23 12:54:32,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {3044#true} assume (~dev1~0.base != 0 || ~dev1~0.offset != 0) && (~dev2~0.base != 0 || ~dev2~0.offset != 0); {3044#true} is VALID [2018-11-23 12:54:32,564 INFO L256 TraceCheckUtils]: 33: Hoare triple {3044#true} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {3044#true} is VALID [2018-11-23 12:54:32,564 INFO L273 TraceCheckUtils]: 34: Hoare triple {3044#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 12:54:32,565 INFO L273 TraceCheckUtils]: 35: Hoare triple {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 12:54:32,565 INFO L273 TraceCheckUtils]: 36: Hoare triple {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 12:54:32,566 INFO L273 TraceCheckUtils]: 37: Hoare triple {3046#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base))} assume 0 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {3047#(and (= |list_add_#in~new.base| ~elem~0.base) (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 12:54:32,566 INFO L273 TraceCheckUtils]: 38: Hoare triple {3047#(and (= |list_add_#in~new.base| ~elem~0.base) (= ~elem~0.offset |list_add_#in~new.offset|))} assume true; {3047#(and (= |list_add_#in~new.base| ~elem~0.base) (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 12:54:32,568 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3047#(and (= |list_add_#in~new.base| ~elem~0.base) (= ~elem~0.offset |list_add_#in~new.offset|))} {3044#true} #80#return; {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} is VALID [2018-11-23 12:54:32,569 INFO L256 TraceCheckUtils]: 40: Hoare triple {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,570 INFO L273 TraceCheckUtils]: 41: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,570 INFO L273 TraceCheckUtils]: 42: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,571 INFO L273 TraceCheckUtils]: 43: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,572 INFO L273 TraceCheckUtils]: 44: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} assume !(0 != #t~nondet31);havoc #t~nondet31; {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,572 INFO L273 TraceCheckUtils]: 45: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} assume true; {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,574 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} #82#return; {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} is VALID [2018-11-23 12:54:32,576 INFO L256 TraceCheckUtils]: 47: Hoare triple {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} call list_del(~dev2~0.base, ~dev2~0.offset); {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} is VALID [2018-11-23 12:54:32,577 INFO L273 TraceCheckUtils]: 48: Hoare triple {3049#(and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {3050#(and (= list_del_~entry.base |list_del_#in~entry.base|) (= ~elem~0.base |old(~elem~0.base)|) (<= list_del_~entry.offset |list_del_#in~entry.offset|) (= ~elem~0.offset |old(~elem~0.offset)|) (<= |list_del_#in~entry.offset| list_del_~entry.offset))} is VALID [2018-11-23 12:54:32,578 INFO L273 TraceCheckUtils]: 49: Hoare triple {3050#(and (= list_del_~entry.base |list_del_#in~entry.base|) (= ~elem~0.base |old(~elem~0.base)|) (<= list_del_~entry.offset |list_del_#in~entry.offset|) (= ~elem~0.offset |old(~elem~0.offset)|) (<= |list_del_#in~entry.offset| list_del_~entry.offset))} assume !(~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset); {3202#(and (= ~elem~0.base |old(~elem~0.base)|) (= ~elem~0.offset |old(~elem~0.offset)|) (or (not (= ~elem~0.base |list_del_#in~entry.base|)) (<= (+ |list_del_#in~entry.offset| 1) ~elem~0.offset) (<= (+ ~elem~0.offset 1) |list_del_#in~entry.offset|)))} is VALID [2018-11-23 12:54:32,579 INFO L273 TraceCheckUtils]: 50: Hoare triple {3202#(and (= ~elem~0.base |old(~elem~0.base)|) (= ~elem~0.offset |old(~elem~0.offset)|) (or (not (= ~elem~0.base |list_del_#in~entry.base|)) (<= (+ |list_del_#in~entry.offset| 1) ~elem~0.offset) (<= (+ ~elem~0.offset 1) |list_del_#in~entry.offset|)))} assume true; {3202#(and (= ~elem~0.base |old(~elem~0.base)|) (= ~elem~0.offset |old(~elem~0.offset)|) (or (not (= ~elem~0.base |list_del_#in~entry.base|)) (<= (+ |list_del_#in~entry.offset| 1) ~elem~0.offset) (<= (+ ~elem~0.offset 1) |list_del_#in~entry.offset|)))} is VALID [2018-11-23 12:54:32,580 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3202#(and (= ~elem~0.base |old(~elem~0.base)|) (= ~elem~0.offset |old(~elem~0.offset)|) (or (not (= ~elem~0.base |list_del_#in~entry.base|)) (<= (+ |list_del_#in~entry.offset| 1) ~elem~0.offset) (<= (+ ~elem~0.offset 1) |list_del_#in~entry.offset|)))} {3048#(and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base))} #84#return; {3045#false} is VALID [2018-11-23 12:54:32,580 INFO L256 TraceCheckUtils]: 52: Hoare triple {3045#false} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {3045#false} is VALID [2018-11-23 12:54:32,581 INFO L273 TraceCheckUtils]: 53: Hoare triple {3045#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3045#false} is VALID [2018-11-23 12:54:32,581 INFO L273 TraceCheckUtils]: 54: Hoare triple {3045#false} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {3045#false} is VALID [2018-11-23 12:54:32,581 INFO L256 TraceCheckUtils]: 55: Hoare triple {3045#false} call __blast_assert(); {3045#false} is VALID [2018-11-23 12:54:32,581 INFO L273 TraceCheckUtils]: 56: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2018-11-23 12:54:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:54:32,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:32,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:54:32,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-11-23 12:54:32,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:32,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:54:32,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:32,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:54:32,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:54:32,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:54:32,669 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 9 states. [2018-11-23 12:54:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:33,335 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:54:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:54:33,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-11-23 12:54:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:54:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2018-11-23 12:54:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:54:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2018-11-23 12:54:33,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2018-11-23 12:54:33,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:33,398 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:54:33,398 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:54:33,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:54:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:54:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:54:33,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:33,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:33,400 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:33,401 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:33,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:33,401 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:54:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:33,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:33,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:33,401 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:33,402 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:33,402 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:54:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:33,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:33,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:33,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:33,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:54:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:54:33,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-11-23 12:54:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:33,403 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:54:33,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:54:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:33,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:33,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:54:34,401 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2018-11-23 12:54:34,694 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 28 [2018-11-23 12:54:34,904 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2018-11-23 12:54:35,478 INFO L448 ceAbstractionStarter]: For program point my_mallocFINAL(lines 878 880) no Hoare annotation was computed. [2018-11-23 12:54:35,479 INFO L444 ceAbstractionStarter]: At program point L879(line 879) the Hoare annotation is: (let ((.cse1 (= 8 my_malloc_~size)) (.cse0 (not (= 8 |my_malloc_#in~size|)))) (and (or (or (not (= ~elem~0.offset 0)) (or (< |old(~guard_malloc_counter~0.offset)| 0) .cse0)) (and .cse1 (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))) (or (and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) .cse1) (< |old(~guard_malloc_counter~0.offset)| 1) .cse0 (< 0 ~elem~0.offset)))) [2018-11-23 12:54:35,479 INFO L448 ceAbstractionStarter]: For program point L879-1(line 879) no Hoare annotation was computed. [2018-11-23 12:54:35,479 INFO L444 ceAbstractionStarter]: At program point my_mallocENTRY(lines 878 880) the Hoare annotation is: (let ((.cse0 (not (= 8 |my_malloc_#in~size|)))) (and (or (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (< |old(~guard_malloc_counter~0.offset)| 1) .cse0 (< 0 ~elem~0.offset)) (or (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (or (not (= ~elem~0.offset 0)) (or (< |old(~guard_malloc_counter~0.offset)| 0) .cse0))))) [2018-11-23 12:54:35,479 INFO L448 ceAbstractionStarter]: For program point my_mallocEXIT(lines 878 880) no Hoare annotation was computed. [2018-11-23 12:54:35,479 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:54:35,479 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)) [2018-11-23 12:54:35,479 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:54:35,479 INFO L448 ceAbstractionStarter]: For program point L896(lines 896 897) no Hoare annotation was computed. [2018-11-23 12:54:35,479 INFO L448 ceAbstractionStarter]: For program point L896-2(lines 895 898) no Hoare annotation was computed. [2018-11-23 12:54:35,480 INFO L448 ceAbstractionStarter]: For program point list_delEXIT(lines 895 898) no Hoare annotation was computed. [2018-11-23 12:54:35,480 INFO L444 ceAbstractionStarter]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (let ((.cse0 (< ~guard_malloc_counter~0.offset 1))) (and (or .cse0 (= |old(~elem~0.offset)| ~elem~0.offset)) (or (= |old(~elem~0.base)| ~elem~0.base) .cse0))) [2018-11-23 12:54:35,480 INFO L444 ceAbstractionStarter]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (let ((.cse1 (= |old(~elem~0.base)| ~elem~0.base)) (.cse0 (< ~guard_malloc_counter~0.offset 1))) (and (or (not (= |old(~elem~0.offset)| 0)) .cse0 (< |list_add_#in~new.offset| 2) .cse1) (or (and (= ~elem~0.offset |old(~elem~0.offset)|) .cse1) .cse0 (< |old(~elem~0.offset)| (+ |list_add_#in~new.offset| 1))) (or (= |old(~elem~0.offset)| ~elem~0.offset) .cse0 (< |list_add_#in~new.offset| (+ |old(~elem~0.offset)| 1))))) [2018-11-23 12:54:35,480 INFO L448 ceAbstractionStarter]: For program point L891(lines 891 892) no Hoare annotation was computed. [2018-11-23 12:54:35,480 INFO L448 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-11-23 12:54:35,480 INFO L448 ceAbstractionStarter]: For program point L891-2(lines 889 893) no Hoare annotation was computed. [2018-11-23 12:54:35,480 INFO L444 ceAbstractionStarter]: At program point L890-2(line 890) the Hoare annotation is: (let ((.cse0 (< ~guard_malloc_counter~0.offset 1))) (and (or .cse0 (< |list_add_#in~new.offset| (+ |old(~elem~0.offset)| 1))) (or .cse0 (< |old(~elem~0.offset)| (+ |list_add_#in~new.offset| 1))))) [2018-11-23 12:54:35,480 INFO L448 ceAbstractionStarter]: For program point L890-3(line 890) no Hoare annotation was computed. [2018-11-23 12:54:35,480 INFO L448 ceAbstractionStarter]: For program point list_addEXIT(lines 889 893) no Hoare annotation was computed. [2018-11-23 12:54:35,480 INFO L448 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-11-23 12:54:35,481 INFO L448 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 12:54:35,481 INFO L448 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-11-23 12:54:35,481 INFO L451 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-11-23 12:54:35,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:54:35,481 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset)) [2018-11-23 12:54:35,481 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:54:35,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:54:35,481 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (or (and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)) (not (= |old(~elem~0.offset)| 0)) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-11-23 12:54:35,481 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 902 917) no Hoare annotation was computed. [2018-11-23 12:54:35,482 INFO L444 ceAbstractionStarter]: At program point L909(line 909) the Hoare annotation is: (let ((.cse0 (<= 1 ~guard_malloc_counter~0.offset)) (.cse1 (<= 2 main_~dev2~0.offset))) (or (not (= |old(~elem~0.offset)| 0)) (and (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) .cse0 .cse1 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset)) (and .cse0 .cse1 (<= ~elem~0.offset 0)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)))) [2018-11-23 12:54:35,482 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 902 917) no Hoare annotation was computed. [2018-11-23 12:54:35,482 INFO L444 ceAbstractionStarter]: At program point L908(line 908) the Hoare annotation is: (let ((.cse0 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)) (.cse1 (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)) (.cse2 (<= 1 ~guard_malloc_counter~0.offset)) (.cse3 (<= 2 main_~dev2~0.offset))) (or (not (= |old(~elem~0.offset)| 0)) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset)) (and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base) .cse0 .cse1 .cse2 .cse3) (and .cse2 .cse3 (<= ~elem~0.offset 0)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)))) [2018-11-23 12:54:35,482 INFO L444 ceAbstractionStarter]: At program point L907(line 907) the Hoare annotation is: (or (not (= |old(~elem~0.offset)| 0)) (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (= ~elem~0.offset |old(~elem~0.offset)|)) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-11-23 12:54:35,482 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2018-11-23 12:54:35,482 INFO L444 ceAbstractionStarter]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse1 (+ main_~dev1~0.offset 1)) (.cse0 (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset))) (or (not (= |old(~elem~0.offset)| 0)) (and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base) .cse0 (<= .cse1 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset) (<= 2 main_~dev2~0.offset)) (and (<= 1 main_~dev1~0.offset) (<= .cse1 main_~dev2~0.offset) .cse0 (= 0 ~elem~0.offset)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)))) [2018-11-23 12:54:35,482 INFO L444 ceAbstractionStarter]: At program point L905(line 905) the Hoare annotation is: (or (not (= |old(~elem~0.offset)| 0)) (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base)) (and (= main_~dev1~0.base 0) (= 0 main_~dev1~0.offset) (<= 1 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0)) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-11-23 12:54:35,482 INFO L448 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2018-11-23 12:54:35,483 INFO L444 ceAbstractionStarter]: At program point L904(line 904) the Hoare annotation is: (or (and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)) (not (= |old(~elem~0.offset)| 0)) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-11-23 12:54:35,483 INFO L448 ceAbstractionStarter]: For program point L905-1(line 905) no Hoare annotation was computed. [2018-11-23 12:54:35,483 INFO L448 ceAbstractionStarter]: For program point L904-1(line 904) no Hoare annotation was computed. [2018-11-23 12:54:35,483 INFO L444 ceAbstractionStarter]: At program point __getMemoryENTRY(lines 869 876) the Hoare annotation is: (or (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (or (not (= ~elem~0.offset 0)) (or (< |old(~guard_malloc_counter~0.offset)| 0) (not (= 8 |__getMemory_#in~size|))))) [2018-11-23 12:54:35,483 INFO L448 ceAbstractionStarter]: For program point __getMemoryEXIT(lines 869 876) no Hoare annotation was computed. [2018-11-23 12:54:35,483 INFO L448 ceAbstractionStarter]: For program point __getMemoryFINAL(lines 869 876) no Hoare annotation was computed. [2018-11-23 12:54:35,483 INFO L448 ceAbstractionStarter]: For program point L873(lines 873 874) no Hoare annotation was computed. [2018-11-23 12:54:35,483 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-11-23 12:54:35,483 INFO L444 ceAbstractionStarter]: At program point L871-2(line 871) the Hoare annotation is: (or (not (= ~elem~0.offset 0)) (or (< |old(~guard_malloc_counter~0.offset)| 0) (not (= 8 |__getMemory_#in~size|)))) [2018-11-23 12:54:35,483 INFO L448 ceAbstractionStarter]: For program point L871-3(line 871) no Hoare annotation was computed. [2018-11-23 12:54:35,486 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:35,486 WARN L170 areAnnotationChecker]: L896 has no Hoare annotation [2018-11-23 12:54:35,486 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2018-11-23 12:54:35,486 WARN L170 areAnnotationChecker]: __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:54:35,486 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 12:54:35,487 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2018-11-23 12:54:35,488 WARN L170 areAnnotationChecker]: L879-1 has no Hoare annotation [2018-11-23 12:54:35,488 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:35,488 WARN L170 areAnnotationChecker]: L896 has no Hoare annotation [2018-11-23 12:54:35,489 WARN L170 areAnnotationChecker]: L896 has no Hoare annotation [2018-11-23 12:54:35,489 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2018-11-23 12:54:35,489 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2018-11-23 12:54:35,489 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 12:54:35,489 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:35,489 WARN L170 areAnnotationChecker]: L904-1 has no Hoare annotation [2018-11-23 12:54:35,491 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2018-11-23 12:54:35,491 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2018-11-23 12:54:35,491 WARN L170 areAnnotationChecker]: L879-1 has no Hoare annotation [2018-11-23 12:54:35,491 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:35,491 WARN L170 areAnnotationChecker]: L896-2 has no Hoare annotation [2018-11-23 12:54:35,492 WARN L170 areAnnotationChecker]: L890-3 has no Hoare annotation [2018-11-23 12:54:35,492 WARN L170 areAnnotationChecker]: L890-3 has no Hoare annotation [2018-11-23 12:54:35,492 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 12:54:35,492 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 12:54:35,492 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:35,493 WARN L170 areAnnotationChecker]: L904-1 has no Hoare annotation [2018-11-23 12:54:35,493 WARN L170 areAnnotationChecker]: L871-3 has no Hoare annotation [2018-11-23 12:54:35,493 WARN L170 areAnnotationChecker]: L871-3 has no Hoare annotation [2018-11-23 12:54:35,493 WARN L170 areAnnotationChecker]: my_mallocFINAL has no Hoare annotation [2018-11-23 12:54:35,493 WARN L170 areAnnotationChecker]: list_delEXIT has no Hoare annotation [2018-11-23 12:54:35,493 WARN L170 areAnnotationChecker]: L891 has no Hoare annotation [2018-11-23 12:54:35,494 WARN L170 areAnnotationChecker]: L891 has no Hoare annotation [2018-11-23 12:54:35,494 WARN L170 areAnnotationChecker]: L905-1 has no Hoare annotation [2018-11-23 12:54:35,510 WARN L170 areAnnotationChecker]: L873 has no Hoare annotation [2018-11-23 12:54:35,510 WARN L170 areAnnotationChecker]: L873 has no Hoare annotation [2018-11-23 12:54:35,510 WARN L170 areAnnotationChecker]: my_mallocEXIT has no Hoare annotation [2018-11-23 12:54:35,510 WARN L170 areAnnotationChecker]: my_mallocEXIT has no Hoare annotation [2018-11-23 12:54:35,510 WARN L170 areAnnotationChecker]: L906-1 has no Hoare annotation [2018-11-23 12:54:35,526 WARN L170 areAnnotationChecker]: L891-2 has no Hoare annotation [2018-11-23 12:54:35,526 WARN L170 areAnnotationChecker]: L905-1 has no Hoare annotation [2018-11-23 12:54:35,526 WARN L170 areAnnotationChecker]: __getMemoryFINAL has no Hoare annotation [2018-11-23 12:54:35,526 WARN L170 areAnnotationChecker]: L906-1 has no Hoare annotation [2018-11-23 12:54:35,526 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2018-11-23 12:54:35,526 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2018-11-23 12:54:35,527 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2018-11-23 12:54:35,527 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2018-11-23 12:54:35,527 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2018-11-23 12:54:35,527 WARN L170 areAnnotationChecker]: __getMemoryEXIT has no Hoare annotation [2018-11-23 12:54:35,527 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:35,534 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:35,534 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:54:35,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:35 BoogieIcfgContainer [2018-11-23 12:54:35,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:35,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:35,537 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:35,538 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:35,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:00" (3/4) ... [2018-11-23 12:54:35,541 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:54:35,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_malloc [2018-11-23 12:54:35,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:54:35,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure list_del [2018-11-23 12:54:35,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add [2018-11-23 12:54:35,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-11-23 12:54:35,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:54:35,549 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __getMemory [2018-11-23 12:54:35,554 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-23 12:54:35,554 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 12:54:35,554 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:54:35,621 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i-witness.graphml [2018-11-23 12:54:35,621 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:35,626 INFO L168 Benchmark]: Toolchain (without parser) took 37090.18 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -233.5 MB). Peak memory consumption was 850.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:35,627 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:35,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:35,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.25 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 656.9 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -735.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:35,628 INFO L168 Benchmark]: Boogie Preprocessor took 54.85 ms. Allocated memory is still 2.1 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:35,628 INFO L168 Benchmark]: RCFGBuilder took 945.32 ms. Allocated memory is still 2.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:35,629 INFO L168 Benchmark]: TraceAbstraction took 35204.98 ms. Allocated memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: 427.3 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 430.3 MB). Peak memory consumption was 857.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:35,629 INFO L168 Benchmark]: Witness Printer took 83.94 ms. Allocated memory is still 2.6 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:35,632 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 651.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 140.25 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 656.9 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -735.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.85 ms. Allocated memory is still 2.1 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 945.32 ms. Allocated memory is still 2.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35204.98 ms. Allocated memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: 427.3 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 430.3 MB). Peak memory consumption was 857.6 MB. Max. memory is 7.1 GB. * Witness Printer took 83.94 ms. Allocated memory is still 2.6 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 47 locations, 1 error locations. SAFE Result, 35.0s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 282 SDtfs, 445 SDslu, 1262 SDs, 0 SdLazy, 3838 SolverSat, 455 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 272 SyntacticMatches, 11 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 71 PreInvPairs, 82 NumberOfFragments, 462 HoareAnnotationTreeSize, 71 FomulaSimplifications, 659 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 1704 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 109006 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1627 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 136/211 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...