java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/trex02_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:39,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:39,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:39,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:39,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:39,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:39,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:39,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:39,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:39,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:39,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:39,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:39,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:39,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:39,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:39,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:39,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:39,436 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:39,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:39,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:39,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:39,442 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:39,444 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:39,444 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:39,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:39,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:39,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:39,448 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:39,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:39,449 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:39,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:39,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:39,451 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:39,451 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:39,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:39,453 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:39,453 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:04:39,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:39,468 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:39,469 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:39,469 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:39,470 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:39,470 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:39,471 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:39,471 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:39,471 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:39,471 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:39,471 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:39,473 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:39,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:39,473 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:39,473 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:39,473 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:39,474 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:39,474 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:39,474 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:39,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:39,474 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:39,475 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:39,475 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:39,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:39,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:39,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:39,476 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:39,476 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:39,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:39,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:39,477 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:39,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:39,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:39,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:39,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:39,544 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:39,544 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex02_true-unreach-call_true-termination.i [2018-11-23 13:04:39,606 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b439233f/833e8a93f8c7491ca16fb3d4ff8b5ebb/FLAG8d1074a9e [2018-11-23 13:04:40,031 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:40,032 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex02_true-unreach-call_true-termination.i [2018-11-23 13:04:40,040 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b439233f/833e8a93f8c7491ca16fb3d4ff8b5ebb/FLAG8d1074a9e [2018-11-23 13:04:40,407 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b439233f/833e8a93f8c7491ca16fb3d4ff8b5ebb [2018-11-23 13:04:40,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:40,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:40,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:40,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:40,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:40,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148c27e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40, skipping insertion in model container [2018-11-23 13:04:40,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:40,466 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:40,718 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:40,725 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:40,745 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:40,765 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:40,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40 WrapperNode [2018-11-23 13:04:40,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:40,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:40,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:40,767 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:40,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:40,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:40,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:40,797 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:40,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (1/1) ... [2018-11-23 13:04:40,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:40,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:40,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:40,829 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:40,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 13:04:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 13:04:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:40,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:41,439 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:41,440 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:04:41,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:41 BoogieIcfgContainer [2018-11-23 13:04:41,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:41,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:41,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:41,444 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:41,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:40" (1/3) ... [2018-11-23 13:04:41,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7a1208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:41, skipping insertion in model container [2018-11-23 13:04:41,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:40" (2/3) ... [2018-11-23 13:04:41,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7a1208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:41, skipping insertion in model container [2018-11-23 13:04:41,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:41" (3/3) ... [2018-11-23 13:04:41,449 INFO L112 eAbstractionObserver]: Analyzing ICFG trex02_true-unreach-call_true-termination.i [2018-11-23 13:04:41,459 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:41,469 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:41,489 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:41,524 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:41,525 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:41,525 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:41,525 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:41,525 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:41,526 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:41,526 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:41,526 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:41,526 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 13:04:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:04:41,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:41,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:41,554 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:41,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:41,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1873481772, now seen corresponding path program 1 times [2018-11-23 13:04:41,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:41,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:41,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:41,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:41,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 13:04:41,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} ~x~0 := 0; {27#true} is VALID [2018-11-23 13:04:41,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 13:04:41,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #42#return; {27#true} is VALID [2018-11-23 13:04:41,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret3 := main(); {27#true} is VALID [2018-11-23 13:04:41,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {27#true} is VALID [2018-11-23 13:04:41,689 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 13:04:41,690 INFO L256 TraceCheckUtils]: 7: Hoare triple {28#false} call __VERIFIER_assert((if ~x~0 <= 0 then 1 else 0)); {28#false} is VALID [2018-11-23 13:04:41,690 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 13:04:41,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 13:04:41,691 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 13:04:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:41,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:41,702 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:04:41,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:41,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:41,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:41,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:41,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:41,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:41,777 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 13:04:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:41,876 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 13:04:41,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:41,876 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:04:41,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2018-11-23 13:04:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2018-11-23 13:04:41,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 40 transitions. [2018-11-23 13:04:42,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:42,257 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:04:42,258 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:04:42,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:04:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:04:42,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:42,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:42,427 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:42,427 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:42,432 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 13:04:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 13:04:42,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:42,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:42,433 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:42,433 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:42,437 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 13:04:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 13:04:42,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:42,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:42,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:42,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:04:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-23 13:04:42,448 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2018-11-23 13:04:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:42,449 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 13:04:42,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 13:04:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:04:42,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:42,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:42,452 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:42,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:42,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1862399520, now seen corresponding path program 1 times [2018-11-23 13:04:42,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:42,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:42,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:42,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {142#true} is VALID [2018-11-23 13:04:42,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {142#true} ~x~0 := 0; {142#true} is VALID [2018-11-23 13:04:42,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2018-11-23 13:04:42,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2018-11-23 13:04:42,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret3 := main(); {142#true} is VALID [2018-11-23 13:04:42,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {142#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {142#true} is VALID [2018-11-23 13:04:42,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {142#true} assume !(~x~0 > 0); {144#(<= ~x~0 0)} is VALID [2018-11-23 13:04:42,699 INFO L256 TraceCheckUtils]: 7: Hoare triple {144#(<= ~x~0 0)} call __VERIFIER_assert((if ~x~0 <= 0 then 1 else 0)); {145#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:04:42,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {145#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {146#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:42,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {146#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {143#false} is VALID [2018-11-23 13:04:42,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2018-11-23 13:04:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:42,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:42,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:04:42,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:04:42,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:42,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:42,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:42,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:42,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:42,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:42,790 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2018-11-23 13:04:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:43,064 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 13:04:43,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:43,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:04:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 13:04:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 13:04:43,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2018-11-23 13:04:43,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:43,116 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:04:43,116 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:04:43,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:04:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:04:43,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:43,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:43,119 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:43,119 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:43,120 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:43,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:43,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:43,120 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:43,120 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:43,121 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:43,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:43,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:43,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:43,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:04:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:04:43,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-11-23 13:04:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:43,123 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:04:43,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:43,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:43,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:04:43,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:43,530 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:43,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:43,530 INFO L448 ceAbstractionStarter]: For program point fooEXIT(lines 11 13) no Hoare annotation was computed. [2018-11-23 13:04:43,531 INFO L451 ceAbstractionStarter]: At program point fooENTRY(lines 11 13) the Hoare annotation is: true [2018-11-23 13:04:43,531 INFO L448 ceAbstractionStarter]: For program point fooFINAL(lines 11 13) no Hoare annotation was computed. [2018-11-23 13:04:43,531 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:43,531 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (<= ~x~0 0) [2018-11-23 13:04:43,531 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:43,532 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:43,532 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 14 22) the Hoare annotation is: (or (< 0 |old(~x~0)|) (<= ~x~0 0)) [2018-11-23 13:04:43,532 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 22) no Hoare annotation was computed. [2018-11-23 13:04:43,532 INFO L451 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: true [2018-11-23 13:04:43,532 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-23 13:04:43,532 INFO L451 ceAbstractionStarter]: At program point L19-1(lines 16 20) the Hoare annotation is: true [2018-11-23 13:04:43,532 INFO L451 ceAbstractionStarter]: At program point L18-1(line 18) the Hoare annotation is: true [2018-11-23 13:04:43,533 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 16 20) the Hoare annotation is: (or (< 0 |old(~x~0)|) (<= ~x~0 0)) [2018-11-23 13:04:43,533 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 22) no Hoare annotation was computed. [2018-11-23 13:04:43,533 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-23 13:04:43,533 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-23 13:04:43,533 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-23 13:04:43,534 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-23 13:04:43,534 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-23 13:04:43,534 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-23 13:04:43,536 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:04:43,536 WARN L170 areAnnotationChecker]: fooFINAL has no Hoare annotation [2018-11-23 13:04:43,536 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:04:43,536 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:04:43,537 WARN L170 areAnnotationChecker]: fooFINAL has no Hoare annotation [2018-11-23 13:04:43,537 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:43,550 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:04:43,550 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:04:43,550 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:04:43,551 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:43,551 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2018-11-23 13:04:43,551 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2018-11-23 13:04:43,551 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:43,551 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:43,551 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:04:43,551 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:04:43,551 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:43,551 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:43,552 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 13:04:43,552 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:43,552 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:04:43,552 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:04:43,552 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:04:43,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:04:43 BoogieIcfgContainer [2018-11-23 13:04:43,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:04:43,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:04:43,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:04:43,558 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:04:43,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:41" (3/4) ... [2018-11-23 13:04:43,562 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:04:43,570 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:04:43,570 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-23 13:04:43,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:04:43,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:04:43,575 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 13:04:43,575 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:04:43,624 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/trex02_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:04:43,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:04:43,626 INFO L168 Benchmark]: Toolchain (without parser) took 3208.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -689.3 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:43,628 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:43,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.36 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:43,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:43,630 INFO L168 Benchmark]: Boogie Preprocessor took 32.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:43,631 INFO L168 Benchmark]: RCFGBuilder took 611.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:43,631 INFO L168 Benchmark]: TraceAbstraction took 2115.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 80.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:43,632 INFO L168 Benchmark]: Witness Printer took 67.03 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:43,636 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.22 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 346.36 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.22 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 32.17 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 611.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2115.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 80.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. * Witness Printer took 67.03 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 16]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 6 SDslu, 41 SDs, 0 SdLazy, 4 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 12 PreInvPairs, 13 NumberOfFragments, 26 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...