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/loop-invgen/NetBSD_loop_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:09:32,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:09:32,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:09:32,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:09:32,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:09:32,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:09:32,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:09:32,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:09:32,456 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:09:32,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:09:32,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:09:32,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:09:32,460 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:09:32,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:09:32,462 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:09:32,463 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:09:32,464 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:09:32,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:09:32,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:09:32,469 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:09:32,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:09:32,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:09:32,474 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:09:32,474 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:09:32,475 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:09:32,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:09:32,477 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:09:32,477 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:09:32,478 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:09:32,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:09:32,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:09:32,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:09:32,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:09:32,484 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:09:32,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:09:32,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:09:32,486 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:09:32,514 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:09:32,514 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:09:32,517 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:09:32,517 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:09:32,518 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:09:32,518 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:09:32,518 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:09:32,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:09:32,518 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:09:32,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:09:32,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:09:32,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:09:32,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:09:32,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:09:32,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:09:32,520 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:09:32,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:09:32,520 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:09:32,520 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:09:32,520 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:09:32,525 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:09:32,525 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:09:32,525 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:09:32,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:09:32,526 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:09:32,526 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:09:32,527 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:09:32,527 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:09:32,527 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:09:32,527 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:09:32,527 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:09:32,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:09:32,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:09:32,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:09:32,597 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:09:32,598 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:09:32,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop_true-unreach-call_true-termination.i [2018-11-23 13:09:32,656 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1189a639/ceb79a83378d4c90a16df14fbc1f617b/FLAG7cd904cee [2018-11-23 13:09:33,037 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:09:33,038 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop_true-unreach-call_true-termination.i [2018-11-23 13:09:33,043 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1189a639/ceb79a83378d4c90a16df14fbc1f617b/FLAG7cd904cee [2018-11-23 13:09:33,416 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1189a639/ceb79a83378d4c90a16df14fbc1f617b [2018-11-23 13:09:33,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:09:33,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:09:33,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:33,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:09:33,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:09:33,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:33" (1/1) ... [2018-11-23 13:09:33,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a41dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33, skipping insertion in model container [2018-11-23 13:09:33,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:33" (1/1) ... [2018-11-23 13:09:33,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:09:33,469 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:09:33,693 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:33,701 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:09:33,725 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:33,747 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:09:33,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33 WrapperNode [2018-11-23 13:09:33,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:33,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:33,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:09:33,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:09:33,759 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:09:33" (1/1) ... [2018-11-23 13:09:33,765 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:09:33" (1/1) ... [2018-11-23 13:09:33,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:33,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:09:33,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:09:33,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:09:33,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33" (1/1) ... [2018-11-23 13:09:33,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33" (1/1) ... [2018-11-23 13:09:33,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33" (1/1) ... [2018-11-23 13:09:33,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33" (1/1) ... [2018-11-23 13:09:33,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33" (1/1) ... [2018-11-23 13:09:33,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33" (1/1) ... [2018-11-23 13:09:33,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33" (1/1) ... [2018-11-23 13:09:33,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:09:33,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:09:33,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:09:33,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:09:33,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33" (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:09:33,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:09:33,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:09:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:09:33,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:09:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:09:33,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:09:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:09:33,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:09:34,389 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:09:34,389 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:09:34,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:34 BoogieIcfgContainer [2018-11-23 13:09:34,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:09:34,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:09:34,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:09:34,395 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:09:34,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:09:33" (1/3) ... [2018-11-23 13:09:34,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c178735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:34, skipping insertion in model container [2018-11-23 13:09:34,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:33" (2/3) ... [2018-11-23 13:09:34,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c178735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:34, skipping insertion in model container [2018-11-23 13:09:34,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:34" (3/3) ... [2018-11-23 13:09:34,399 INFO L112 eAbstractionObserver]: Analyzing ICFG NetBSD_loop_true-unreach-call_true-termination.i [2018-11-23 13:09:34,408 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:09:34,416 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:09:34,431 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:09:34,459 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:09:34,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:09:34,460 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:09:34,460 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:09:34,460 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:09:34,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:09:34,461 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:09:34,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:09:34,461 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:09:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 13:09:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:09:34,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:34,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:34,488 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:34,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:34,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1158151592, now seen corresponding path program 1 times [2018-11-23 13:09:34,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:34,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:34,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:34,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:34,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:34,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 13:09:34,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 13:09:34,774 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #41#return; {25#true} is VALID [2018-11-23 13:09:34,775 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2018-11-23 13:09:34,775 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2018-11-23 13:09:34,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {25#true} is VALID [2018-11-23 13:09:34,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {27#(<= 0 main_~glob2_p_off~0)} is VALID [2018-11-23 13:09:34,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#(<= 0 main_~glob2_p_off~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {27#(<= 0 main_~glob2_p_off~0)} is VALID [2018-11-23 13:09:34,793 INFO L256 TraceCheckUtils]: 8: Hoare triple {27#(<= 0 main_~glob2_p_off~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {28#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:34,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {29#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:09:34,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {26#false} is VALID [2018-11-23 13:09:34,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 13:09:34,801 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:09:34,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:34,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:09:34,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:09:34,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:34,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:09:34,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:34,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:09:34,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:09:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:09:34,945 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-11-23 13:09:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:35,770 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 13:09:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:09:35,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:09:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:09:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 13:09:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:09:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 13:09:35,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-23 13:09:35,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:35,937 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:09:35,937 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:09:35,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:09:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:09:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:09:36,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:36,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:09:36,017 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:09:36,017 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:09:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:36,021 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:09:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:09:36,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:36,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:36,022 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:09:36,022 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:09:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:36,025 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:09:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:09:36,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:36,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:36,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:36,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:09:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:09:36,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2018-11-23 13:09:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:36,031 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:09:36,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:09:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:09:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:09:36,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:36,033 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:36,033 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:36,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:36,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1937413030, now seen corresponding path program 1 times [2018-11-23 13:09:36,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:36,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:36,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:36,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:36,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:36,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {166#true} is VALID [2018-11-23 13:09:36,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {166#true} assume true; {166#true} is VALID [2018-11-23 13:09:36,506 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {166#true} {166#true} #41#return; {166#true} is VALID [2018-11-23 13:09:36,506 INFO L256 TraceCheckUtils]: 3: Hoare triple {166#true} call #t~ret3 := main(); {166#true} is VALID [2018-11-23 13:09:36,507 INFO L273 TraceCheckUtils]: 4: Hoare triple {166#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {166#true} is VALID [2018-11-23 13:09:36,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {166#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {168#(<= 1 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:36,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {168#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {169#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:36,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {169#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {169#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:36,510 INFO L256 TraceCheckUtils]: 8: Hoare triple {169#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {166#true} is VALID [2018-11-23 13:09:36,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {166#true} ~cond := #in~cond; {170#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:36,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {170#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:36,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {171#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:36,517 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {171#(not (= |__VERIFIER_assert_#in~cond| 0))} {169#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #45#return; {169#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:36,519 INFO L256 TraceCheckUtils]: 13: Hoare triple {169#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:36,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {171#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {172#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:36,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {172#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {167#false} is VALID [2018-11-23 13:09:36,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {167#false} assume !false; {167#false} is VALID [2018-11-23 13:09:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:36,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:36,526 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 13:09:36,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:36,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:37,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {166#true} is VALID [2018-11-23 13:09:37,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {166#true} assume true; {166#true} is VALID [2018-11-23 13:09:37,064 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {166#true} {166#true} #41#return; {166#true} is VALID [2018-11-23 13:09:37,064 INFO L256 TraceCheckUtils]: 3: Hoare triple {166#true} call #t~ret3 := main(); {166#true} is VALID [2018-11-23 13:09:37,064 INFO L273 TraceCheckUtils]: 4: Hoare triple {166#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {166#true} is VALID [2018-11-23 13:09:37,066 INFO L273 TraceCheckUtils]: 5: Hoare triple {166#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {168#(<= 1 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:37,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {168#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {194#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2018-11-23 13:09:37,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {194#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2018-11-23 13:09:37,072 INFO L256 TraceCheckUtils]: 8: Hoare triple {194#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {166#true} is VALID [2018-11-23 13:09:37,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {166#true} ~cond := #in~cond; {170#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:37,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {170#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:37,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {171#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:37,078 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {171#(not (= |__VERIFIER_assert_#in~cond| 0))} {194#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #45#return; {213#(and (<= 1 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= main_~glob2_p_off~0 0))} is VALID [2018-11-23 13:09:37,080 INFO L256 TraceCheckUtils]: 13: Hoare triple {213#(and (<= 1 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {217#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:37,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {217#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {221#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:37,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {221#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {167#false} is VALID [2018-11-23 13:09:37,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {167#false} assume !false; {167#false} is VALID [2018-11-23 13:09:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:37,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:37,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-11-23 13:09:37,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 13:09:37,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:37,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:09:37,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:37,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:09:37,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:09:37,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:09:37,177 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-11-23 13:09:37,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:37,814 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:09:37,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:09:37,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 13:09:37,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:09:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-23 13:09:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:09:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-23 13:09:37,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2018-11-23 13:09:37,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:37,861 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:09:37,862 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:09:37,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:09:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:09:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 13:09:37,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:37,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 13:09:37,898 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 13:09:37,898 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 13:09:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:37,902 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:09:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:09:37,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:37,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:37,904 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 13:09:37,904 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 13:09:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:37,907 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:09:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:09:37,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:37,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:37,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:37,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:09:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 13:09:37,911 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 17 [2018-11-23 13:09:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:37,912 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 13:09:37,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:09:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:09:37,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:09:37,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:37,913 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:37,914 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:37,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:37,914 INFO L82 PathProgramCache]: Analyzing trace with hash 441803270, now seen corresponding path program 1 times [2018-11-23 13:09:37,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:37,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:37,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:37,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:37,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:38,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2018-11-23 13:09:38,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {392#true} assume true; {392#true} is VALID [2018-11-23 13:09:38,085 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {392#true} {392#true} #41#return; {392#true} is VALID [2018-11-23 13:09:38,085 INFO L256 TraceCheckUtils]: 3: Hoare triple {392#true} call #t~ret3 := main(); {392#true} is VALID [2018-11-23 13:09:38,086 INFO L273 TraceCheckUtils]: 4: Hoare triple {392#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {392#true} is VALID [2018-11-23 13:09:38,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {392#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {394#(<= 1 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:38,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {394#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {395#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:38,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {395#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {395#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:38,090 INFO L256 TraceCheckUtils]: 8: Hoare triple {395#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {392#true} is VALID [2018-11-23 13:09:38,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {392#true} ~cond := #in~cond; {396#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:38,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {396#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {397#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:38,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {397#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {397#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:38,093 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {397#(not (= |__VERIFIER_assert_#in~cond| 0))} {395#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #45#return; {395#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:38,093 INFO L256 TraceCheckUtils]: 13: Hoare triple {395#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {392#true} is VALID [2018-11-23 13:09:38,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2018-11-23 13:09:38,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2018-11-23 13:09:38,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#true} assume true; {392#true} is VALID [2018-11-23 13:09:38,102 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {392#true} {395#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #47#return; {395#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:38,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {395#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {398#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:38,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {398#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {398#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:38,104 INFO L256 TraceCheckUtils]: 20: Hoare triple {398#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {392#true} is VALID [2018-11-23 13:09:38,104 INFO L273 TraceCheckUtils]: 21: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2018-11-23 13:09:38,105 INFO L273 TraceCheckUtils]: 22: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2018-11-23 13:09:38,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {392#true} assume true; {392#true} is VALID [2018-11-23 13:09:38,106 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {392#true} {398#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #45#return; {398#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:38,107 INFO L256 TraceCheckUtils]: 25: Hoare triple {398#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {397#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:38,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {397#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {399#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:38,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {399#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {393#false} is VALID [2018-11-23 13:09:38,110 INFO L273 TraceCheckUtils]: 28: Hoare triple {393#false} assume !false; {393#false} is VALID [2018-11-23 13:09:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:09:38,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:38,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:38,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:38,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:38,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2018-11-23 13:09:38,436 INFO L273 TraceCheckUtils]: 1: Hoare triple {392#true} assume true; {392#true} is VALID [2018-11-23 13:09:38,436 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {392#true} {392#true} #41#return; {392#true} is VALID [2018-11-23 13:09:38,436 INFO L256 TraceCheckUtils]: 3: Hoare triple {392#true} call #t~ret3 := main(); {392#true} is VALID [2018-11-23 13:09:38,437 INFO L273 TraceCheckUtils]: 4: Hoare triple {392#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {392#true} is VALID [2018-11-23 13:09:38,437 INFO L273 TraceCheckUtils]: 5: Hoare triple {392#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {394#(<= 1 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:38,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {394#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {421#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2018-11-23 13:09:38,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {421#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {421#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2018-11-23 13:09:38,446 INFO L256 TraceCheckUtils]: 8: Hoare triple {421#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {392#true} is VALID [2018-11-23 13:09:38,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {392#true} ~cond := #in~cond; {396#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:38,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {396#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {397#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:38,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {397#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {397#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:38,449 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {397#(not (= |__VERIFIER_assert_#in~cond| 0))} {421#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #45#return; {440#(and (<= 1 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= main_~glob2_p_off~0 0))} is VALID [2018-11-23 13:09:38,449 INFO L256 TraceCheckUtils]: 13: Hoare triple {440#(and (<= 1 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {392#true} is VALID [2018-11-23 13:09:38,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2018-11-23 13:09:38,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2018-11-23 13:09:38,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#true} assume true; {392#true} is VALID [2018-11-23 13:09:38,451 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {392#true} {440#(and (<= 1 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= main_~glob2_p_off~0 0))} #47#return; {440#(and (<= 1 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= main_~glob2_p_off~0 0))} is VALID [2018-11-23 13:09:38,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {440#(and (<= 1 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= main_~glob2_p_off~0 0))} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {459#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2018-11-23 13:09:38,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {459#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {459#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2018-11-23 13:09:38,453 INFO L256 TraceCheckUtils]: 20: Hoare triple {459#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {392#true} is VALID [2018-11-23 13:09:38,453 INFO L273 TraceCheckUtils]: 21: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2018-11-23 13:09:38,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2018-11-23 13:09:38,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {392#true} assume true; {392#true} is VALID [2018-11-23 13:09:38,454 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {392#true} {459#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} #45#return; {459#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2018-11-23 13:09:38,455 INFO L256 TraceCheckUtils]: 25: Hoare triple {459#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {481#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:38,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {481#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {485#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:38,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {485#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {393#false} is VALID [2018-11-23 13:09:38,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {393#false} assume !false; {393#false} is VALID [2018-11-23 13:09:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:09:38,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:38,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-11-23 13:09:38,485 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-23 13:09:38,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:38,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:09:38,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:38,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:09:38,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:09:38,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:09:38,556 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 13 states. [2018-11-23 13:09:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:39,188 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 13:09:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:09:39,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-23 13:09:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:09:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2018-11-23 13:09:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:09:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2018-11-23 13:09:39,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2018-11-23 13:09:39,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:39,253 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:09:39,253 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:09:39,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:09:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:09:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 13:09:39,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:39,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2018-11-23 13:09:39,310 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2018-11-23 13:09:39,310 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2018-11-23 13:09:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:39,316 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 13:09:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 13:09:39,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:39,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:39,317 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2018-11-23 13:09:39,317 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2018-11-23 13:09:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:39,321 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 13:09:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 13:09:39,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:39,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:39,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:39,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:09:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 13:09:39,326 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 29 [2018-11-23 13:09:39,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:39,326 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 13:09:39,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:09:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 13:09:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:09:39,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:39,328 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:39,328 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:39,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:39,329 INFO L82 PathProgramCache]: Analyzing trace with hash 713924710, now seen corresponding path program 2 times [2018-11-23 13:09:39,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:39,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:39,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:39,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:39,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:39,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {698#true} call ULTIMATE.init(); {698#true} is VALID [2018-11-23 13:09:39,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,483 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {698#true} {698#true} #41#return; {698#true} is VALID [2018-11-23 13:09:39,483 INFO L256 TraceCheckUtils]: 3: Hoare triple {698#true} call #t~ret3 := main(); {698#true} is VALID [2018-11-23 13:09:39,484 INFO L273 TraceCheckUtils]: 4: Hoare triple {698#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {698#true} is VALID [2018-11-23 13:09:39,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {698#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {698#true} is VALID [2018-11-23 13:09:39,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {698#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,486 INFO L256 TraceCheckUtils]: 8: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {698#true} is VALID [2018-11-23 13:09:39,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {698#true} ~cond := #in~cond; {701#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:39,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {701#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:39,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {702#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:39,490 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {702#(not (= |__VERIFIER_assert_#in~cond| 0))} {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #45#return; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,490 INFO L256 TraceCheckUtils]: 13: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {698#true} is VALID [2018-11-23 13:09:39,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2018-11-23 13:09:39,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2018-11-23 13:09:39,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,506 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {698#true} {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #47#return; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,511 INFO L256 TraceCheckUtils]: 20: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {698#true} is VALID [2018-11-23 13:09:39,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2018-11-23 13:09:39,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2018-11-23 13:09:39,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,520 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {698#true} {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #45#return; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,520 INFO L256 TraceCheckUtils]: 25: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {698#true} is VALID [2018-11-23 13:09:39,520 INFO L273 TraceCheckUtils]: 26: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2018-11-23 13:09:39,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2018-11-23 13:09:39,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,521 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {698#true} {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #47#return; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,526 INFO L273 TraceCheckUtils]: 30: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,527 INFO L273 TraceCheckUtils]: 31: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {703#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,527 INFO L256 TraceCheckUtils]: 32: Hoare triple {703#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {698#true} is VALID [2018-11-23 13:09:39,527 INFO L273 TraceCheckUtils]: 33: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2018-11-23 13:09:39,528 INFO L273 TraceCheckUtils]: 34: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2018-11-23 13:09:39,528 INFO L273 TraceCheckUtils]: 35: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,528 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {698#true} {703#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #45#return; {703#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,529 INFO L256 TraceCheckUtils]: 37: Hoare triple {703#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:39,530 INFO L273 TraceCheckUtils]: 38: Hoare triple {702#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {704#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:39,531 INFO L273 TraceCheckUtils]: 39: Hoare triple {704#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {699#false} is VALID [2018-11-23 13:09:39,531 INFO L273 TraceCheckUtils]: 40: Hoare triple {699#false} assume !false; {699#false} is VALID [2018-11-23 13:09:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 13:09:39,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:39,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:39,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:09:39,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:09:39,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:39,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:39,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {698#true} call ULTIMATE.init(); {698#true} is VALID [2018-11-23 13:09:39,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,905 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {698#true} {698#true} #41#return; {698#true} is VALID [2018-11-23 13:09:39,905 INFO L256 TraceCheckUtils]: 3: Hoare triple {698#true} call #t~ret3 := main(); {698#true} is VALID [2018-11-23 13:09:39,905 INFO L273 TraceCheckUtils]: 4: Hoare triple {698#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {698#true} is VALID [2018-11-23 13:09:39,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {698#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {698#true} is VALID [2018-11-23 13:09:39,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {698#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,907 INFO L256 TraceCheckUtils]: 8: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {698#true} is VALID [2018-11-23 13:09:39,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2018-11-23 13:09:39,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2018-11-23 13:09:39,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,909 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {698#true} {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #45#return; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,909 INFO L256 TraceCheckUtils]: 13: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {698#true} is VALID [2018-11-23 13:09:39,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2018-11-23 13:09:39,909 INFO L273 TraceCheckUtils]: 15: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2018-11-23 13:09:39,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,911 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {698#true} {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #47#return; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,912 INFO L256 TraceCheckUtils]: 20: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {698#true} is VALID [2018-11-23 13:09:39,913 INFO L273 TraceCheckUtils]: 21: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2018-11-23 13:09:39,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2018-11-23 13:09:39,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,914 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {698#true} {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #45#return; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,915 INFO L256 TraceCheckUtils]: 25: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {698#true} is VALID [2018-11-23 13:09:39,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2018-11-23 13:09:39,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2018-11-23 13:09:39,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,916 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {698#true} {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #47#return; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {700#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {703#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,917 INFO L256 TraceCheckUtils]: 32: Hoare triple {703#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {698#true} is VALID [2018-11-23 13:09:39,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2018-11-23 13:09:39,917 INFO L273 TraceCheckUtils]: 34: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2018-11-23 13:09:39,918 INFO L273 TraceCheckUtils]: 35: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-23 13:09:39,918 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {698#true} {703#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #45#return; {703#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2018-11-23 13:09:39,919 INFO L256 TraceCheckUtils]: 37: Hoare triple {703#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {819#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:39,920 INFO L273 TraceCheckUtils]: 38: Hoare triple {819#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {823#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:39,920 INFO L273 TraceCheckUtils]: 39: Hoare triple {823#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {699#false} is VALID [2018-11-23 13:09:39,920 INFO L273 TraceCheckUtils]: 40: Hoare triple {699#false} assume !false; {699#false} is VALID [2018-11-23 13:09:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 13:09:39,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:39,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-23 13:09:39,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-23 13:09:39,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:39,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:09:39,986 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 13:09:39,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:09:39,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:09:39,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:09:39,987 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2018-11-23 13:09:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:40,404 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 13:09:40,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:09:40,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-23 13:09:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:09:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-23 13:09:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:09:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-23 13:09:40,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2018-11-23 13:09:40,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:40,445 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:09:40,445 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:09:40,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:09:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:09:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:09:40,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:40,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:40,447 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:40,447 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:40,447 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:40,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:40,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:40,448 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:40,448 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:40,448 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:40,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:40,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:40,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:40,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:09:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:09:40,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-11-23 13:09:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:40,450 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:09:40,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:09:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:40,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:40,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:09:40,608 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:09:40,608 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:40,608 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:40,608 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:09:40,609 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:09:40,609 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:09:40,609 INFO L451 ceAbstractionStarter]: At program point L30(lines 11 31) the Hoare annotation is: true [2018-11-23 13:09:40,609 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 31) the Hoare annotation is: true [2018-11-23 13:09:40,609 INFO L448 ceAbstractionStarter]: For program point L28(lines 24 29) no Hoare annotation was computed. [2018-11-23 13:09:40,610 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 1 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)) [2018-11-23 13:09:40,610 INFO L444 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 1 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)) [2018-11-23 13:09:40,610 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 31) no Hoare annotation was computed. [2018-11-23 13:09:40,610 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 29) the Hoare annotation is: (and (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 1 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2018-11-23 13:09:40,610 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-23 13:09:40,610 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-11-23 13:09:40,610 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 31) no Hoare annotation was computed. [2018-11-23 13:09:40,610 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:09:40,610 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:09:40,611 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:09:40,611 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:09:40,611 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:09:40,611 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:09:40,612 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:09:40,612 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:09:40,613 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:40,613 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:09:40,613 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:40,613 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:09:40,613 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:09:40,613 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:40,613 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:40,614 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:40,614 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 13:09:40,614 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:09:40,614 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:09:40,614 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:09:40,614 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:09:40,615 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:09:40,615 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:40,615 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:40,615 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:09:40,615 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 13:09:40,615 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 13:09:40,616 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:09:40,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:09:40 BoogieIcfgContainer [2018-11-23 13:09:40,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:09:40,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:09:40,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:09:40,626 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:09:40,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:34" (3/4) ... [2018-11-23 13:09:40,629 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:09:40,636 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:09:40,637 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:09:40,637 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:09:40,641 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:09:40,641 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:09:40,642 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:09:40,693 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/NetBSD_loop_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:09:40,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:09:40,694 INFO L168 Benchmark]: Toolchain (without parser) took 7268.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -301.8 MB). Peak memory consumption was 434.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:40,696 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:09:40,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.50 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:09:40,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.89 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:09:40,701 INFO L168 Benchmark]: Boogie Preprocessor took 27.71 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:09:40,701 INFO L168 Benchmark]: RCFGBuilder took 589.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:40,702 INFO L168 Benchmark]: TraceAbstraction took 6233.74 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: 472.4 MB). Peak memory consumption was 472.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:40,703 INFO L168 Benchmark]: Witness Printer took 67.66 ms. Allocated memory is still 2.3 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:40,707 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 320.50 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 23.89 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 27.71 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. * RCFGBuilder took 589.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6233.74 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: 472.4 MB). Peak memory consumption was 472.4 MB. Max. memory is 7.1 GB. * Witness Printer took 67.66 ms. Allocated memory is still 2.3 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 24]: Loop Invariant Derived loop invariant: (glob2_pathlim_off <= MAXPATHLEN && 1 <= MAXPATHLEN) && 0 <= glob2_p_off - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 6.1s OverallTime, 4 OverallIterations, 6 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 48 SDslu, 233 SDs, 0 SdLazy, 252 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=3, 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 16 PreInvPairs, 27 NumberOfFragments, 42 HoareAnnotationTreeSize, 16 FomulaSimplifications, 93 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 11777 SizeOfPredicates, 15 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 123/166 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...