java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/for_bounded_loop1_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:21:57,273 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:21:57,275 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:21:57,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:21:57,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:21:57,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:21:57,290 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:21:57,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:21:57,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:21:57,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:21:57,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:21:57,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:21:57,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:21:57,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:21:57,299 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:21:57,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:21:57,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:21:57,303 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:21:57,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:21:57,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:21:57,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:21:57,309 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:21:57,311 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:21:57,312 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:21:57,312 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:21:57,313 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:21:57,314 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:21:57,315 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:21:57,316 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:21:57,317 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:21:57,317 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:21:57,318 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:21:57,318 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:21:57,318 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:21:57,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:21:57,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:21:57,321 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:21:57,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:21:57,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:21:57,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:21:57,342 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:21:57,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:21:57,343 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:21:57,343 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:21:57,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:21:57,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:21:57,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:21:57,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:21:57,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:21:57,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:21:57,345 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:21:57,345 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:21:57,345 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:21:57,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:21:57,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:21:57,346 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:21:57,346 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:21:57,346 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:21:57,346 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:21:57,346 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:21:57,347 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:21:57,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:21:57,347 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:21:57,347 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:21:57,347 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:21:57,348 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:21:57,348 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:21:57,348 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:21:57,348 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:21:57,348 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:21:57,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:21:57,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:21:57,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:21:57,416 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:21:57,416 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:21:57,417 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-23 11:21:57,489 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6173a8ba8/0c53832fc15d4c579ba3f9893e6c5d88/FLAGd06e75439 [2018-11-23 11:21:57,976 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:21:57,977 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-23 11:21:57,984 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6173a8ba8/0c53832fc15d4c579ba3f9893e6c5d88/FLAGd06e75439 [2018-11-23 11:21:58,353 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6173a8ba8/0c53832fc15d4c579ba3f9893e6c5d88 [2018-11-23 11:21:58,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:21:58,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:21:58,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:21:58,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:21:58,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:21:58,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239a5e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58, skipping insertion in model container [2018-11-23 11:21:58,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:21:58,411 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:21:58,622 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:21:58,628 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:21:58,649 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:21:58,663 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:21:58,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58 WrapperNode [2018-11-23 11:21:58,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:21:58,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:21:58,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:21:58,665 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:21:58,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:21:58,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:21:58,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:21:58,687 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:21:58,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (1/1) ... [2018-11-23 11:21:58,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:21:58,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:21:58,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:21:58,715 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:21:58,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:21:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:21:58,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:21:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:21:58,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:21:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:21:58,851 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:21:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:21:58,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:21:59,317 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:21:59,318 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:21:59,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:21:59 BoogieIcfgContainer [2018-11-23 11:21:59,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:21:59,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:21:59,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:21:59,323 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:21:59,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:21:58" (1/3) ... [2018-11-23 11:21:59,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a98e925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:21:59, skipping insertion in model container [2018-11-23 11:21:59,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:58" (2/3) ... [2018-11-23 11:21:59,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a98e925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:21:59, skipping insertion in model container [2018-11-23 11:21:59,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:21:59" (3/3) ... [2018-11-23 11:21:59,328 INFO L112 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-23 11:21:59,338 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:21:59,346 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:21:59,362 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:21:59,392 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:21:59,393 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:21:59,393 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:21:59,394 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:21:59,394 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:21:59,394 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:21:59,394 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:21:59,394 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:21:59,394 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:21:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 11:21:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:21:59,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:59,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:21:59,422 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:59,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash 429908039, now seen corresponding path program 1 times [2018-11-23 11:21:59,432 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:59,433 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:59,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:59,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:59,806 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 11:21:59,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 11:21:59,811 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #43#return; {26#true} is VALID [2018-11-23 11:21:59,811 INFO L256 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret4 := main(); {26#true} is VALID [2018-11-23 11:21:59,825 INFO L273 TraceCheckUtils]: 4: Hoare triple {26#true} ~i~0 := 0bv32;~x~0 := 0bv32;~y~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {43#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:21:59,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} assume !!~bvsgt32(~n~0, 0bv32);~i~0 := 0bv32; {43#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:21:59,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);~x~0 := ~bvsub32(~x~0, ~y~0); {50#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:21:59,860 INFO L256 TraceCheckUtils]: 7: Hoare triple {50#(= main_~x~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); {54#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:59,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {54#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {58#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:59,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {27#false} is VALID [2018-11-23 11:21:59,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 11:21:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:59,891 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:21:59,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:21:59,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:21:59,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:21:59,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:59,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:22:00,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:00,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:22:00,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:22:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:22:00,075 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 6 states. [2018-11-23 11:22:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:00,827 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2018-11-23 11:22:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:22:00,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:22:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:22:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-23 11:22:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:22:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-23 11:22:00,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2018-11-23 11:22:01,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:01,368 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:22:01,368 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:22:01,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:22:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:22:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 11:22:01,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:01,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2018-11-23 11:22:01,453 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2018-11-23 11:22:01,453 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2018-11-23 11:22:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:01,459 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:22:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:22:01,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:01,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:01,460 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2018-11-23 11:22:01,461 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2018-11-23 11:22:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:01,465 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:22:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:22:01,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:01,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:01,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:01,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:22:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 11:22:01,472 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2018-11-23 11:22:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:01,473 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 11:22:01,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:22:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 11:22:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:22:01,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:01,474 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:01,475 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:01,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:01,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1060899037, now seen corresponding path program 1 times [2018-11-23 11:22:01,476 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:01,476 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:01,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:01,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID [2018-11-23 11:22:01,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-23 11:22:01,720 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} #43#return; {226#true} is VALID [2018-11-23 11:22:01,720 INFO L256 TraceCheckUtils]: 3: Hoare triple {226#true} call #t~ret4 := main(); {226#true} is VALID [2018-11-23 11:22:01,721 INFO L273 TraceCheckUtils]: 4: Hoare triple {226#true} ~i~0 := 0bv32;~x~0 := 0bv32;~y~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {243#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:01,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {243#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} assume !!~bvsgt32(~n~0, 0bv32);~i~0 := 0bv32; {243#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:01,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {243#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);~x~0 := ~bvsub32(~x~0, ~y~0); {250#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:01,725 INFO L256 TraceCheckUtils]: 7: Hoare triple {250#(= main_~x~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); {226#true} is VALID [2018-11-23 11:22:01,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {226#true} ~cond := #in~cond; {226#true} is VALID [2018-11-23 11:22:01,726 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#true} assume !(0bv32 == ~cond); {226#true} is VALID [2018-11-23 11:22:01,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-23 11:22:01,728 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {226#true} {250#(= main_~x~0 (_ bv0 32))} #47#return; {250#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:01,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {250#(= main_~x~0 (_ bv0 32))} ~y~0 := #t~nondet3;havoc #t~nondet3; {250#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:01,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {250#(= main_~x~0 (_ bv0 32))} assume !!(0bv32 != ~y~0);~x~0 := ~bvadd32(~x~0, ~y~0); {272#(not (= main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:01,760 INFO L256 TraceCheckUtils]: 14: Hoare triple {272#(not (= main_~x~0 (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); {276#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:01,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {276#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {280#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:01,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {280#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {227#false} is VALID [2018-11-23 11:22:01,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {227#false} assume !false; {227#false} is VALID [2018-11-23 11:22:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:01,767 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:22:01,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:22:01,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:22:01,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 11:22:01,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:01,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:22:01,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:01,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:22:01,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:22:01,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:22:01,841 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2018-11-23 11:22:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:02,432 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 11:22:02,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:22:02,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 11:22:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:22:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-11-23 11:22:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:22:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-11-23 11:22:02,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2018-11-23 11:22:02,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:02,541 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:22:02,541 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:22:02,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:22:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:22:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 11:22:02,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:02,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2018-11-23 11:22:02,583 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2018-11-23 11:22:02,583 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2018-11-23 11:22:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:02,587 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 11:22:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 11:22:02,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:02,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:02,588 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2018-11-23 11:22:02,588 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2018-11-23 11:22:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:02,592 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 11:22:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 11:22:02,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:02,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:02,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:02,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:22:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 11:22:02,597 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2018-11-23 11:22:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:02,597 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 11:22:02,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:22:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 11:22:02,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:22:02,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:02,599 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:02,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:02,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:02,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1417418910, now seen corresponding path program 1 times [2018-11-23 11:22:02,600 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:02,600 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:02,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:02,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:03,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2018-11-23 11:22:03,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 11:22:03,013 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #43#return; {457#true} is VALID [2018-11-23 11:22:03,014 INFO L256 TraceCheckUtils]: 3: Hoare triple {457#true} call #t~ret4 := main(); {457#true} is VALID [2018-11-23 11:22:03,015 INFO L273 TraceCheckUtils]: 4: Hoare triple {457#true} ~i~0 := 0bv32;~x~0 := 0bv32;~y~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {474#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:03,016 INFO L273 TraceCheckUtils]: 5: Hoare triple {474#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} assume !!~bvsgt32(~n~0, 0bv32);~i~0 := 0bv32; {474#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:03,017 INFO L273 TraceCheckUtils]: 6: Hoare triple {474#(and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);~x~0 := ~bvsub32(~x~0, ~y~0); {481#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:03,017 INFO L256 TraceCheckUtils]: 7: Hoare triple {481#(= main_~x~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); {457#true} is VALID [2018-11-23 11:22:03,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID [2018-11-23 11:22:03,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {457#true} assume !(0bv32 == ~cond); {457#true} is VALID [2018-11-23 11:22:03,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 11:22:03,018 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {457#true} {481#(= main_~x~0 (_ bv0 32))} #47#return; {481#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:03,019 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#(= main_~x~0 (_ bv0 32))} ~y~0 := #t~nondet3;havoc #t~nondet3; {481#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:03,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#(= main_~x~0 (_ bv0 32))} assume !!(0bv32 != ~y~0);~x~0 := ~bvadd32(~x~0, ~y~0); {503#(= main_~x~0 main_~y~0)} is VALID [2018-11-23 11:22:03,021 INFO L256 TraceCheckUtils]: 14: Hoare triple {503#(= main_~x~0 main_~y~0)} call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); {457#true} is VALID [2018-11-23 11:22:03,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID [2018-11-23 11:22:03,022 INFO L273 TraceCheckUtils]: 16: Hoare triple {457#true} assume !(0bv32 == ~cond); {457#true} is VALID [2018-11-23 11:22:03,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 11:22:03,024 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {457#true} {503#(= main_~x~0 main_~y~0)} #49#return; {503#(= main_~x~0 main_~y~0)} is VALID [2018-11-23 11:22:03,025 INFO L273 TraceCheckUtils]: 19: Hoare triple {503#(= main_~x~0 main_~y~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {503#(= main_~x~0 main_~y~0)} is VALID [2018-11-23 11:22:03,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {503#(= main_~x~0 main_~y~0)} assume !!~bvslt32(~i~0, ~n~0);~x~0 := ~bvsub32(~x~0, ~y~0); {481#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:03,034 INFO L256 TraceCheckUtils]: 21: Hoare triple {481#(= main_~x~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); {528#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:03,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {528#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {532#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:03,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {532#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {458#false} is VALID [2018-11-23 11:22:03,036 INFO L273 TraceCheckUtils]: 24: Hoare triple {458#false} assume !false; {458#false} is VALID [2018-11-23 11:22:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:22:03,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:03,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {458#false} assume !false; {458#false} is VALID [2018-11-23 11:22:03,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {542#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {458#false} is VALID [2018-11-23 11:22:03,233 INFO L273 TraceCheckUtils]: 22: Hoare triple {546#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {542#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:22:03,234 INFO L256 TraceCheckUtils]: 21: Hoare triple {481#(= main_~x~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); {546#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:22:03,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {503#(= main_~x~0 main_~y~0)} assume !!~bvslt32(~i~0, ~n~0);~x~0 := ~bvsub32(~x~0, ~y~0); {481#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:03,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {503#(= main_~x~0 main_~y~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {503#(= main_~x~0 main_~y~0)} is VALID [2018-11-23 11:22:03,238 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {457#true} {503#(= main_~x~0 main_~y~0)} #49#return; {503#(= main_~x~0 main_~y~0)} is VALID [2018-11-23 11:22:03,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 11:22:03,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {457#true} assume !(0bv32 == ~cond); {457#true} is VALID [2018-11-23 11:22:03,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID [2018-11-23 11:22:03,240 INFO L256 TraceCheckUtils]: 14: Hoare triple {503#(= main_~x~0 main_~y~0)} call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); {457#true} is VALID [2018-11-23 11:22:03,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#(= main_~x~0 (_ bv0 32))} assume !!(0bv32 != ~y~0);~x~0 := ~bvadd32(~x~0, ~y~0); {503#(= main_~x~0 main_~y~0)} is VALID [2018-11-23 11:22:03,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#(= main_~x~0 (_ bv0 32))} ~y~0 := #t~nondet3;havoc #t~nondet3; {481#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:03,259 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {457#true} {481#(= main_~x~0 (_ bv0 32))} #47#return; {481#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:03,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 11:22:03,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {457#true} assume !(0bv32 == ~cond); {457#true} is VALID [2018-11-23 11:22:03,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID [2018-11-23 11:22:03,260 INFO L256 TraceCheckUtils]: 7: Hoare triple {481#(= main_~x~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); {457#true} is VALID [2018-11-23 11:22:03,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#(= main_~x~0 main_~y~0)} assume !!~bvslt32(~i~0, ~n~0);~x~0 := ~bvsub32(~x~0, ~y~0); {481#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:22:03,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {503#(= main_~x~0 main_~y~0)} assume !!~bvsgt32(~n~0, 0bv32);~i~0 := 0bv32; {503#(= main_~x~0 main_~y~0)} is VALID [2018-11-23 11:22:03,281 INFO L273 TraceCheckUtils]: 4: Hoare triple {457#true} ~i~0 := 0bv32;~x~0 := 0bv32;~y~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {503#(= main_~x~0 main_~y~0)} is VALID [2018-11-23 11:22:03,282 INFO L256 TraceCheckUtils]: 3: Hoare triple {457#true} call #t~ret4 := main(); {457#true} is VALID [2018-11-23 11:22:03,282 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #43#return; {457#true} is VALID [2018-11-23 11:22:03,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 11:22:03,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2018-11-23 11:22:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:22:03,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:22:03,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 11:22:03,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 11:22:03,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:03,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:22:03,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:03,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:22:03,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:22:03,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:22:03,347 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2018-11-23 11:22:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:03,727 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 11:22:03,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:22:03,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 11:22:03,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:22:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-23 11:22:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:22:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-23 11:22:03,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2018-11-23 11:22:03,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:03,807 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:22:03,807 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:22:03,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:22:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:22:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 11:22:03,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:03,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 11:22:03,832 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:22:03,832 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:22:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:03,835 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 11:22:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 11:22:03,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:03,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:03,836 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:22:03,837 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:22:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:03,840 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 11:22:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 11:22:03,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:03,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:03,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:03,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:22:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 11:22:03,844 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 25 [2018-11-23 11:22:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:03,844 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 11:22:03,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:22:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 11:22:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:22:03,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:03,846 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:03,846 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:03,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:03,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1415691032, now seen corresponding path program 1 times [2018-11-23 11:22:03,847 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:03,847 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:03,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:22:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:22:03,947 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #43#return; [?] CALL call #t~ret4 := main(); [?] ~i~0 := 0bv32;~x~0 := 0bv32;~y~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~i~0=(_ bv0 32), main_~n~0=(_ bv1 32), main_~x~0=(_ bv0 32), main_~y~0=(_ bv0 32)] [?] assume !!~bvsgt32(~n~0, 0bv32);~i~0 := 0bv32; VAL [main_~i~0=(_ bv0 32), main_~n~0=(_ bv1 32), main_~x~0=(_ bv0 32), main_~y~0=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, ~n~0);~x~0 := ~bvsub32(~x~0, ~y~0); VAL [main_~i~0=(_ bv0 32), main_~n~0=(_ bv1 32), main_~x~0=(_ bv0 32), main_~y~0=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume !(0bv32 == ~cond); VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume true; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] RET #47#return; VAL [main_~i~0=(_ bv0 32), main_~n~0=(_ bv1 32), main_~x~0=(_ bv0 32), main_~y~0=(_ bv0 32)] [?] ~y~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~i~0=(_ bv0 32), main_~n~0=(_ bv1 32), main_~x~0=(_ bv0 32), main_~y~0=(_ bv1 32)] [?] assume !!(0bv32 != ~y~0);~x~0 := ~bvadd32(~x~0, ~y~0); VAL [main_~i~0=(_ bv0 32), main_~n~0=(_ bv1 32), main_~x~0=(_ bv1 32), main_~y~0=(_ bv1 32)] [?] CALL call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume !(0bv32 == ~cond); VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume true; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] RET #49#return; VAL [main_~i~0=(_ bv0 32), main_~n~0=(_ bv1 32), main_~x~0=(_ bv1 32), main_~y~0=(_ bv1 32)] [?] #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; VAL [main_~i~0=(_ bv1 32), main_~n~0=(_ bv1 32), main_~x~0=(_ bv1 32), main_~y~0=(_ bv1 32)] [?] assume !~bvslt32(~i~0, ~n~0); VAL [main_~i~0=(_ bv1 32), main_~n~0=(_ bv1 32), main_~x~0=(_ bv1 32), main_~y~0=(_ bv1 32)] [?] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0bv32; [L14] ~x~0 := 0bv32; [L14] ~y~0 := 0bv32; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L16] assume !!~bvsgt32(~n~0, 0bv32); [L17] ~i~0 := 0bv32; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L17-L25] assume !!~bvslt32(~i~0, ~n~0); [L19] ~x~0 := ~bvsub32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L20] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5-L7] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L4-L9] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L20] RET call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=1bv32] [L22] assume !!(0bv32 != ~y~0); [L23] ~x~0 := ~bvadd32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L24] CALL call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5-L7] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L4-L9] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L24] RET call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17] #t~post2 := ~i~0; [L17] ~i~0 := ~bvadd32(1bv32, #t~post2); [L17] havoc #t~post2; VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17-L25] assume !~bvslt32(~i~0, ~n~0); VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L26] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0bv32; [L14] ~x~0 := 0bv32; [L14] ~y~0 := 0bv32; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L16] assume !!~bvsgt32(~n~0, 0bv32); [L17] ~i~0 := 0bv32; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L17-L25] assume !!~bvslt32(~i~0, ~n~0); [L19] ~x~0 := ~bvsub32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L20] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5-L7] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L4-L9] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L20] RET call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=1bv32] [L22] assume !!(0bv32 != ~y~0); [L23] ~x~0 := ~bvadd32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L24] CALL call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5-L7] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L4-L9] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L24] RET call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17] #t~post2 := ~i~0; [L17] ~i~0 := ~bvadd32(1bv32, #t~post2); [L17] havoc #t~post2; VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17-L25] assume !~bvslt32(~i~0, ~n~0); VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L26] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0bv32; [L14] ~x~0 := 0bv32; [L14] ~y~0 := 0bv32; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L16] COND FALSE !(!~bvsgt32(~n~0, 0bv32)) [L17] ~i~0 := 0bv32; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L17-L25] COND FALSE !(!~bvslt32(~i~0, ~n~0)) [L19] ~x~0 := ~bvsub32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L20] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L20] RET call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=1bv32] [L22] COND FALSE !(!(0bv32 != ~y~0)) [L23] ~x~0 := ~bvadd32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L24] CALL call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L24] RET call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17] #t~post2 := ~i~0; [L17] ~i~0 := ~bvadd32(1bv32, #t~post2); [L17] havoc #t~post2; VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17-L25] COND TRUE !~bvslt32(~i~0, ~n~0) VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L26] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0bv32; [L14] ~x~0 := 0bv32; [L14] ~y~0 := 0bv32; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L16] COND FALSE !(!~bvsgt32(~n~0, 0bv32)) [L17] ~i~0 := 0bv32; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L17-L25] COND FALSE !(!~bvslt32(~i~0, ~n~0)) [L19] ~x~0 := ~bvsub32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L20] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L20] RET call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=1bv32] [L22] COND FALSE !(!(0bv32 != ~y~0)) [L23] ~x~0 := ~bvadd32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L24] CALL call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L24] RET call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17] #t~post2 := ~i~0; [L17] ~i~0 := ~bvadd32(1bv32, #t~post2); [L17] havoc #t~post2; VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17-L25] COND TRUE !~bvslt32(~i~0, ~n~0) VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L26] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0bv32; [L14] ~x~0 := 0bv32; [L14] ~y~0 := 0bv32; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L16] COND FALSE !(!~bvsgt32(~n~0, 0bv32)) [L17] ~i~0 := 0bv32; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L17-L25] COND FALSE !(!~bvslt32(~i~0, ~n~0)) [L19] ~x~0 := ~bvsub32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L20] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L20] RET call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=1bv32] [L22] COND FALSE !(!(0bv32 != ~y~0)) [L23] ~x~0 := ~bvadd32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L24] CALL call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L24] RET call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17] #t~post2 := ~i~0; [L17] ~i~0 := ~bvadd32(1bv32, #t~post2); [L17] havoc #t~post2; VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17-L25] COND TRUE !~bvslt32(~i~0, ~n~0) VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L26] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0bv32; [L14] ~x~0 := 0bv32; [L14] ~y~0 := 0bv32; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L16] COND FALSE !(!~bvsgt32(~n~0, 0bv32)) [L17] ~i~0 := 0bv32; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L17-L25] COND FALSE !(!~bvslt32(~i~0, ~n~0)) [L19] ~x~0 := ~bvsub32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L20] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L20] RET call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=0bv32] [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=0bv32, ~y~0=1bv32] [L22] COND FALSE !(!(0bv32 != ~y~0)) [L23] ~x~0 := ~bvadd32(~x~0, ~y~0); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L24] CALL call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L5] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L24] RET call __VERIFIER_assert((if 0bv32 != ~x~0 then 1bv32 else 0bv32)); VAL [~i~0=0bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17] #t~post2 := ~i~0; [L17] ~i~0 := ~bvadd32(1bv32, #t~post2); [L17] havoc #t~post2; VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L17-L25] COND TRUE !~bvslt32(~i~0, ~n~0) VAL [~i~0=1bv32, ~n~0=1bv32, ~x~0=1bv32, ~y~0=1bv32] [L26] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L14] int i=0, x=0, y=0; [L15] int n=__VERIFIER_nondet_int(); [L16] COND FALSE !(!(n>0)) [L17] i=0 VAL [i=0, n=1, x=0, y=0] [L17] COND TRUE i0)) [L17] i=0 VAL [i=0, n=1, x=0, y=0] [L17] COND TRUE i0)) [L17] i=0 VAL [i=0, n=1, x=0, y=0] [L17] COND TRUE i