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-lit/hhk2008_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:27,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:27,502 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:27,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:27,515 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:27,516 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:27,517 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:27,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:27,521 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:27,522 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:27,523 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:27,523 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:27,524 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:27,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:27,526 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:27,527 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:27,528 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:27,530 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:27,532 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:27,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:27,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:27,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:27,542 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:27,542 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:27,542 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:27,543 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:27,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:27,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:27,552 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:27,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:27,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:27,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:27,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:27,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:27,561 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:27,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:27,562 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:12:27,592 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:27,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:27,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:27,593 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:27,594 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:27,594 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:27,594 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:27,594 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:27,595 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:27,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:27,595 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:27,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:27,595 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:27,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:27,596 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:27,596 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:27,596 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:27,596 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:27,597 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:27,597 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:27,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:27,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:27,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:27,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:27,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:27,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:27,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:27,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:27,599 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:27,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:27,599 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:27,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:27,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:27,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:27,674 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:27,675 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:27,675 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008_true-unreach-call_true-termination.c.i [2018-11-23 13:12:27,738 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ce53470/31acc4e2eac740479c329efc2a384d57/FLAGd28b750ae [2018-11-23 13:12:28,140 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:28,140 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008_true-unreach-call_true-termination.c.i [2018-11-23 13:12:28,147 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ce53470/31acc4e2eac740479c329efc2a384d57/FLAGd28b750ae [2018-11-23 13:12:28,541 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ce53470/31acc4e2eac740479c329efc2a384d57 [2018-11-23 13:12:28,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:28,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:28,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:28,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:28,562 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:28,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1139db17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28, skipping insertion in model container [2018-11-23 13:12:28,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:28,602 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:28,852 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:28,857 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:28,878 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:28,896 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:28,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28 WrapperNode [2018-11-23 13:12:28,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:28,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:28,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:28,898 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:28,908 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:12:28" (1/1) ... [2018-11-23 13:12:28,914 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:12:28" (1/1) ... [2018-11-23 13:12:28,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:28,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:28,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:28,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:28,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:28,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:28,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:28,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:28,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (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:12:29,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:29,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:29,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:29,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:29,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:29,084 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:29,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:29,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:29,730 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:29,730 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:29,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:29 BoogieIcfgContainer [2018-11-23 13:12:29,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:29,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:29,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:29,736 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:29,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:28" (1/3) ... [2018-11-23 13:12:29,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ddedb5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:29, skipping insertion in model container [2018-11-23 13:12:29,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (2/3) ... [2018-11-23 13:12:29,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ddedb5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:29, skipping insertion in model container [2018-11-23 13:12:29,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:29" (3/3) ... [2018-11-23 13:12:29,740 INFO L112 eAbstractionObserver]: Analyzing ICFG hhk2008_true-unreach-call_true-termination.c.i [2018-11-23 13:12:29,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:29,758 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:29,774 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:29,810 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:29,811 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:29,811 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:29,811 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:29,812 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:29,812 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:29,812 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:29,812 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:29,813 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 13:12:29,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:12:29,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:29,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:29,841 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:29,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1632835705, now seen corresponding path program 1 times [2018-11-23 13:12:29,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:29,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:29,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:29,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:29,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 13:12:30,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 13:12:30,578 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #40#return; {23#true} is VALID [2018-11-23 13:12:30,578 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-23 13:12:30,578 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {23#true} is VALID [2018-11-23 13:12:30,579 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~a~0 <= 1000000); {23#true} is VALID [2018-11-23 13:12:30,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {25#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (< main_~res~0 (+ main_~a~0 main_~b~0 1)))} is VALID [2018-11-23 13:12:30,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (< main_~res~0 (+ main_~a~0 main_~b~0 1)))} assume !(~cnt~0 > 0); {26#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (< main_~res~0 (+ main_~a~0 main_~b~0 1)))} is VALID [2018-11-23 13:12:30,589 INFO L256 TraceCheckUtils]: 8: Hoare triple {26#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (< main_~res~0 (+ main_~a~0 main_~b~0 1)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {27#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:30,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {27#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {28#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:30,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {24#false} is VALID [2018-11-23 13:12:30,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 13:12:30,597 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:12:30,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:30,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:12:30,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:12:30,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:30,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:30,660 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:12:30,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:30,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:30,673 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 6 states. [2018-11-23 13:12:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:31,460 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 13:12:31,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:12:31,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:12:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 13:12:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 13:12:31,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2018-11-23 13:12:31,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:31,928 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:12:31,929 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:12:31,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:12:31,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:12:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:12:31,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:31,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:31,994 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:31,994 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:31,997 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:12:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:31,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:31,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:31,998 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:31,998 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:32,001 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:12:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:32,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:32,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:32,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:32,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:12:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:12:32,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:12:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:32,006 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:12:32,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:12:32,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:32,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:32,008 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:32,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:32,008 INFO L82 PathProgramCache]: Analyzing trace with hash -886162946, now seen corresponding path program 1 times [2018-11-23 13:12:32,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:32,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:32,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:32,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:32,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:32,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2018-11-23 13:12:32,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2018-11-23 13:12:32,327 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #40#return; {136#true} is VALID [2018-11-23 13:12:32,327 INFO L256 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret3 := main(); {136#true} is VALID [2018-11-23 13:12:32,327 INFO L273 TraceCheckUtils]: 4: Hoare triple {136#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {136#true} is VALID [2018-11-23 13:12:32,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {136#true} assume !!(~a~0 <= 1000000); {136#true} is VALID [2018-11-23 13:12:32,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {136#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {138#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:32,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {138#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {139#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (< main_~res~0 (+ main_~a~0 main_~b~0 1)))} is VALID [2018-11-23 13:12:32,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {139#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (< main_~res~0 (+ main_~a~0 main_~b~0 1)))} assume !(~cnt~0 > 0); {140#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (< main_~res~0 (+ main_~a~0 main_~b~0 1)))} is VALID [2018-11-23 13:12:32,337 INFO L256 TraceCheckUtils]: 9: Hoare triple {140#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (< main_~res~0 (+ main_~a~0 main_~b~0 1)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {141#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:32,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {141#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {142#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:32,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {142#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {137#false} is VALID [2018-11-23 13:12:32,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {137#false} assume !false; {137#false} is VALID [2018-11-23 13:12:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:32,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:32,342 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:12:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:32,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:32,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2018-11-23 13:12:32,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2018-11-23 13:12:32,666 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #40#return; {136#true} is VALID [2018-11-23 13:12:32,667 INFO L256 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret3 := main(); {136#true} is VALID [2018-11-23 13:12:32,667 INFO L273 TraceCheckUtils]: 4: Hoare triple {136#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {136#true} is VALID [2018-11-23 13:12:32,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {136#true} assume !!(~a~0 <= 1000000); {136#true} is VALID [2018-11-23 13:12:32,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {136#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {164#(and (= main_~res~0 main_~a~0) (= main_~cnt~0 main_~b~0))} is VALID [2018-11-23 13:12:32,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {164#(and (= main_~res~0 main_~a~0) (= main_~cnt~0 main_~b~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {168#(and (<= main_~b~0 (+ main_~cnt~0 1)) (< 0 main_~b~0) (= main_~res~0 (+ main_~a~0 1)))} is VALID [2018-11-23 13:12:32,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {168#(and (<= main_~b~0 (+ main_~cnt~0 1)) (< 0 main_~b~0) (= main_~res~0 (+ main_~a~0 1)))} assume !(~cnt~0 > 0); {172#(and (< 0 main_~b~0) (= main_~res~0 (+ main_~a~0 1)) (<= main_~b~0 1))} is VALID [2018-11-23 13:12:32,672 INFO L256 TraceCheckUtils]: 9: Hoare triple {172#(and (< 0 main_~b~0) (= main_~res~0 (+ main_~a~0 1)) (<= main_~b~0 1))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {141#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:32,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {141#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {142#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:32,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {142#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {137#false} is VALID [2018-11-23 13:12:32,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {137#false} assume !false; {137#false} is VALID [2018-11-23 13:12:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:32,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:32,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 13:12:32,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 13:12:32,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:32,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:12:32,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:32,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:12:32,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:12:32,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:12:32,840 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2018-11-23 13:12:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:33,537 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:12:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:12:33,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 13:12:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:12:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-11-23 13:12:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:12:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-11-23 13:12:33,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 17 transitions. [2018-11-23 13:12:33,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:33,568 INFO L225 Difference]: With dead ends: 16 [2018-11-23 13:12:33,568 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:33,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:12:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:33,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:33,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:33,571 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:33,571 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:33,571 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:33,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:33,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:33,572 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:33,572 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:33,572 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:33,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:33,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:33,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:33,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:33,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-23 13:12:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:33,573 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:33,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:12:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:33,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:33,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:33,715 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:33,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:33,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:33,715 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:33,716 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:33,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:33,716 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 24) the Hoare annotation is: true [2018-11-23 13:12:33,716 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 24) no Hoare annotation was computed. [2018-11-23 13:12:33,716 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-23 13:12:33,716 INFO L444 ceAbstractionStarter]: At program point L18-2(lines 18 21) the Hoare annotation is: (let ((.cse1 (+ main_~res~0 main_~cnt~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (< main_~res~0 (+ main_~a~0 main_~b~0 1)) (<= .cse1 .cse0))) [2018-11-23 13:12:33,716 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-23 13:12:33,717 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 21) the Hoare annotation is: (and (<= (+ main_~a~0 main_~b~0) main_~res~0) (< main_~res~0 (+ main_~a~0 main_~b~0 1))) [2018-11-23 13:12:33,717 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-23 13:12:33,717 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 24) no Hoare annotation was computed. [2018-11-23 13:12:33,718 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:33,718 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:33,718 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:33,718 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:33,718 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:33,718 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:33,720 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:33,720 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:33,720 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:33,720 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:33,721 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:33,721 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:33,721 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:33,721 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:33,721 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:33,721 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:33,721 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:33,721 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:33,721 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:33,722 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:33,722 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:33,722 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:33,722 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:33,724 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:33,724 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:12:33,724 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:12:33,724 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:33,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:33 BoogieIcfgContainer [2018-11-23 13:12:33,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:33,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:33,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:33,735 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:33,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:29" (3/4) ... [2018-11-23 13:12:33,740 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:33,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:33,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:33,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:33,751 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:12:33,751 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:12:33,751 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:33,799 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/hhk2008_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 13:12:33,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:33,801 INFO L168 Benchmark]: Toolchain (without parser) took 5248.76 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -557.6 MB). Peak memory consumption was 160.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:33,803 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:12:33,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.65 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:12:33,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.53 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:12:33,804 INFO L168 Benchmark]: Boogie Preprocessor took 27.70 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:12:33,805 INFO L168 Benchmark]: RCFGBuilder took 780.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:33,806 INFO L168 Benchmark]: TraceAbstraction took 4002.43 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 194.7 MB). Peak memory consumption was 194.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:33,807 INFO L168 Benchmark]: Witness Printer took 64.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 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:12:33,811 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 339.65 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 24.53 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.70 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 780.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4002.43 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 194.7 MB). Peak memory consumption was 194.7 MB. Max. memory is 7.1 GB. * Witness Printer took 64.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. 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: 18]: Loop Invariant Derived loop invariant: (a + b <= res + cnt && res < a + b + 1) && res + cnt <= a + b - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 15 SDslu, 88 SDs, 0 SdLazy, 57 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 38 HoareAnnotationTreeSize, 10 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 73 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 1767 SizeOfPredicates, 3 NumberOfNonLiveVariables, 40 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...