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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-19 00:07:29,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 00:07:29,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 00:07:29,759 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 00:07:29,759 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 00:07:29,760 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 00:07:29,761 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 00:07:29,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 00:07:29,767 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 00:07:29,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 00:07:29,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 00:07:29,770 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 00:07:29,773 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 00:07:29,774 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 00:07:29,777 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 00:07:29,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 00:07:29,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 00:07:29,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 00:07:29,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 00:07:29,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 00:07:29,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 00:07:29,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 00:07:29,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 00:07:29,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 00:07:29,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 00:07:29,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 00:07:29,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 00:07:29,794 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 00:07:29,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 00:07:29,796 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 00:07:29,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 00:07:29,797 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 00:07:29,797 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 00:07:29,797 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 00:07:29,798 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 00:07:29,799 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 00:07:29,799 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-19 00:07:29,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 00:07:29,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 00:07:29,816 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-19 00:07:29,816 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-19 00:07:29,816 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 00:07:29,817 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 00:07:29,817 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 00:07:29,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 00:07:29,817 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 00:07:29,818 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-19 00:07:29,818 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 00:07:29,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 00:07:29,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-19 00:07:29,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 00:07:29,819 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-19 00:07:29,819 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 00:07:29,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-19 00:07:29,821 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 00:07:29,821 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-19 00:07:29,821 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 00:07:29,821 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 00:07:29,822 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 00:07:29,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 00:07:29,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 00:07:29,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 00:07:29,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 00:07:29,823 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-19 00:07:29,823 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-19 00:07:29,823 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 00:07:29,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-19 00:07:29,823 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-19 00:07:29,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 00:07:29,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 00:07:29,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 00:07:29,910 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 00:07:29,910 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 00:07:29,911 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.v+lhb-reducer.c [2018-11-19 00:07:29,976 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebbda266/2a28ce7ba0f54fb8bdeb5362da523a5c/FLAG81ceb647b [2018-11-19 00:07:30,426 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 00:07:30,426 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.v+lhb-reducer.c [2018-11-19 00:07:30,433 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebbda266/2a28ce7ba0f54fb8bdeb5362da523a5c/FLAG81ceb647b [2018-11-19 00:07:30,769 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebbda266/2a28ce7ba0f54fb8bdeb5362da523a5c [2018-11-19 00:07:30,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 00:07:30,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 00:07:30,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 00:07:30,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 00:07:30,787 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 00:07:30,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:07:30" (1/1) ... [2018-11-19 00:07:30,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3014c986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:30, skipping insertion in model container [2018-11-19 00:07:30,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:07:30" (1/1) ... [2018-11-19 00:07:30,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-19 00:07:30,831 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-19 00:07:31,064 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:07:31,074 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 00:07:31,106 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:07:31,124 INFO L195 MainTranslator]: Completed translation [2018-11-19 00:07:31,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:31 WrapperNode [2018-11-19 00:07:31,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 00:07:31,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 00:07:31,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 00:07:31,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 00:07:31,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:31" (1/1) ... [2018-11-19 00:07:31,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:31" (1/1) ... [2018-11-19 00:07:31,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:31" (1/1) ... [2018-11-19 00:07:31,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:31" (1/1) ... [2018-11-19 00:07:31,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:31" (1/1) ... [2018-11-19 00:07:31,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:31" (1/1) ... [2018-11-19 00:07:31,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:31" (1/1) ... [2018-11-19 00:07:31,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 00:07:31,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 00:07:31,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 00:07:31,156 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-19 00:07:31,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:31" (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-19 00:07:31,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 00:07:31,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 00:07:31,280 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 00:07:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-19 00:07:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-19 00:07:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-19 00:07:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-19 00:07:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 00:07:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-19 00:07:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-19 00:07:31,736 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 00:07:31,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:07:31 BoogieIcfgContainer [2018-11-19 00:07:31,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 00:07:31,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 00:07:31,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 00:07:31,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 00:07:31,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:07:30" (1/3) ... [2018-11-19 00:07:31,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166d5f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:07:31, skipping insertion in model container [2018-11-19 00:07:31,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:31" (2/3) ... [2018-11-19 00:07:31,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166d5f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:07:31, skipping insertion in model container [2018-11-19 00:07:31,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:07:31" (3/3) ... [2018-11-19 00:07:31,751 INFO L112 eAbstractionObserver]: Analyzing ICFG gsv2008_true-unreach-call.c.i.v+lhb-reducer.c [2018-11-19 00:07:31,764 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 00:07:31,775 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-19 00:07:31,791 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-19 00:07:31,819 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 00:07:31,820 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 00:07:31,820 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-19 00:07:31,820 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 00:07:31,820 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 00:07:31,820 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 00:07:31,820 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 00:07:31,821 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 00:07:31,821 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 00:07:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-19 00:07:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-19 00:07:31,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:31,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:31,850 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:31,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1883805102, now seen corresponding path program 1 times [2018-11-19 00:07:31,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:31,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:31,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:31,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:31,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:32,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-19 00:07:32,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} ~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {21#true} is VALID [2018-11-19 00:07:32,187 INFO L273 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-19 00:07:32,187 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #33#return; {21#true} is VALID [2018-11-19 00:07:32,187 INFO L256 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret2 := main(); {21#true} is VALID [2018-11-19 00:07:32,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__y~0 := #t~nondet1;havoc #t~nondet1; {23#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-19 00:07:32,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {23#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-19 00:07:32,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {23#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-19 00:07:32,195 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {24#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2018-11-19 00:07:32,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {24#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2018-11-19 00:07:32,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {25#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:07:32,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {22#false} is VALID [2018-11-19 00:07:32,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-19 00:07:32,201 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-19 00:07:32,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:07:32,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-19 00:07:32,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-19 00:07:32,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:32,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-19 00:07:32,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:32,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-19 00:07:32,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-19 00:07:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:07:32,315 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2018-11-19 00:07:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:32,997 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-19 00:07:32,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-19 00:07:32,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-19 00:07:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:07:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2018-11-19 00:07:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:07:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2018-11-19 00:07:33,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2018-11-19 00:07:33,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:33,201 INFO L225 Difference]: With dead ends: 33 [2018-11-19 00:07:33,202 INFO L226 Difference]: Without dead ends: 16 [2018-11-19 00:07:33,205 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-19 00:07:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-19 00:07:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-19 00:07:33,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:33,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-19 00:07:33,246 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-19 00:07:33,246 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-19 00:07:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:33,249 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-19 00:07:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-19 00:07:33,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:33,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:33,251 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-19 00:07:33,251 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-19 00:07:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:33,254 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-19 00:07:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-19 00:07:33,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:33,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:33,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:33,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-19 00:07:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-19 00:07:33,260 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-19 00:07:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:33,260 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-19 00:07:33,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-19 00:07:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-19 00:07:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-19 00:07:33,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:33,262 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:33,262 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:33,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:33,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2141584271, now seen corresponding path program 1 times [2018-11-19 00:07:33,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:33,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:33,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:33,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {125#true} call ULTIMATE.init(); {125#true} is VALID [2018-11-19 00:07:33,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {125#true} ~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {125#true} is VALID [2018-11-19 00:07:33,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#true} assume true; {125#true} is VALID [2018-11-19 00:07:33,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} #33#return; {125#true} is VALID [2018-11-19 00:07:33,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {125#true} call #t~ret2 := main(); {125#true} is VALID [2018-11-19 00:07:33,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {125#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__y~0 := #t~nondet1;havoc #t~nondet1; {127#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-19 00:07:33,507 INFO L273 TraceCheckUtils]: 6: Hoare triple {127#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {127#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-19 00:07:33,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {127#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {127#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-19 00:07:33,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {127#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {128#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2018-11-19 00:07:33,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {128#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {128#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2018-11-19 00:07:33,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {128#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {129#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2018-11-19 00:07:33,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {129#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {129#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2018-11-19 00:07:33,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {129#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {130#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:07:33,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {130#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {126#false} is VALID [2018-11-19 00:07:33,541 INFO L273 TraceCheckUtils]: 14: Hoare triple {126#false} assume !false; {126#false} is VALID [2018-11-19 00:07:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:07:33,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:07:33,543 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-19 00:07:33,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:33,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:07:34,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {125#true} call ULTIMATE.init(); {125#true} is VALID [2018-11-19 00:07:34,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {125#true} ~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {125#true} is VALID [2018-11-19 00:07:34,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#true} assume true; {125#true} is VALID [2018-11-19 00:07:34,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} #33#return; {125#true} is VALID [2018-11-19 00:07:34,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {125#true} call #t~ret2 := main(); {125#true} is VALID [2018-11-19 00:07:34,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {125#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__y~0 := #t~nondet1;havoc #t~nondet1; {125#true} is VALID [2018-11-19 00:07:34,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {125#true} assume !!(-1000 < ~main__y~0); {125#true} is VALID [2018-11-19 00:07:34,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {125#true} assume !!(~main__y~0 < 1000000); {125#true} is VALID [2018-11-19 00:07:34,248 INFO L273 TraceCheckUtils]: 8: Hoare triple {125#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {158#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2018-11-19 00:07:34,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {158#(<= (+ main_~main__x~0 2) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {158#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2018-11-19 00:07:34,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {158#(<= (+ main_~main__x~0 2) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {165#(exists ((v_main_~main__y~0_13 Int)) (and (<= (+ v_main_~main__y~0_13 1) main_~main__y~0) (<= (+ main_~main__x~0 2) (* 2 v_main_~main__y~0_13))))} is VALID [2018-11-19 00:07:34,253 INFO L273 TraceCheckUtils]: 11: Hoare triple {165#(exists ((v_main_~main__y~0_13 Int)) (and (<= (+ v_main_~main__y~0_13 1) main_~main__y~0) (<= (+ main_~main__x~0 2) (* 2 v_main_~main__y~0_13))))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {165#(exists ((v_main_~main__y~0_13 Int)) (and (<= (+ v_main_~main__y~0_13 1) main_~main__y~0) (<= (+ main_~main__x~0 2) (* 2 v_main_~main__y~0_13))))} is VALID [2018-11-19 00:07:34,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {165#(exists ((v_main_~main__y~0_13 Int)) (and (<= (+ v_main_~main__y~0_13 1) main_~main__y~0) (<= (+ main_~main__x~0 2) (* 2 v_main_~main__y~0_13))))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {130#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:07:34,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {130#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {126#false} is VALID [2018-11-19 00:07:34,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {126#false} assume !false; {126#false} is VALID [2018-11-19 00:07:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:07:34,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:07:34,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-19 00:07:34,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-19 00:07:34,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:34,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-19 00:07:34,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:34,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-19 00:07:34,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-19 00:07:34,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-19 00:07:34,424 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2018-11-19 00:07:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:34,776 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-19 00:07:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-19 00:07:34,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-19 00:07:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-19 00:07:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-19 00:07:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-19 00:07:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-19 00:07:34,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-19 00:07:34,840 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-19 00:07:34,840 INFO L225 Difference]: With dead ends: 19 [2018-11-19 00:07:34,840 INFO L226 Difference]: Without dead ends: 0 [2018-11-19 00:07:34,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-19 00:07:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-19 00:07:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-19 00:07:34,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:34,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:34,842 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:34,842 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:34,843 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 00:07:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:34,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:34,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:34,843 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:34,844 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:34,844 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 00:07:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:34,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:34,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:34,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:34,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-19 00:07:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-19 00:07:34,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-19 00:07:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:34,846 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-19 00:07:34,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-19 00:07:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:34,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:34,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-19 00:07:34,984 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-19 00:07:34,984 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-19 00:07:34,984 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-19 00:07:34,984 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-19 00:07:34,985 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-19 00:07:34,985 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-19 00:07:34,985 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-19 00:07:34,985 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 69) the Hoare annotation is: true [2018-11-19 00:07:34,985 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 66) no Hoare annotation was computed. [2018-11-19 00:07:34,985 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 69) no Hoare annotation was computed. [2018-11-19 00:07:34,985 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 67) no Hoare annotation was computed. [2018-11-19 00:07:34,985 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-19 00:07:34,985 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 59) no Hoare annotation was computed. [2018-11-19 00:07:34,986 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 68) no Hoare annotation was computed. [2018-11-19 00:07:34,986 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 69) no Hoare annotation was computed. [2018-11-19 00:07:34,986 INFO L421 ceAbstractionStarter]: At program point L41(lines 28 62) the Hoare annotation is: (or (and (<= (+ main_~main__x~0 2) main_~main__y~0) (exists ((v_main_~main__y~0_13 Int)) (and (<= (+ v_main_~main__y~0_13 1) main_~main__y~0) (<= (+ main_~main__x~0 2) (* 2 v_main_~main__y~0_13))))) (<= (+ main_~main__x~0 51) main_~main__y~0)) [2018-11-19 00:07:34,986 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2018-11-19 00:07:34,986 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 61) no Hoare annotation was computed. [2018-11-19 00:07:34,988 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-19 00:07:34,988 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-19 00:07:34,988 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-19 00:07:34,988 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-19 00:07:34,988 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-19 00:07:34,989 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-19 00:07:34,989 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-19 00:07:34,989 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-19 00:07:34,989 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-19 00:07:34,989 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-19 00:07:34,989 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-19 00:07:34,989 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-19 00:07:34,989 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-19 00:07:34,989 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-19 00:07:34,989 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-19 00:07:34,990 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-19 00:07:34,990 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-19 00:07:34,990 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-19 00:07:34,990 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-19 00:07:34,990 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-19 00:07:34,990 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-19 00:07:34,990 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-19 00:07:34,995 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] [2018-11-19 00:07:34,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] [2018-11-19 00:07:35,000 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] [2018-11-19 00:07:35,000 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] [2018-11-19 00:07:35,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:07:35 BoogieIcfgContainer [2018-11-19 00:07:35,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-19 00:07:35,003 INFO L168 Benchmark]: Toolchain (without parser) took 4225.50 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -578.4 MB). Peak memory consumption was 129.4 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:35,005 INFO L168 Benchmark]: CDTParser took 0.20 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-19 00:07:35,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.15 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-19 00:07:35,007 INFO L168 Benchmark]: Boogie Preprocessor took 29.65 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-19 00:07:35,008 INFO L168 Benchmark]: RCFGBuilder took 581.74 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:35,009 INFO L168 Benchmark]: TraceAbstraction took 3263.39 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 156.1 MB). Peak memory consumption was 156.1 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:35,013 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.20 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. * CACSL2BoogieTranslator took 345.15 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 Preprocessor took 29.65 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 581.74 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3263.39 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 156.1 MB). Peak memory consumption was 156.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: 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: 28]: Loop Invariant [2018-11-19 00:07:35,022 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] [2018-11-19 00:07:35,023 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] [2018-11-19 00:07:35,023 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] [2018-11-19 00:07:35,023 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__y~0_13,QUANTIFIED] Derived loop invariant: (main__x + 2 <= main__y && (\exists v_main_~main__y~0_13 : int :: v_main_~main__y~0_13 + 1 <= main__y && main__x + 2 <= 2 * v_main_~main__y~0_13)) || main__x + 51 <= main__y - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. SAFE Result, 3.1s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 13 SDslu, 86 SDs, 0 SdLazy, 49 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 5 LocationsWithAnnotation, 5 PreInvPairs, 7 NumberOfFragments, 30 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 13 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 40 ConstructedInterpolants, 2 QuantifiedInterpolants, 1780 SizeOfPredicates, 4 NumberOfNonLiveVariables, 70 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...