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/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:57:50,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:57:50,394 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:57:50,408 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:57:50,408 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:57:50,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:57:50,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:57:50,413 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:57:50,415 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:57:50,416 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:57:50,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:57:50,417 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:57:50,418 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:57:50,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:57:50,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:57:50,424 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:57:50,425 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:57:50,429 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:57:50,434 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:57:50,440 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:57:50,441 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:57:50,447 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:57:50,450 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:57:50,450 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:57:50,450 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:57:50,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:57:50,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:57:50,454 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:57:50,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:57:50,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:57:50,456 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:57:50,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:57:50,458 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:57:50,459 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:57:50,460 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:57:50,460 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:57:50,461 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:57:50,484 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:57:50,487 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:57:50,488 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:57:50,489 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:57:50,492 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:57:50,492 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:57:50,492 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:57:50,493 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:57:50,493 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:57:50,493 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:57:50,493 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:57:50,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:57:50,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:57:50,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:57:50,495 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:57:50,496 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:57:50,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:57:50,496 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:57:50,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:57:50,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:57:50,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:57:50,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:57:50,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:57:50,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:57:50,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:57:50,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:57:50,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:57:50,499 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:57:50,500 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:57:50,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:57:50,500 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:57:50,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:57:50,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:57:50,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:57:50,589 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:57:50,590 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:57:50,590 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:57:50,664 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7423d70e/d4c0f8a0546d45a0a67922c91c3a5402/FLAG3e5694beb [2018-11-23 12:57:51,225 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:57:51,225 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:57:51,242 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7423d70e/d4c0f8a0546d45a0a67922c91c3a5402/FLAG3e5694beb [2018-11-23 12:57:51,503 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7423d70e/d4c0f8a0546d45a0a67922c91c3a5402 [2018-11-23 12:57:51,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:57:51,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:57:51,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:57:51,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:57:51,520 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:57:51,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:57:51" (1/1) ... [2018-11-23 12:57:51,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eec3e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:51, skipping insertion in model container [2018-11-23 12:57:51,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:57:51" (1/1) ... [2018-11-23 12:57:51,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:57:51,600 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:57:51,988 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:57:52,001 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:57:52,076 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:57:52,139 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:57:52,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:52 WrapperNode [2018-11-23 12:57:52,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:57:52,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:57:52,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:57:52,141 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:57:52,227 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:57:52" (1/1) ... [2018-11-23 12:57:52,250 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:57:52" (1/1) ... [2018-11-23 12:57:52,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:57:52,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:57:52,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:57:52,263 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:57:52,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:52" (1/1) ... [2018-11-23 12:57:52,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:52" (1/1) ... [2018-11-23 12:57:52,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:52" (1/1) ... [2018-11-23 12:57:52,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:52" (1/1) ... [2018-11-23 12:57:52,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:52" (1/1) ... [2018-11-23 12:57:52,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:52" (1/1) ... [2018-11-23 12:57:52,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:52" (1/1) ... [2018-11-23 12:57:52,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:57:52,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:57:52,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:57:52,306 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:57:52,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:52" (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:57:52,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:57:52,368 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:57:52,368 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:57:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2018-11-23 12:57:52,369 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2018-11-23 12:57:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:57:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:57:52,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:57:52,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:57:52,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:57:52,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:57:52,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:57:52,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:57:52,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:57:52,371 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 12:57:52,371 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 12:57:52,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:57:52,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:57:53,305 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:57:53,306 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:57:53,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:57:53 BoogieIcfgContainer [2018-11-23 12:57:53,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:57:53,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:57:53,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:57:53,311 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:57:53,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:57:51" (1/3) ... [2018-11-23 12:57:53,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f390ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:57:53, skipping insertion in model container [2018-11-23 12:57:53,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:52" (2/3) ... [2018-11-23 12:57:53,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f390ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:57:53, skipping insertion in model container [2018-11-23 12:57:53,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:57:53" (3/3) ... [2018-11-23 12:57:53,315 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:57:53,326 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:57:53,335 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:57:53,355 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:57:53,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:57:53,389 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:57:53,390 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:57:53,390 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:57:53,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:57:53,390 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:57:53,391 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:57:53,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:57:53,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:57:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 12:57:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:57:53,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:53,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:57:53,422 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:53,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:53,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1142562166, now seen corresponding path program 1 times [2018-11-23 12:57:53,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:53,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:53,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:53,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:53,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:53,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 12:57:53,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 12:57:53,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:57:53,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #78#return; {39#true} is VALID [2018-11-23 12:57:53,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret11 := main(); {39#true} is VALID [2018-11-23 12:57:53,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {39#true} is VALID [2018-11-23 12:57:53,608 INFO L256 TraceCheckUtils]: 6: Hoare triple {39#true} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {39#true} is VALID [2018-11-23 12:57:53,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {39#true} is VALID [2018-11-23 12:57:53,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 12:57:53,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {40#false} is VALID [2018-11-23 12:57:53,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-23 12:57:53,613 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #82#return; {40#false} is VALID [2018-11-23 12:57:53,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {40#false} is VALID [2018-11-23 12:57:53,614 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 >= 0); {40#false} is VALID [2018-11-23 12:57:53,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {40#false} is VALID [2018-11-23 12:57:53,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {40#false} is VALID [2018-11-23 12:57:53,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 12:57:53,619 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:57:53,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:57:53,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:57:53,628 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:57:53,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:57:53,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:57:53,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:53,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:57:53,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:57:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:57:53,749 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 12:57:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:54,142 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:57:54,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:57:54,142 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:57:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:57:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:57:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 12:57:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:57:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 12:57:54,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2018-11-23 12:57:54,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:54,441 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:57:54,441 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:57:54,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:57:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:57:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 12:57:54,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:57:54,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 12:57:54,487 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:57:54,487 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:57:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:54,493 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:57:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:57:54,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:54,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:54,494 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:57:54,495 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:57:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:54,499 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:57:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:57:54,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:54,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:54,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:57:54,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:57:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:57:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 12:57:54,505 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 17 [2018-11-23 12:57:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:57:54,506 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 12:57:54,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:57:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:57:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:57:54,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:54,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:57:54,507 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:54,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1124458595, now seen corresponding path program 1 times [2018-11-23 12:57:54,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:54,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:54,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:54,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-23 12:57:54,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {215#true} is VALID [2018-11-23 12:57:54,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-23 12:57:54,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #78#return; {215#true} is VALID [2018-11-23 12:57:54,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret11 := main(); {215#true} is VALID [2018-11-23 12:57:54,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {215#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {217#(<= 2 main_~len~0)} is VALID [2018-11-23 12:57:54,632 INFO L256 TraceCheckUtils]: 6: Hoare triple {217#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {215#true} is VALID [2018-11-23 12:57:54,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {215#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {215#true} is VALID [2018-11-23 12:57:54,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#true} assume !(~len > 0); {215#true} is VALID [2018-11-23 12:57:54,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {215#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {215#true} is VALID [2018-11-23 12:57:54,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-23 12:57:54,636 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {215#true} {217#(<= 2 main_~len~0)} #82#return; {217#(<= 2 main_~len~0)} is VALID [2018-11-23 12:57:54,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {217#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {218#(<= 1 main_~i~0)} is VALID [2018-11-23 12:57:54,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {218#(<= 1 main_~i~0)} assume !(~i~0 >= 0); {216#false} is VALID [2018-11-23 12:57:54,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {216#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {216#false} is VALID [2018-11-23 12:57:54,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {216#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {216#false} is VALID [2018-11-23 12:57:54,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-23 12:57:54,642 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:57:54,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:57:54,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:57:54,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 12:57:54,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:57:54,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:57:54,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:54,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:57:54,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:57:54,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:57:54,790 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2018-11-23 12:57:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:55,442 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 12:57:55,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:57:55,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 12:57:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:57:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:57:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-23 12:57:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:57:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-23 12:57:55,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2018-11-23 12:57:55,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:55,543 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:57:55,543 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:57:55,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:57:55,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:57:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 12:57:55,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:57:55,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-23 12:57:55,576 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-23 12:57:55,576 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-23 12:57:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:55,581 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:57:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:57:55,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:55,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:55,583 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-23 12:57:55,583 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-23 12:57:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:55,586 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:57:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:57:55,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:55,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:55,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:57:55,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:57:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:57:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-23 12:57:55,591 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2018-11-23 12:57:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:57:55,591 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-23 12:57:55,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:57:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:57:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:57:55,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:55,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:57:55,593 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:55,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2086072823, now seen corresponding path program 1 times [2018-11-23 12:57:55,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:55,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:55,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:55,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:55,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:55,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2018-11-23 12:57:55,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {379#true} is VALID [2018-11-23 12:57:55,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2018-11-23 12:57:55,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #78#return; {379#true} is VALID [2018-11-23 12:57:55,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret11 := main(); {379#true} is VALID [2018-11-23 12:57:55,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {379#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {381#(<= 2 main_~len~0)} is VALID [2018-11-23 12:57:55,747 INFO L256 TraceCheckUtils]: 6: Hoare triple {381#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {379#true} is VALID [2018-11-23 12:57:55,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {379#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {382#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:55,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {382#(<= |dll_create_#in~len| dll_create_~len)} assume !(~len > 0); {383#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:57:55,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {383#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {383#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:57:55,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {383#(<= |dll_create_#in~len| 0)} assume true; {383#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:57:55,764 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {383#(<= |dll_create_#in~len| 0)} {381#(<= 2 main_~len~0)} #82#return; {380#false} is VALID [2018-11-23 12:57:55,765 INFO L273 TraceCheckUtils]: 12: Hoare triple {380#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {380#false} is VALID [2018-11-23 12:57:55,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {380#false} assume !!(~i~0 >= 0); {380#false} is VALID [2018-11-23 12:57:55,766 INFO L256 TraceCheckUtils]: 14: Hoare triple {380#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {379#true} is VALID [2018-11-23 12:57:55,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {379#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {379#true} is VALID [2018-11-23 12:57:55,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {379#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {379#true} is VALID [2018-11-23 12:57:55,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {379#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {379#true} is VALID [2018-11-23 12:57:55,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {379#true} assume true; {379#true} is VALID [2018-11-23 12:57:55,767 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {379#true} {380#false} #84#return; {380#false} is VALID [2018-11-23 12:57:55,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {380#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {380#false} is VALID [2018-11-23 12:57:55,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {380#false} assume !(~i~0 >= 0); {380#false} is VALID [2018-11-23 12:57:55,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {380#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {380#false} is VALID [2018-11-23 12:57:55,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {380#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {380#false} is VALID [2018-11-23 12:57:55,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {380#false} assume !false; {380#false} is VALID [2018-11-23 12:57:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:57:55,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:57:55,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:57:55,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 12:57:55,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:57:55,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:57:55,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:55,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:57:55,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:57:55,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:57:55,902 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-11-23 12:57:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:56,235 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 12:57:56,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:57:56,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 12:57:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:57:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:57:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-23 12:57:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:57:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-23 12:57:56,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2018-11-23 12:57:56,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:56,318 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:57:56,318 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:57:56,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:57:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:57:56,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-23 12:57:56,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:57:56,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2018-11-23 12:57:56,348 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2018-11-23 12:57:56,348 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2018-11-23 12:57:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:56,351 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 12:57:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:57:56,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:56,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:56,352 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2018-11-23 12:57:56,352 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2018-11-23 12:57:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:56,355 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 12:57:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:57:56,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:56,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:56,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:57:56,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:57:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:57:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-23 12:57:56,359 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 25 [2018-11-23 12:57:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:57:56,360 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-23 12:57:56,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:57:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 12:57:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:57:56,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:56,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:57:56,362 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:56,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1975237235, now seen corresponding path program 1 times [2018-11-23 12:57:56,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:56,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:56,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:56,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:56,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:56,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {572#true} call ULTIMATE.init(); {572#true} is VALID [2018-11-23 12:57:56,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {572#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {572#true} is VALID [2018-11-23 12:57:56,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {572#true} assume true; {572#true} is VALID [2018-11-23 12:57:56,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {572#true} {572#true} #78#return; {572#true} is VALID [2018-11-23 12:57:56,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {572#true} call #t~ret11 := main(); {572#true} is VALID [2018-11-23 12:57:56,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {572#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {572#true} is VALID [2018-11-23 12:57:56,464 INFO L256 TraceCheckUtils]: 6: Hoare triple {572#true} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {572#true} is VALID [2018-11-23 12:57:56,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {572#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {574#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:57:56,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {574#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {574#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:57:56,473 INFO L273 TraceCheckUtils]: 9: Hoare triple {574#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {574#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:57:56,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {574#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-23 12:57:56,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {573#false} is VALID [2018-11-23 12:57:56,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {573#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {573#false} is VALID [2018-11-23 12:57:56,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {573#false} assume !(~len > 0); {573#false} is VALID [2018-11-23 12:57:56,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {573#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {573#false} is VALID [2018-11-23 12:57:56,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {573#false} assume true; {573#false} is VALID [2018-11-23 12:57:56,478 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {573#false} {572#true} #82#return; {573#false} is VALID [2018-11-23 12:57:56,478 INFO L273 TraceCheckUtils]: 17: Hoare triple {573#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {573#false} is VALID [2018-11-23 12:57:56,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {573#false} assume !!(~i~0 >= 0); {573#false} is VALID [2018-11-23 12:57:56,479 INFO L256 TraceCheckUtils]: 19: Hoare triple {573#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {572#true} is VALID [2018-11-23 12:57:56,479 INFO L273 TraceCheckUtils]: 20: Hoare triple {572#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {572#true} is VALID [2018-11-23 12:57:56,479 INFO L273 TraceCheckUtils]: 21: Hoare triple {572#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {572#true} is VALID [2018-11-23 12:57:56,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {572#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {572#true} is VALID [2018-11-23 12:57:56,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {572#true} assume true; {572#true} is VALID [2018-11-23 12:57:56,480 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {572#true} {573#false} #84#return; {573#false} is VALID [2018-11-23 12:57:56,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {573#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {573#false} is VALID [2018-11-23 12:57:56,481 INFO L273 TraceCheckUtils]: 26: Hoare triple {573#false} assume !(~i~0 >= 0); {573#false} is VALID [2018-11-23 12:57:56,481 INFO L273 TraceCheckUtils]: 27: Hoare triple {573#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {573#false} is VALID [2018-11-23 12:57:56,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {573#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {573#false} is VALID [2018-11-23 12:57:56,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {573#false} assume !false; {573#false} is VALID [2018-11-23 12:57:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:57:56,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:57:56,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:57:56,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:57:56,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:57:56,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:57:56,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:56,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:57:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:57:56,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:57:56,547 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2018-11-23 12:57:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:56,670 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 12:57:56,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:57:56,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:57:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:57:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:57:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 12:57:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:57:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 12:57:56,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 12:57:56,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:56,828 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:57:56,828 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:57:56,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:57:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:57:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 12:57:56,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:57:56,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 12:57:56,860 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 12:57:56,860 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 12:57:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:56,863 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 12:57:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 12:57:56,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:56,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:56,864 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 12:57:56,864 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 12:57:56,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:56,866 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 12:57:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 12:57:56,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:56,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:56,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:57:56,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:57:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:57:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 12:57:56,870 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 30 [2018-11-23 12:57:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:57:56,871 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 12:57:56,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:57:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 12:57:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:57:56,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:56,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:57:56,873 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:56,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:56,873 INFO L82 PathProgramCache]: Analyzing trace with hash 286293493, now seen corresponding path program 1 times [2018-11-23 12:57:56,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:56,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:56,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:57,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {770#true} call ULTIMATE.init(); {770#true} is VALID [2018-11-23 12:57:57,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {770#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {770#true} is VALID [2018-11-23 12:57:57,048 INFO L273 TraceCheckUtils]: 2: Hoare triple {770#true} assume true; {770#true} is VALID [2018-11-23 12:57:57,049 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {770#true} {770#true} #78#return; {770#true} is VALID [2018-11-23 12:57:57,049 INFO L256 TraceCheckUtils]: 4: Hoare triple {770#true} call #t~ret11 := main(); {770#true} is VALID [2018-11-23 12:57:57,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {770#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {772#(<= 2 main_~len~0)} is VALID [2018-11-23 12:57:57,053 INFO L256 TraceCheckUtils]: 6: Hoare triple {772#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {770#true} is VALID [2018-11-23 12:57:57,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {770#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {770#true} is VALID [2018-11-23 12:57:57,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {770#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {770#true} is VALID [2018-11-23 12:57:57,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {770#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {770#true} is VALID [2018-11-23 12:57:57,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {770#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {770#true} is VALID [2018-11-23 12:57:57,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {770#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {770#true} is VALID [2018-11-23 12:57:57,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {770#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {770#true} is VALID [2018-11-23 12:57:57,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {770#true} assume !(~len > 0); {770#true} is VALID [2018-11-23 12:57:57,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {770#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {770#true} is VALID [2018-11-23 12:57:57,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {770#true} assume true; {770#true} is VALID [2018-11-23 12:57:57,062 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {770#true} {772#(<= 2 main_~len~0)} #82#return; {772#(<= 2 main_~len~0)} is VALID [2018-11-23 12:57:57,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {772#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {773#(<= 1 main_~i~0)} is VALID [2018-11-23 12:57:57,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {773#(<= 1 main_~i~0)} assume !!(~i~0 >= 0); {773#(<= 1 main_~i~0)} is VALID [2018-11-23 12:57:57,068 INFO L256 TraceCheckUtils]: 19: Hoare triple {773#(<= 1 main_~i~0)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {770#true} is VALID [2018-11-23 12:57:57,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {770#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {770#true} is VALID [2018-11-23 12:57:57,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {770#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {770#true} is VALID [2018-11-23 12:57:57,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {770#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {770#true} is VALID [2018-11-23 12:57:57,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {770#true} assume true; {770#true} is VALID [2018-11-23 12:57:57,072 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {770#true} {773#(<= 1 main_~i~0)} #84#return; {773#(<= 1 main_~i~0)} is VALID [2018-11-23 12:57:57,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {773#(<= 1 main_~i~0)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {774#(<= 0 main_~i~0)} is VALID [2018-11-23 12:57:57,076 INFO L273 TraceCheckUtils]: 26: Hoare triple {774#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {771#false} is VALID [2018-11-23 12:57:57,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {771#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {771#false} is VALID [2018-11-23 12:57:57,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {771#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {771#false} is VALID [2018-11-23 12:57:57,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {771#false} assume !false; {771#false} is VALID [2018-11-23 12:57:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:57:57,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:57:57,078 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:57:57,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:57,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:57:57,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {770#true} call ULTIMATE.init(); {770#true} is VALID [2018-11-23 12:57:57,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {770#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {770#true} is VALID [2018-11-23 12:57:57,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {770#true} assume true; {770#true} is VALID [2018-11-23 12:57:57,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {770#true} {770#true} #78#return; {770#true} is VALID [2018-11-23 12:57:57,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {770#true} call #t~ret11 := main(); {770#true} is VALID [2018-11-23 12:57:57,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {770#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {772#(<= 2 main_~len~0)} is VALID [2018-11-23 12:57:57,649 INFO L256 TraceCheckUtils]: 6: Hoare triple {772#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {770#true} is VALID [2018-11-23 12:57:57,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {770#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {799#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:57,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {799#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {799#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:57,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {799#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {799#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:57,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {799#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {799#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:57,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {799#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:57,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {799#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {815#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-23 12:57:57,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {815#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {819#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:57:57,661 INFO L273 TraceCheckUtils]: 14: Hoare triple {819#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {819#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:57:57,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {819#(<= |dll_create_#in~len| 1)} assume true; {819#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:57:57,663 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {819#(<= |dll_create_#in~len| 1)} {772#(<= 2 main_~len~0)} #82#return; {771#false} is VALID [2018-11-23 12:57:57,663 INFO L273 TraceCheckUtils]: 17: Hoare triple {771#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {771#false} is VALID [2018-11-23 12:57:57,663 INFO L273 TraceCheckUtils]: 18: Hoare triple {771#false} assume !!(~i~0 >= 0); {771#false} is VALID [2018-11-23 12:57:57,663 INFO L256 TraceCheckUtils]: 19: Hoare triple {771#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {771#false} is VALID [2018-11-23 12:57:57,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {771#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {771#false} is VALID [2018-11-23 12:57:57,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {771#false} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {771#false} is VALID [2018-11-23 12:57:57,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {771#false} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {771#false} is VALID [2018-11-23 12:57:57,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {771#false} assume true; {771#false} is VALID [2018-11-23 12:57:57,664 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {771#false} {771#false} #84#return; {771#false} is VALID [2018-11-23 12:57:57,664 INFO L273 TraceCheckUtils]: 25: Hoare triple {771#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {771#false} is VALID [2018-11-23 12:57:57,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {771#false} assume !(~i~0 >= 0); {771#false} is VALID [2018-11-23 12:57:57,665 INFO L273 TraceCheckUtils]: 27: Hoare triple {771#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {771#false} is VALID [2018-11-23 12:57:57,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {771#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {771#false} is VALID [2018-11-23 12:57:57,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {771#false} assume !false; {771#false} is VALID [2018-11-23 12:57:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:57:57,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:57:57,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 12:57:57,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-23 12:57:57,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:57:57,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:57:57,838 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:57:57,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:57:57,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:57:57,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:57:57,839 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 8 states. [2018-11-23 12:57:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:58,424 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 12:57:58,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:57:58,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-23 12:57:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:57:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:57:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-23 12:57:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:57:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-23 12:57:58,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 67 transitions. [2018-11-23 12:57:58,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:58,595 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:57:58,595 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:57:58,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:57:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:57:58,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-23 12:57:58,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:57:58,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 39 states. [2018-11-23 12:57:58,623 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 39 states. [2018-11-23 12:57:58,624 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 39 states. [2018-11-23 12:57:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:58,628 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:57:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 12:57:58,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:58,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:58,629 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states. [2018-11-23 12:57:58,630 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states. [2018-11-23 12:57:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:58,632 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:57:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 12:57:58,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:58,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:58,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:57:58,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:57:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:57:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:57:58,636 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 30 [2018-11-23 12:57:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:57:58,637 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:57:58,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:57:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:57:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:57:58,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:58,639 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:57:58,639 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:58,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:58,639 INFO L82 PathProgramCache]: Analyzing trace with hash -788093011, now seen corresponding path program 1 times [2018-11-23 12:57:58,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:58,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:58,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:58,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:58,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:59,804 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-11-23 12:58:00,167 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: select-over-store with same index should have been removed at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:72) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:58:00,173 INFO L168 Benchmark]: Toolchain (without parser) took 8659.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -286.0 MB). Peak memory consumption was 445.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:00,174 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:58:00,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 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:58:00,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:00,176 INFO L168 Benchmark]: Boogie Preprocessor took 43.02 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:58:00,177 INFO L168 Benchmark]: RCFGBuilder took 1000.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:00,177 INFO L168 Benchmark]: TraceAbstraction took 6863.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 455.3 MB). Peak memory consumption was 455.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:00,182 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 626.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 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 121.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.02 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1000.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6863.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 455.3 MB). Peak memory consumption was 455.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: select-over-store with same index should have been removed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: select-over-store with same index should have been removed: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:72) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...