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/jm2006_true-unreach-call.c.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:35:38,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:35:38,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:35:38,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:35:38,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:35:38,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:35:38,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:35:38,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:35:38,523 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:35:38,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:35:38,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:35:38,526 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:35:38,527 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:35:38,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:35:38,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:35:38,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:35:38,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:35:38,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:35:38,535 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:35:38,539 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:35:38,540 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:35:38,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:35:38,547 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:35:38,547 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:35:38,548 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:35:38,549 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:35:38,550 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:35:38,551 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:35:38,552 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:35:38,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:35:38,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:35:38,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:35:38,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:35:38,554 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:35:38,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:35:38,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:35:38,556 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-14 17:35:38,573 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:35:38,573 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:35:38,574 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:35:38,574 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:35:38,575 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:35:38,575 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:35:38,575 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:35:38,580 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:35:38,580 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:35:38,580 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:35:38,580 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:35:38,580 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:35:38,581 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:35:38,581 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:35:38,581 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:35:38,581 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:35:38,581 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:35:38,582 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:35:38,582 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:35:38,582 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:35:38,582 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:35:38,582 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:35:38,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:35:38,583 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:35:38,583 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:35:38,583 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:35:38,583 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:35:38,583 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:35:38,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:35:38,584 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:35:38,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:35:38,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:35:38,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:35:38,655 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:35:38,656 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:35:38,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_true-unreach-call.c.i.v+cfa-reducer.c [2018-11-14 17:35:38,729 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211129d7e/01f6d5a671ae4c0bb64d00da778861cd/FLAG413986fe6 [2018-11-14 17:35:39,142 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:35:39,142 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_true-unreach-call.c.i.v+cfa-reducer.c [2018-11-14 17:35:39,149 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211129d7e/01f6d5a671ae4c0bb64d00da778861cd/FLAG413986fe6 [2018-11-14 17:35:39,165 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211129d7e/01f6d5a671ae4c0bb64d00da778861cd [2018-11-14 17:35:39,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:35:39,177 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:35:39,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:39,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:35:39,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:35:39,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:39" (1/1) ... [2018-11-14 17:35:39,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691a329e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39, skipping insertion in model container [2018-11-14 17:35:39,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:39" (1/1) ... [2018-11-14 17:35:39,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:35:39,223 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:35:39,471 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:39,478 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:35:39,507 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:39,527 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:35:39,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39 WrapperNode [2018-11-14 17:35:39,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:39,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:35:39,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:35:39,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:35:39,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39" (1/1) ... [2018-11-14 17:35:39,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39" (1/1) ... [2018-11-14 17:35:39,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39" (1/1) ... [2018-11-14 17:35:39,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39" (1/1) ... [2018-11-14 17:35:39,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39" (1/1) ... [2018-11-14 17:35:39,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39" (1/1) ... [2018-11-14 17:35:39,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39" (1/1) ... [2018-11-14 17:35:39,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:35:39,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:35:39,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:35:39,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:35:39,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39" (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-14 17:35:39,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:35:39,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:35:39,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:35:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:35:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:35:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:35:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:35:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:35:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:35:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:35:40,165 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:35:40,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:40 BoogieIcfgContainer [2018-11-14 17:35:40,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:35:40,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:35:40,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:35:40,170 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:35:40,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:35:39" (1/3) ... [2018-11-14 17:35:40,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4639f547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:40, skipping insertion in model container [2018-11-14 17:35:40,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:39" (2/3) ... [2018-11-14 17:35:40,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4639f547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:40, skipping insertion in model container [2018-11-14 17:35:40,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:40" (3/3) ... [2018-11-14 17:35:40,174 INFO L112 eAbstractionObserver]: Analyzing ICFG jm2006_true-unreach-call.c.i.v+cfa-reducer.c [2018-11-14 17:35:40,183 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:35:40,192 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:35:40,211 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:35:40,245 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:35:40,246 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:35:40,246 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:35:40,246 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:35:40,246 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:35:40,246 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:35:40,247 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:35:40,247 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:35:40,247 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:35:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-14 17:35:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:35:40,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:40,275 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:40,277 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:40,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:40,284 INFO L82 PathProgramCache]: Analyzing trace with hash -696314067, now seen corresponding path program 1 times [2018-11-14 17:35:40,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:40,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:40,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:40,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:40,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:41,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-14 17:35:41,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} ~__return_main~0 := 0;~__return_72~0 := 0; {22#(and (<= 0 ~__return_72~0) (<= ~__return_72~0 0))} is VALID [2018-11-14 17:35:41,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {22#(and (<= 0 ~__return_72~0) (<= ~__return_72~0 0))} assume true; {22#(and (<= 0 ~__return_72~0) (<= ~__return_72~0 0))} is VALID [2018-11-14 17:35:41,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22#(and (<= 0 ~__return_72~0) (<= ~__return_72~0 0))} {20#true} #32#return; {22#(and (<= 0 ~__return_72~0) (<= ~__return_72~0 0))} is VALID [2018-11-14 17:35:41,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {22#(and (<= 0 ~__return_72~0) (<= ~__return_72~0 0))} call #t~ret3 := main(); {20#true} is VALID [2018-11-14 17:35:41,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {20#true} havoc ~main__i~0;havoc ~main__j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__j~0 := #t~nondet2;havoc #t~nondet2; {20#true} is VALID [2018-11-14 17:35:41,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {20#true} assume !!(~main__i~0 >= 0); {20#true} is VALID [2018-11-14 17:35:41,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {20#true} assume !!(~main__j~0 >= 0);~main__x~0 := ~main__i~0;~main__y~0 := ~main__j~0; {23#(or (<= (+ main_~main__i~0 1) (+ main_~main__j~0 main_~main__x~0)) (= 0 main_~main__y~0))} is VALID [2018-11-14 17:35:41,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#(or (<= (+ main_~main__i~0 1) (+ main_~main__j~0 main_~main__x~0)) (= 0 main_~main__y~0))} assume !(~main__x~0 != 0); {24#(or (<= (+ main_~main__i~0 1) main_~main__j~0) (= 0 main_~main__y~0))} is VALID [2018-11-14 17:35:41,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#(or (<= (+ main_~main__i~0 1) main_~main__j~0) (= 0 main_~main__y~0))} assume ~main__i~0 == ~main__j~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-14 17:35:41,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {21#false} is VALID [2018-11-14 17:35:41,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-14 17:35:41,171 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-14 17:35:41,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:41,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:35:41,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 17:35:41,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:41,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:35:41,236 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-14 17:35:41,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:35:41,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:35:41,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:35:41,250 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 6 states. [2018-11-14 17:35:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:42,547 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-14 17:35:42,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:35:42,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 17:35:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-14 17:35:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-14 17:35:42,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2018-11-14 17:35:42,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:42,779 INFO L225 Difference]: With dead ends: 30 [2018-11-14 17:35:42,779 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 17:35:42,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:35:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 17:35:42,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 17:35:42,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:42,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:42,868 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:42,868 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:42,873 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 17:35:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:35:42,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:42,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:42,874 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:42,875 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:42,879 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 17:35:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:35:42,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:42,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:42,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:42,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:35:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 17:35:42,888 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-14 17:35:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:42,888 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 17:35:42,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:35:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:35:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:35:42,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:42,890 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:42,891 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:42,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash -112838900, now seen corresponding path program 1 times [2018-11-14 17:35:42,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:42,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:42,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:42,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:42,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:43,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2018-11-14 17:35:43,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {118#true} ~__return_main~0 := 0;~__return_72~0 := 0; {118#true} is VALID [2018-11-14 17:35:43,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2018-11-14 17:35:43,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #32#return; {118#true} is VALID [2018-11-14 17:35:43,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret3 := main(); {118#true} is VALID [2018-11-14 17:35:43,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {118#true} havoc ~main__i~0;havoc ~main__j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__j~0 := #t~nondet2;havoc #t~nondet2; {118#true} is VALID [2018-11-14 17:35:43,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {118#true} assume !!(~main__i~0 >= 0); {118#true} is VALID [2018-11-14 17:35:43,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {118#true} assume !!(~main__j~0 >= 0);~main__x~0 := ~main__i~0;~main__y~0 := ~main__j~0; {120#(and (= main_~main__j~0 main_~main__y~0) (<= main_~main__x~0 main_~main__i~0) (<= main_~main__i~0 main_~main__x~0))} is VALID [2018-11-14 17:35:43,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {120#(and (= main_~main__j~0 main_~main__y~0) (<= main_~main__x~0 main_~main__i~0) (<= main_~main__i~0 main_~main__x~0))} assume ~main__x~0 != 0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {121#(and (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)) (or (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)) (< 0 (+ main_~main__y~0 1))))} is VALID [2018-11-14 17:35:43,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {121#(and (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)) (or (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)) (< 0 (+ main_~main__y~0 1))))} assume !(~main__x~0 != 0); {122#(and (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)) (or (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0)) (< 0 (+ main_~main__y~0 1))))} is VALID [2018-11-14 17:35:43,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {122#(and (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)) (or (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0)) (< 0 (+ main_~main__y~0 1))))} assume ~main__i~0 == ~main__j~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; {123#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:43,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {123#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {119#false} is VALID [2018-11-14 17:35:43,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {119#false} assume !false; {119#false} is VALID [2018-11-14 17:35:43,189 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-14 17:35:43,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:35:43,190 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-14 17:35:43,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:43,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:43,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2018-11-14 17:35:43,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {118#true} ~__return_main~0 := 0;~__return_72~0 := 0; {118#true} is VALID [2018-11-14 17:35:43,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2018-11-14 17:35:43,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #32#return; {118#true} is VALID [2018-11-14 17:35:43,455 INFO L256 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret3 := main(); {118#true} is VALID [2018-11-14 17:35:43,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {118#true} havoc ~main__i~0;havoc ~main__j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__j~0 := #t~nondet2;havoc #t~nondet2; {118#true} is VALID [2018-11-14 17:35:43,456 INFO L273 TraceCheckUtils]: 6: Hoare triple {118#true} assume !!(~main__i~0 >= 0); {118#true} is VALID [2018-11-14 17:35:43,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {118#true} assume !!(~main__j~0 >= 0);~main__x~0 := ~main__i~0;~main__y~0 := ~main__j~0; {120#(and (= main_~main__j~0 main_~main__y~0) (<= main_~main__x~0 main_~main__i~0) (<= main_~main__i~0 main_~main__x~0))} is VALID [2018-11-14 17:35:43,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {120#(and (= main_~main__j~0 main_~main__y~0) (<= main_~main__x~0 main_~main__i~0) (<= main_~main__i~0 main_~main__x~0))} assume ~main__x~0 != 0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {151#(and (<= main_~main__i~0 (+ main_~main__x~0 1)) (<= (+ main_~main__x~0 1) main_~main__i~0) (= (+ main_~main__y~0 1) main_~main__j~0))} is VALID [2018-11-14 17:35:43,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {151#(and (<= main_~main__i~0 (+ main_~main__x~0 1)) (<= (+ main_~main__x~0 1) main_~main__i~0) (= (+ main_~main__y~0 1) main_~main__j~0))} assume !(~main__x~0 != 0); {155#(and (<= main_~main__i~0 1) (<= 1 main_~main__i~0) (= (+ main_~main__y~0 1) main_~main__j~0))} is VALID [2018-11-14 17:35:43,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {155#(and (<= main_~main__i~0 1) (<= 1 main_~main__i~0) (= (+ main_~main__y~0 1) main_~main__j~0))} assume ~main__i~0 == ~main__j~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; {123#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:43,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {123#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {119#false} is VALID [2018-11-14 17:35:43,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {119#false} assume !false; {119#false} is VALID [2018-11-14 17:35:43,468 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-14 17:35:43,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:35:43,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-14 17:35:43,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-11-14 17:35:43,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:43,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:35:43,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:43,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:35:43,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:35:43,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:35:43,539 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2018-11-14 17:35:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:44,242 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 17:35:44,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:35:44,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-11-14 17:35:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:35:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-14 17:35:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:35:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-14 17:35:44,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2018-11-14 17:35:44,294 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-14 17:35:44,295 INFO L225 Difference]: With dead ends: 22 [2018-11-14 17:35:44,295 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 17:35:44,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:35:44,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 17:35:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-14 17:35:44,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:44,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-14 17:35:44,345 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 17:35:44,346 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 17:35:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:44,347 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 17:35:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:35:44,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:44,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:44,349 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 17:35:44,349 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 17:35:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:44,351 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 17:35:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:35:44,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:44,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:44,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:44,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:35:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-14 17:35:44,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-14 17:35:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:44,354 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-14 17:35:44,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:35:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:35:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:35:44,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:44,356 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:44,356 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:44,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:44,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1126058196, now seen corresponding path program 2 times [2018-11-14 17:35:44,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:44,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:44,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:44,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:44,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:44,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2018-11-14 17:35:44,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {258#true} ~__return_main~0 := 0;~__return_72~0 := 0; {258#true} is VALID [2018-11-14 17:35:44,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2018-11-14 17:35:44,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #32#return; {258#true} is VALID [2018-11-14 17:35:44,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret3 := main(); {258#true} is VALID [2018-11-14 17:35:44,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {258#true} havoc ~main__i~0;havoc ~main__j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__j~0 := #t~nondet2;havoc #t~nondet2; {258#true} is VALID [2018-11-14 17:35:44,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {258#true} assume !!(~main__i~0 >= 0); {258#true} is VALID [2018-11-14 17:35:44,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#true} assume !!(~main__j~0 >= 0);~main__x~0 := ~main__i~0;~main__y~0 := ~main__j~0; {260#(and (= main_~main__j~0 main_~main__y~0) (<= main_~main__x~0 main_~main__i~0) (<= main_~main__i~0 main_~main__x~0))} is VALID [2018-11-14 17:35:44,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {260#(and (= main_~main__j~0 main_~main__y~0) (<= main_~main__x~0 main_~main__i~0) (<= main_~main__i~0 main_~main__x~0))} assume ~main__x~0 != 0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {261#(and (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)) (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)))} is VALID [2018-11-14 17:35:44,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {261#(and (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)) (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)))} assume ~main__x~0 != 0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {261#(and (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)) (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)))} is VALID [2018-11-14 17:35:44,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {261#(and (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)) (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)))} assume ~main__x~0 != 0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {262#(and (or (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__y~0 main_~main__i~0)) (< 0 (+ main_~main__y~0 1))) (or (<= (+ main_~main__y~0 main_~main__i~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} is VALID [2018-11-14 17:35:44,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {262#(and (or (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__y~0 main_~main__i~0)) (< 0 (+ main_~main__y~0 1))) (or (<= (+ main_~main__y~0 main_~main__i~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} assume !(~main__x~0 != 0); {263#(and (or (<= main_~main__j~0 (+ main_~main__y~0 main_~main__i~0)) (< 0 (+ main_~main__y~0 1))) (or (<= (+ main_~main__y~0 main_~main__i~0) main_~main__j~0) (<= main_~main__y~0 0)))} is VALID [2018-11-14 17:35:44,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {263#(and (or (<= main_~main__j~0 (+ main_~main__y~0 main_~main__i~0)) (< 0 (+ main_~main__y~0 1))) (or (<= (+ main_~main__y~0 main_~main__i~0) main_~main__j~0) (<= main_~main__y~0 0)))} assume ~main__i~0 == ~main__j~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; {264#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:44,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {264#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {259#false} is VALID [2018-11-14 17:35:44,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {259#false} assume !false; {259#false} is VALID [2018-11-14 17:35:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 17:35:44,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:35:44,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:35:44,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:35:44,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:35:44,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:44,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:45,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2018-11-14 17:35:45,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {258#true} ~__return_main~0 := 0;~__return_72~0 := 0; {258#true} is VALID [2018-11-14 17:35:45,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2018-11-14 17:35:45,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #32#return; {258#true} is VALID [2018-11-14 17:35:45,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret3 := main(); {258#true} is VALID [2018-11-14 17:35:45,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {258#true} havoc ~main__i~0;havoc ~main__j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__j~0 := #t~nondet2;havoc #t~nondet2; {258#true} is VALID [2018-11-14 17:35:45,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {258#true} assume !!(~main__i~0 >= 0); {258#true} is VALID [2018-11-14 17:35:45,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#true} assume !!(~main__j~0 >= 0);~main__x~0 := ~main__i~0;~main__y~0 := ~main__j~0; {260#(and (= main_~main__j~0 main_~main__y~0) (<= main_~main__x~0 main_~main__i~0) (<= main_~main__i~0 main_~main__x~0))} is VALID [2018-11-14 17:35:45,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {260#(and (= main_~main__j~0 main_~main__y~0) (<= main_~main__x~0 main_~main__i~0) (<= main_~main__i~0 main_~main__x~0))} assume ~main__x~0 != 0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {292#(and (<= main_~main__i~0 (+ main_~main__x~0 1)) (<= (+ main_~main__x~0 1) main_~main__i~0) (= (+ main_~main__y~0 1) main_~main__j~0))} is VALID [2018-11-14 17:35:45,034 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#(and (<= main_~main__i~0 (+ main_~main__x~0 1)) (<= (+ main_~main__x~0 1) main_~main__i~0) (= (+ main_~main__y~0 1) main_~main__j~0))} assume ~main__x~0 != 0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {296#(and (<= main_~main__i~0 (+ main_~main__x~0 2)) (= (+ main_~main__y~0 2) main_~main__j~0) (<= (+ main_~main__x~0 2) main_~main__i~0))} is VALID [2018-11-14 17:35:45,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {296#(and (<= main_~main__i~0 (+ main_~main__x~0 2)) (= (+ main_~main__y~0 2) main_~main__j~0) (<= (+ main_~main__x~0 2) main_~main__i~0))} assume ~main__x~0 != 0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {300#(and (<= main_~main__i~0 (+ main_~main__x~0 3)) (= (+ main_~main__y~0 3) main_~main__j~0) (not (= (+ main_~main__x~0 1) 0)) (<= (+ main_~main__x~0 3) main_~main__i~0))} is VALID [2018-11-14 17:35:45,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {300#(and (<= main_~main__i~0 (+ main_~main__x~0 3)) (= (+ main_~main__y~0 3) main_~main__j~0) (not (= (+ main_~main__x~0 1) 0)) (<= (+ main_~main__x~0 3) main_~main__i~0))} assume !(~main__x~0 != 0); {304#(and (<= main_~main__i~0 3) (= (+ main_~main__y~0 3) main_~main__j~0) (<= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:45,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {304#(and (<= main_~main__i~0 3) (= (+ main_~main__y~0 3) main_~main__j~0) (<= 3 main_~main__i~0))} assume ~main__i~0 == ~main__j~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; {264#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:45,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {264#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {259#false} is VALID [2018-11-14 17:35:45,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {259#false} assume !false; {259#false} is VALID [2018-11-14 17:35:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:45,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:35:45,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-11-14 17:35:45,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-11-14 17:35:45,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:45,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:35:45,097 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-14 17:35:45,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:35:45,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:35:45,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:35:45,099 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 11 states. [2018-11-14 17:35:45,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:45,757 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-14 17:35:45,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:35:45,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-11-14 17:35:45,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:35:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2018-11-14 17:35:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:35:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2018-11-14 17:35:45,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 20 transitions. [2018-11-14 17:35:45,838 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-14 17:35:45,838 INFO L225 Difference]: With dead ends: 19 [2018-11-14 17:35:45,838 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:35:45,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:35:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:35:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:35:45,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:45,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:45,840 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:45,840 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:45,840 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:45,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:45,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:45,841 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:45,841 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:45,842 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:45,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:45,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:45,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:45,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:35:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:35:45,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-14 17:35:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:45,843 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:35:45,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:35:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:45,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:45,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:35:46,007 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:35:46,007 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:35:46,008 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:46,008 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:46,008 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~__return_72~0) (<= ~__return_72~0 0)) [2018-11-14 17:35:46,008 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:35:46,008 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:35:46,008 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 8 65) the Hoare annotation is: (or (< 0 |old(~__return_72~0)|) (< |old(~__return_72~0)| 0) (and (<= 0 ~__return_72~0) (<= ~__return_72~0 0))) [2018-11-14 17:35:46,009 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 65) no Hoare annotation was computed. [2018-11-14 17:35:46,009 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 63) no Hoare annotation was computed. [2018-11-14 17:35:46,009 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-14 17:35:46,009 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 64) no Hoare annotation was computed. [2018-11-14 17:35:46,009 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 55) no Hoare annotation was computed. [2018-11-14 17:35:46,009 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 65) no Hoare annotation was computed. [2018-11-14 17:35:46,009 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-11-14 17:35:46,009 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 61) no Hoare annotation was computed. [2018-11-14 17:35:46,010 INFO L421 ceAbstractionStarter]: At program point L35(lines 25 63) the Hoare annotation is: (or (< 0 |old(~__return_72~0)|) (< |old(~__return_72~0)| 0) (let ((.cse1 (+ main_~main__i~0 main_~main__y~0)) (.cse0 (+ main_~main__j~0 main_~main__x~0))) (and (<= .cse0 .cse1) (<= 0 ~__return_72~0) (<= .cse1 .cse0) (<= ~__return_72~0 0)))) [2018-11-14 17:35:46,011 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:35:46,012 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 17:35:46,012 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:35:46,012 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:46,017 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 17:35:46,018 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 17:35:46,018 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:35:46,018 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:46,018 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:35:46,018 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 17:35:46,018 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 17:35:46,018 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:35:46,022 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-14 17:35:46,022 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-14 17:35:46,022 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-14 17:35:46,022 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-14 17:35:46,022 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-14 17:35:46,022 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2018-11-14 17:35:46,022 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2018-11-14 17:35:46,023 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:35:46,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:35:46 BoogieIcfgContainer [2018-11-14 17:35:46,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:35:46,036 INFO L168 Benchmark]: Toolchain (without parser) took 6859.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -419.9 MB). Peak memory consumption was 305.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:46,038 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-14 17:35:46,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.68 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-14 17:35:46,039 INFO L168 Benchmark]: Boogie Preprocessor took 34.21 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-14 17:35:46,040 INFO L168 Benchmark]: RCFGBuilder took 602.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:46,041 INFO L168 Benchmark]: TraceAbstraction took 5867.73 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 344.5 MB). Peak memory consumption was 344.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:46,045 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 349.68 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 34.21 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 602.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5867.73 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 344.5 MB). Peak memory consumption was 344.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: 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: 25]: Loop Invariant Derived loop invariant: (0 < \old(__return_72) || \old(__return_72) < 0) || (((main__j + main__x <= main__i + main__y && 0 <= __return_72) && main__i + main__y <= main__j + main__x) && __return_72 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 17 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 41 SDslu, 121 SDs, 0 SdLazy, 120 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 9 NumberOfFragments, 55 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 123 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 4507 SizeOfPredicates, 12 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...