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/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:45,574 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:45,576 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:45,591 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:45,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:45,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:45,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:45,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:45,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:45,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:45,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:45,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:45,618 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:45,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:45,622 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:45,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:45,632 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:45,635 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:45,637 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:45,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:45,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:45,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:45,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:45,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:45,646 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:45,651 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:45,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:45,657 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:45,658 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:45,660 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:45,660 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:45,661 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:45,661 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:45,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:45,663 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:45,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:45,664 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 13:04:45,678 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:45,679 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:45,680 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:45,680 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:45,681 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:45,681 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:45,681 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:45,681 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:45,681 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:45,682 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:45,682 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:45,682 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:45,682 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:45,682 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:45,683 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:45,683 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:45,683 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:45,683 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:45,683 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:45,683 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:45,684 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:45,684 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:45,684 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:45,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:45,684 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:45,685 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:45,685 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:45,685 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:45,685 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:45,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:45,686 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:45,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:45,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:45,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:45,750 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:45,751 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:45,751 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-23 13:04:45,811 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3ca73ab/e7b6dc2b090b42f0920b2739f03f4281/FLAG5a9bd4b52 [2018-11-23 13:04:46,260 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:46,261 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-23 13:04:46,269 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3ca73ab/e7b6dc2b090b42f0920b2739f03f4281/FLAG5a9bd4b52 [2018-11-23 13:04:46,620 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3ca73ab/e7b6dc2b090b42f0920b2739f03f4281 [2018-11-23 13:04:46,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:46,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:46,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:46,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:46,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:46,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:46" (1/1) ... [2018-11-23 13:04:46,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75123985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:46, skipping insertion in model container [2018-11-23 13:04:46,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:46" (1/1) ... [2018-11-23 13:04:46,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:46,685 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:46,984 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:47,000 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:47,063 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:47,103 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:47,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47 WrapperNode [2018-11-23 13:04:47,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:47,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:47,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:47,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:47,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:47,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:47,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:47,141 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:47,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:47,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:47,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:47,280 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:47,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (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 13:04:47,347 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-23 13:04:47,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:47,347 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:47,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:04:47,348 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2018-11-23 13:04:47,348 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2018-11-23 13:04:47,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:04:47,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:04:47,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:47,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:47,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:47,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:47,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:47,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:47,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:04:48,396 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:48,397 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 13:04:48,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:48 BoogieIcfgContainer [2018-11-23 13:04:48,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:48,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:48,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:48,402 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:48,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:46" (1/3) ... [2018-11-23 13:04:48,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e155467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:48, skipping insertion in model container [2018-11-23 13:04:48,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (2/3) ... [2018-11-23 13:04:48,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e155467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:48, skipping insertion in model container [2018-11-23 13:04:48,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:48" (3/3) ... [2018-11-23 13:04:48,406 INFO L112 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-23 13:04:48,415 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:48,423 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:48,442 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:48,474 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:48,475 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:48,475 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:48,476 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:48,476 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:48,476 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:48,477 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:48,477 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:48,477 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 13:04:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:04:48,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:48,503 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] [2018-11-23 13:04:48,506 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:48,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1305434758, now seen corresponding path program 1 times [2018-11-23 13:04:48,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:48,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:48,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:48,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:48,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 13:04:48,725 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53#true} is VALID [2018-11-23 13:04:48,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 13:04:48,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53#true} {53#true} #143#return; {53#true} is VALID [2018-11-23 13:04:48,726 INFO L256 TraceCheckUtils]: 4: Hoare triple {53#true} call #t~ret22 := main(); {53#true} is VALID [2018-11-23 13:04:48,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9);~i~1 := 0; {55#(= main_~i~1 0)} is VALID [2018-11-23 13:04:48,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {55#(= main_~i~1 0)} assume !(~i~1 < 8); {54#false} is VALID [2018-11-23 13:04:48,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {54#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {54#false} is VALID [2018-11-23 13:04:48,737 INFO L256 TraceCheckUtils]: 8: Hoare triple {54#false} call #t~ret21 := parse_expression_list(~#A~0.base, ~#A~0.offset); {54#false} is VALID [2018-11-23 13:04:48,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {54#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2); {54#false} is VALID [2018-11-23 13:04:48,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {54#false} assume !(~str.base == 0 && ~str.offset == 0); {54#false} is VALID [2018-11-23 13:04:48,738 INFO L273 TraceCheckUtils]: 11: Hoare triple {54#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch3 := 0 == #t~mem2; {54#false} is VALID [2018-11-23 13:04:48,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {54#false} assume #t~switch3; {54#false} is VALID [2018-11-23 13:04:48,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {54#false} assume !true; {54#false} is VALID [2018-11-23 13:04:48,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {54#false} call #t~mem8 := read~int(~str.base, ~str.offset + ~start~0, 1); {54#false} is VALID [2018-11-23 13:04:48,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {54#false} assume 34 == #t~mem8;havoc #t~mem8;#t~post9 := ~start~0;~start~0 := 1 + #t~post9;havoc #t~post9; {54#false} is VALID [2018-11-23 13:04:48,740 INFO L273 TraceCheckUtils]: 16: Hoare triple {54#false} ~j~0 := ~i~0 - 1; {54#false} is VALID [2018-11-23 13:04:48,740 INFO L273 TraceCheckUtils]: 17: Hoare triple {54#false} assume !true; {54#false} is VALID [2018-11-23 13:04:48,741 INFO L273 TraceCheckUtils]: 18: Hoare triple {54#false} #t~short16 := 0 < ~j~0; {54#false} is VALID [2018-11-23 13:04:48,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {54#false} assume #t~short16;call #t~mem15 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short16 := 34 == #t~mem15; {54#false} is VALID [2018-11-23 13:04:48,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {54#false} assume #t~short16;havoc #t~short16;havoc #t~mem15;#t~post17 := ~j~0;~j~0 := #t~post17 - 1;havoc #t~post17; {54#false} is VALID [2018-11-23 13:04:48,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {54#false} assume ~start~0 <= ~j~0; {54#false} is VALID [2018-11-23 13:04:48,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {54#false} assume !(1 + (~j~0 - ~start~0) >= 2);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0));havoc #t~ret18.base, #t~ret18.offset; {54#false} is VALID [2018-11-23 13:04:48,742 INFO L256 TraceCheckUtils]: 23: Hoare triple {54#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {54#false} is VALID [2018-11-23 13:04:48,743 INFO L273 TraceCheckUtils]: 24: Hoare triple {54#false} ~cond := #in~cond; {54#false} is VALID [2018-11-23 13:04:48,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {54#false} assume 0 == ~cond; {54#false} is VALID [2018-11-23 13:04:48,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 13:04:48,748 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 13:04:48,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:48,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:48,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 13:04:48,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:48,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:48,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:48,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:48,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:48,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:48,843 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-23 13:04:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:49,226 INFO L93 Difference]: Finished difference Result 94 states and 132 transitions. [2018-11-23 13:04:49,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:49,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 13:04:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-23 13:04:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-23 13:04:49,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2018-11-23 13:04:49,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:49,998 INFO L225 Difference]: With dead ends: 94 [2018-11-23 13:04:49,998 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:04:50,002 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 13:04:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:04:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 13:04:50,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:50,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 13:04:50,054 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 13:04:50,054 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 13:04:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:50,060 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 13:04:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 13:04:50,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:50,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:50,061 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 13:04:50,062 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 13:04:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:50,067 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 13:04:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 13:04:50,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:50,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:50,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:50,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:04:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-11-23 13:04:50,074 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2018-11-23 13:04:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:50,075 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 13:04:50,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 13:04:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:04:50,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:50,077 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, 1, 1, 1] [2018-11-23 13:04:50,078 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:50,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash 81548623, now seen corresponding path program 1 times [2018-11-23 13:04:50,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:50,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:50,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2018-11-23 13:04:50,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {316#true} is VALID [2018-11-23 13:04:50,233 INFO L273 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2018-11-23 13:04:50,233 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #143#return; {316#true} is VALID [2018-11-23 13:04:50,233 INFO L256 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret22 := main(); {316#true} is VALID [2018-11-23 13:04:50,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {316#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9);~i~1 := 0; {316#true} is VALID [2018-11-23 13:04:50,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {316#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet20 && #t~nondet20 <= 127;call write~int(#t~nondet20, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet20; {316#true} is VALID [2018-11-23 13:04:50,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {316#true} #t~post19 := ~i~1;~i~1 := 1 + #t~post19;havoc #t~post19; {316#true} is VALID [2018-11-23 13:04:50,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {316#true} assume !(~i~1 < 8); {316#true} is VALID [2018-11-23 13:04:50,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {316#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {316#true} is VALID [2018-11-23 13:04:50,237 INFO L256 TraceCheckUtils]: 10: Hoare triple {316#true} call #t~ret21 := parse_expression_list(~#A~0.base, ~#A~0.offset); {316#true} is VALID [2018-11-23 13:04:50,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {316#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2); {316#true} is VALID [2018-11-23 13:04:50,238 INFO L273 TraceCheckUtils]: 12: Hoare triple {316#true} assume !(~str.base == 0 && ~str.offset == 0); {316#true} is VALID [2018-11-23 13:04:50,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {316#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch3 := 0 == #t~mem2; {316#true} is VALID [2018-11-23 13:04:50,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {316#true} assume #t~switch3; {316#true} is VALID [2018-11-23 13:04:50,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {316#true} call #t~mem4 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short6 := 32 == #t~mem4; {316#true} is VALID [2018-11-23 13:04:50,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {316#true} assume #t~short6; {318#|parse_expression_list_#t~short6|} is VALID [2018-11-23 13:04:50,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {318#|parse_expression_list_#t~short6|} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {317#false} is VALID [2018-11-23 13:04:50,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {317#false} call #t~mem8 := read~int(~str.base, ~str.offset + ~start~0, 1); {317#false} is VALID [2018-11-23 13:04:50,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {317#false} assume 34 == #t~mem8;havoc #t~mem8;#t~post9 := ~start~0;~start~0 := 1 + #t~post9;havoc #t~post9; {317#false} is VALID [2018-11-23 13:04:50,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {317#false} ~j~0 := ~i~0 - 1; {317#false} is VALID [2018-11-23 13:04:50,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {317#false} #t~short13 := 0 < ~j~0; {317#false} is VALID [2018-11-23 13:04:50,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {317#false} assume !#t~short13; {317#false} is VALID [2018-11-23 13:04:50,242 INFO L273 TraceCheckUtils]: 23: Hoare triple {317#false} assume !#t~short13;havoc #t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~mem11; {317#false} is VALID [2018-11-23 13:04:50,242 INFO L273 TraceCheckUtils]: 24: Hoare triple {317#false} #t~short16 := 0 < ~j~0; {317#false} is VALID [2018-11-23 13:04:50,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {317#false} assume #t~short16;call #t~mem15 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short16 := 34 == #t~mem15; {317#false} is VALID [2018-11-23 13:04:50,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {317#false} assume #t~short16;havoc #t~short16;havoc #t~mem15;#t~post17 := ~j~0;~j~0 := #t~post17 - 1;havoc #t~post17; {317#false} is VALID [2018-11-23 13:04:50,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {317#false} assume ~start~0 <= ~j~0; {317#false} is VALID [2018-11-23 13:04:50,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {317#false} assume !(1 + (~j~0 - ~start~0) >= 2);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0));havoc #t~ret18.base, #t~ret18.offset; {317#false} is VALID [2018-11-23 13:04:50,244 INFO L256 TraceCheckUtils]: 29: Hoare triple {317#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {317#false} is VALID [2018-11-23 13:04:50,244 INFO L273 TraceCheckUtils]: 30: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2018-11-23 13:04:50,245 INFO L273 TraceCheckUtils]: 31: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2018-11-23 13:04:50,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {317#false} assume !false; {317#false} is VALID [2018-11-23 13:04:50,247 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 13:04:50,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:50,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:50,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 13:04:50,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:50,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:50,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:50,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:50,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:50,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:50,370 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 3 states. [2018-11-23 13:04:50,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:50,622 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 13:04:50,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:50,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 13:04:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 13:04:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 13:04:50,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-23 13:04:50,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:50,862 INFO L225 Difference]: With dead ends: 74 [2018-11-23 13:04:50,862 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:04:50,864 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 13:04:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:04:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 13:04:50,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:50,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 13:04:50,882 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 13:04:50,882 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 13:04:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:50,885 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 13:04:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 13:04:50,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:50,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:50,887 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 13:04:50,887 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 13:04:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:50,892 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 13:04:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 13:04:50,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:50,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:50,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:50,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:04:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-23 13:04:50,896 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 33 [2018-11-23 13:04:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:50,897 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-23 13:04:50,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 13:04:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:04:50,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:50,899 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, 1, 1, 1] [2018-11-23 13:04:50,899 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:50,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:50,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1506799279, now seen corresponding path program 1 times [2018-11-23 13:04:50,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:50,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:51,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {558#true} is VALID [2018-11-23 13:04:51,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {558#true} is VALID [2018-11-23 13:04:51,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2018-11-23 13:04:51,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #143#return; {558#true} is VALID [2018-11-23 13:04:51,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret22 := main(); {558#true} is VALID [2018-11-23 13:04:51,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {558#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9);~i~1 := 0; {558#true} is VALID [2018-11-23 13:04:51,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {558#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet20 && #t~nondet20 <= 127;call write~int(#t~nondet20, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet20; {558#true} is VALID [2018-11-23 13:04:51,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {558#true} #t~post19 := ~i~1;~i~1 := 1 + #t~post19;havoc #t~post19; {558#true} is VALID [2018-11-23 13:04:51,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {558#true} assume !(~i~1 < 8); {558#true} is VALID [2018-11-23 13:04:51,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {558#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {558#true} is VALID [2018-11-23 13:04:51,064 INFO L256 TraceCheckUtils]: 10: Hoare triple {558#true} call #t~ret21 := parse_expression_list(~#A~0.base, ~#A~0.offset); {558#true} is VALID [2018-11-23 13:04:51,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {558#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2); {558#true} is VALID [2018-11-23 13:04:51,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {558#true} assume !(~str.base == 0 && ~str.offset == 0); {558#true} is VALID [2018-11-23 13:04:51,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {558#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch3 := 0 == #t~mem2; {558#true} is VALID [2018-11-23 13:04:51,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {558#true} assume #t~switch3; {558#true} is VALID [2018-11-23 13:04:51,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {558#true} call #t~mem4 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short6 := 32 == #t~mem4; {558#true} is VALID [2018-11-23 13:04:51,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {558#true} assume !#t~short6;call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short6 := 9 == #t~mem5; {558#true} is VALID [2018-11-23 13:04:51,066 INFO L273 TraceCheckUtils]: 17: Hoare triple {558#true} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {558#true} is VALID [2018-11-23 13:04:51,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {558#true} call #t~mem8 := read~int(~str.base, ~str.offset + ~start~0, 1); {558#true} is VALID [2018-11-23 13:04:51,067 INFO L273 TraceCheckUtils]: 19: Hoare triple {558#true} assume 34 == #t~mem8;havoc #t~mem8;#t~post9 := ~start~0;~start~0 := 1 + #t~post9;havoc #t~post9; {558#true} is VALID [2018-11-23 13:04:51,067 INFO L273 TraceCheckUtils]: 20: Hoare triple {558#true} ~j~0 := ~i~0 - 1; {558#true} is VALID [2018-11-23 13:04:51,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {558#true} #t~short13 := 0 < ~j~0; {558#true} is VALID [2018-11-23 13:04:51,068 INFO L273 TraceCheckUtils]: 22: Hoare triple {558#true} assume !#t~short13; {558#true} is VALID [2018-11-23 13:04:51,068 INFO L273 TraceCheckUtils]: 23: Hoare triple {558#true} assume !#t~short13;havoc #t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~mem11; {558#true} is VALID [2018-11-23 13:04:51,069 INFO L273 TraceCheckUtils]: 24: Hoare triple {558#true} #t~short16 := 0 < ~j~0; {558#true} is VALID [2018-11-23 13:04:51,069 INFO L273 TraceCheckUtils]: 25: Hoare triple {558#true} assume #t~short16;call #t~mem15 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short16 := 34 == #t~mem15; {558#true} is VALID [2018-11-23 13:04:51,069 INFO L273 TraceCheckUtils]: 26: Hoare triple {558#true} assume #t~short16;havoc #t~short16;havoc #t~mem15;#t~post17 := ~j~0;~j~0 := #t~post17 - 1;havoc #t~post17; {558#true} is VALID [2018-11-23 13:04:51,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {558#true} assume ~start~0 <= ~j~0; {558#true} is VALID [2018-11-23 13:04:51,085 INFO L273 TraceCheckUtils]: 28: Hoare triple {558#true} assume !(1 + (~j~0 - ~start~0) >= 2);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0));havoc #t~ret18.base, #t~ret18.offset; {560#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} is VALID [2018-11-23 13:04:51,086 INFO L256 TraceCheckUtils]: 29: Hoare triple {560#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {561#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:51,087 INFO L273 TraceCheckUtils]: 30: Hoare triple {561#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {562#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:04:51,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {562#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {559#false} is VALID [2018-11-23 13:04:51,089 INFO L273 TraceCheckUtils]: 32: Hoare triple {559#false} assume !false; {559#false} is VALID [2018-11-23 13:04:51,092 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 13:04:51,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:51,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:04:51,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 13:04:51,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:51,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:51,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:51,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:51,175 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 5 states. [2018-11-23 13:04:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,533 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-23 13:04:51,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:51,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 13:04:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-23 13:04:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-23 13:04:51,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2018-11-23 13:04:51,691 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 13:04:51,692 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:04:51,692 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:04:51,693 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 13:04:51,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:04:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:04:51,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:51,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:51,694 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:51,694 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,695 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:51,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:51,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:51,695 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:51,695 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,696 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:51,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:51,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:51,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:51,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:04:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:04:51,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-23 13:04:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:51,697 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:04:51,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:51,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:51,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:04:51,775 INFO L448 ceAbstractionStarter]: For program point L60-1(line 60) no Hoare annotation was computed. [2018-11-23 13:04:51,775 INFO L448 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2018-11-23 13:04:51,776 INFO L448 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2018-11-23 13:04:51,776 INFO L448 ceAbstractionStarter]: For program point L60-4(line 60) no Hoare annotation was computed. [2018-11-23 13:04:51,776 INFO L448 ceAbstractionStarter]: For program point L60-6(line 60) no Hoare annotation was computed. [2018-11-23 13:04:51,776 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-23 13:04:51,776 INFO L451 ceAbstractionStarter]: At program point L60-8(line 60) the Hoare annotation is: true [2018-11-23 13:04:51,776 INFO L448 ceAbstractionStarter]: For program point L60-9(line 60) no Hoare annotation was computed. [2018-11-23 13:04:51,776 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-23 13:04:51,776 INFO L448 ceAbstractionStarter]: For program point L61-2(line 61) no Hoare annotation was computed. [2018-11-23 13:04:51,777 INFO L448 ceAbstractionStarter]: For program point L61-4(lines 55 73) no Hoare annotation was computed. [2018-11-23 13:04:51,777 INFO L448 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-11-23 13:04:51,777 INFO L448 ceAbstractionStarter]: For program point L57-3(line 57) no Hoare annotation was computed. [2018-11-23 13:04:51,777 INFO L451 ceAbstractionStarter]: At program point L57-5(line 57) the Hoare annotation is: true [2018-11-23 13:04:51,777 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 53 74) no Hoare annotation was computed. [2018-11-23 13:04:51,777 INFO L448 ceAbstractionStarter]: For program point L57-6(line 57) no Hoare annotation was computed. [2018-11-23 13:04:51,777 INFO L448 ceAbstractionStarter]: For program point L53-2(lines 53 74) no Hoare annotation was computed. [2018-11-23 13:04:51,778 INFO L451 ceAbstractionStarter]: At program point L53-4(lines 53 74) the Hoare annotation is: true [2018-11-23 13:04:51,778 INFO L448 ceAbstractionStarter]: For program point L53-5(lines 53 74) no Hoare annotation was computed. [2018-11-23 13:04:51,778 INFO L448 ceAbstractionStarter]: For program point parse_expression_listFINAL(lines 48 76) no Hoare annotation was computed. [2018-11-23 13:04:51,778 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 71) no Hoare annotation was computed. [2018-11-23 13:04:51,778 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-23 13:04:51,778 INFO L451 ceAbstractionStarter]: At program point parse_expression_listENTRY(lines 48 76) the Hoare annotation is: true [2018-11-23 13:04:51,778 INFO L448 ceAbstractionStarter]: For program point L58-2(line 58) no Hoare annotation was computed. [2018-11-23 13:04:51,778 INFO L444 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2018-11-23 13:04:51,779 INFO L448 ceAbstractionStarter]: For program point L67-1(line 67) no Hoare annotation was computed. [2018-11-23 13:04:51,779 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 65) no Hoare annotation was computed. [2018-11-23 13:04:51,779 INFO L448 ceAbstractionStarter]: For program point parse_expression_listEXIT(lines 48 76) no Hoare annotation was computed. [2018-11-23 13:04:51,779 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 73) no Hoare annotation was computed. [2018-11-23 13:04:51,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:51,779 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:51,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:51,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:51,779 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:04:51,780 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:51,780 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:51,780 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 77 88) the Hoare annotation is: true [2018-11-23 13:04:51,780 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 77 88) no Hoare annotation was computed. [2018-11-23 13:04:51,780 INFO L451 ceAbstractionStarter]: At program point L86(line 86) the Hoare annotation is: true [2018-11-23 13:04:51,780 INFO L448 ceAbstractionStarter]: For program point L86-1(line 86) no Hoare annotation was computed. [2018-11-23 13:04:51,780 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 81 83) no Hoare annotation was computed. [2018-11-23 13:04:51,780 INFO L451 ceAbstractionStarter]: At program point L81-3(lines 81 83) the Hoare annotation is: true [2018-11-23 13:04:51,780 INFO L448 ceAbstractionStarter]: For program point L81-4(lines 81 83) no Hoare annotation was computed. [2018-11-23 13:04:51,781 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 77 88) no Hoare annotation was computed. [2018-11-23 13:04:51,781 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-23 13:04:51,781 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 13:04:51,781 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 13:04:51,781 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-23 13:04:51,781 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-23 13:04:51,782 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-23 13:04:51,783 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 13:04:51,784 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:04:51,784 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:51,784 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 13:04:51,784 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 13:04:51,784 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:04:51,785 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:51,785 WARN L170 areAnnotationChecker]: L81-4 has no Hoare annotation [2018-11-23 13:04:51,785 WARN L170 areAnnotationChecker]: L81-4 has no Hoare annotation [2018-11-23 13:04:51,785 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2018-11-23 13:04:51,785 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:51,785 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:51,785 WARN L170 areAnnotationChecker]: parse_expression_listFINAL has no Hoare annotation [2018-11-23 13:04:51,785 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 13:04:51,785 WARN L170 areAnnotationChecker]: L53-5 has no Hoare annotation [2018-11-23 13:04:51,786 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:51,786 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:51,786 WARN L170 areAnnotationChecker]: L81-4 has no Hoare annotation [2018-11-23 13:04:51,786 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2018-11-23 13:04:51,786 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 13:04:51,786 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 13:04:51,787 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-23 13:04:51,787 WARN L170 areAnnotationChecker]: parse_expression_listEXIT has no Hoare annotation [2018-11-23 13:04:51,787 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 13:04:51,787 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 13:04:51,787 WARN L170 areAnnotationChecker]: L53-5 has no Hoare annotation [2018-11-23 13:04:51,787 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 13:04:51,787 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:04:51,788 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 13:04:51,789 WARN L170 areAnnotationChecker]: L57-6 has no Hoare annotation [2018-11-23 13:04:51,789 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-23 13:04:51,789 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-23 13:04:51,789 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-23 13:04:51,789 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:51,789 WARN L170 areAnnotationChecker]: L57-6 has no Hoare annotation [2018-11-23 13:04:51,790 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-23 13:04:51,790 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-23 13:04:51,790 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-23 13:04:51,790 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2018-11-23 13:04:51,790 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:04:51,790 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2018-11-23 13:04:51,790 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2018-11-23 13:04:51,791 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2018-11-23 13:04:51,791 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2018-11-23 13:04:51,791 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2018-11-23 13:04:51,791 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2018-11-23 13:04:51,791 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2018-11-23 13:04:51,791 WARN L170 areAnnotationChecker]: L60-9 has no Hoare annotation [2018-11-23 13:04:51,792 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-23 13:04:51,792 WARN L170 areAnnotationChecker]: L60-9 has no Hoare annotation [2018-11-23 13:04:51,792 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-23 13:04:51,792 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-23 13:04:51,792 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 13:04:51,792 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 13:04:51,792 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2018-11-23 13:04:51,792 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2018-11-23 13:04:51,793 WARN L170 areAnnotationChecker]: L60-6 has no Hoare annotation [2018-11-23 13:04:51,793 WARN L170 areAnnotationChecker]: L60-6 has no Hoare annotation [2018-11-23 13:04:51,793 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2018-11-23 13:04:51,793 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2018-11-23 13:04:51,793 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2018-11-23 13:04:51,793 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2018-11-23 13:04:51,793 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2018-11-23 13:04:51,794 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2018-11-23 13:04:51,794 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2018-11-23 13:04:51,794 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-23 13:04:51,794 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:04:51,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:04:51 BoogieIcfgContainer [2018-11-23 13:04:51,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:04:51,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:04:51,801 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:04:51,801 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:04:51,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:48" (3/4) ... [2018-11-23 13:04:51,806 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:04:51,812 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure parse_expression_list [2018-11-23 13:04:51,812 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:04:51,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:04:51,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:04:51,820 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-23 13:04:51,820 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-23 13:04:51,820 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:04:51,891 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:04:51,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:04:51,893 INFO L168 Benchmark]: Toolchain (without parser) took 5261.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -510.1 MB). Peak memory consumption was 206.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:51,895 INFO L168 Benchmark]: CDTParser took 0.21 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 13:04:51,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.78 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:51,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:51,897 INFO L168 Benchmark]: Boogie Preprocessor took 138.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:51,897 INFO L168 Benchmark]: RCFGBuilder took 1117.90 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:51,898 INFO L168 Benchmark]: TraceAbstraction took 3401.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 199.5 MB). Peak memory consumption was 199.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:51,898 INFO L168 Benchmark]: Witness Printer took 91.31 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:51,902 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.21 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 469.78 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1117.90 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3401.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 199.5 MB). Peak memory consumption was 199.5 MB. Max. memory is 7.1 GB. * Witness Printer took 91.31 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 20 SDslu, 213 SDs, 0 SdLazy, 50 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 19 PreInvPairs, 27 NumberOfFragments, 16 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 3032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...