./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/for_bounded_loop1_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/for_bounded_loop1_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ab550a6e9aa370752671d7ad69781384c889e75 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:34:06,787 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:34:06,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:34:06,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:34:06,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:34:06,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:34:06,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:34:06,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:34:06,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:34:06,799 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:34:06,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:34:06,800 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:34:06,801 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:34:06,802 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:34:06,802 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:34:06,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:34:06,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:34:06,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:34:06,806 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:34:06,807 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:34:06,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:34:06,809 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:34:06,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:34:06,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:34:06,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:34:06,812 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:34:06,813 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:34:06,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:34:06,814 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:34:06,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:34:06,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:34:06,815 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:34:06,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:34:06,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:34:06,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:34:06,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:34:06,817 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 23:34:06,827 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:34:06,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:34:06,828 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:34:06,828 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:34:06,828 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 23:34:06,829 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 23:34:06,829 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 23:34:06,829 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 23:34:06,829 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 23:34:06,829 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 23:34:06,829 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 23:34:06,829 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 23:34:06,829 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 23:34:06,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:34:06,830 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:34:06,830 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:34:06,830 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:34:06,830 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:34:06,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:34:06,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:34:06,831 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:34:06,831 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:34:06,831 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:34:06,831 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:34:06,831 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:34:06,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:34:06,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:34:06,832 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:34:06,832 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:34:06,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:34:06,832 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:34:06,832 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:34:06,833 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:34:06,833 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 23:34:06,833 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:34:06,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:34:06,833 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 23:34:06,833 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ab550a6e9aa370752671d7ad69781384c889e75 [2018-11-22 23:34:06,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:34:06,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:34:06,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:34:06,865 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:34:06,866 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:34:06,866 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/../../sv-benchmarks/c/loops/for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-22 23:34:06,903 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/data/eff7a4c93/c0f4e6f8f3da4a1692bbcf02c10321b6/FLAG9e68545f0 [2018-11-22 23:34:07,214 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:34:07,215 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/sv-benchmarks/c/loops/for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-22 23:34:07,218 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/data/eff7a4c93/c0f4e6f8f3da4a1692bbcf02c10321b6/FLAG9e68545f0 [2018-11-22 23:34:07,227 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/data/eff7a4c93/c0f4e6f8f3da4a1692bbcf02c10321b6 [2018-11-22 23:34:07,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:34:07,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:34:07,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:34:07,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:34:07,232 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:34:07,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108971e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07, skipping insertion in model container [2018-11-22 23:34:07,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:34:07,252 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:34:07,350 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:34:07,352 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:34:07,362 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:34:07,370 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:34:07,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07 WrapperNode [2018-11-22 23:34:07,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:34:07,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:34:07,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:34:07,371 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:34:07,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:34:07,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:34:07,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:34:07,384 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:34:07,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (1/1) ... [2018-11-22 23:34:07,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:34:07,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:34:07,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:34:07,398 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:34:07,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8653a82a-72bd-4ea9-9e28-31986c22d92d/bin-2019/utaipan/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-22 23:34:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:34:07,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:34:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:34:07,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:34:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:34:07,476 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:34:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-22 23:34:07,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-22 23:34:07,580 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:34:07,580 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 23:34:07,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:34:07 BoogieIcfgContainer [2018-11-22 23:34:07,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:34:07,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:34:07,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:34:07,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:34:07,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:34:07" (1/3) ... [2018-11-22 23:34:07,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fabf27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:34:07, skipping insertion in model container [2018-11-22 23:34:07,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:34:07" (2/3) ... [2018-11-22 23:34:07,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fabf27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:34:07, skipping insertion in model container [2018-11-22 23:34:07,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:34:07" (3/3) ... [2018-11-22 23:34:07,586 INFO L112 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-22 23:34:07,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:34:07,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:34:07,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:34:07,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:34:07,640 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:34:07,640 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:34:07,640 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:34:07,640 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:34:07,640 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:34:07,640 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:34:07,640 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:34:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-22 23:34:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-22 23:34:07,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:07,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:07,660 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:07,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash 429908039, now seen corresponding path program 1 times [2018-11-22 23:34:07,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:07,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:07,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:07,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:07,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:07,826 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-22 23:34:07,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:34:07,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 23:34:07,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:07,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:34:07,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:34:07,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:34:07,840 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 6 states. [2018-11-22 23:34:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:07,951 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2018-11-22 23:34:07,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 23:34:07,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-22 23:34:07,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:07,960 INFO L225 Difference]: With dead ends: 50 [2018-11-22 23:34:07,960 INFO L226 Difference]: Without dead ends: 26 [2018-11-22 23:34:07,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:34:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-22 23:34:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-22 23:34:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 23:34:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-22 23:34:07,995 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 11 [2018-11-22 23:34:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:07,995 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-22 23:34:07,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:34:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-22 23:34:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 23:34:07,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:07,996 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:34:07,996 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:07,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1060899037, now seen corresponding path program 1 times [2018-11-22 23:34:07,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:07,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:07,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:07,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:07,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:34:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:34:08,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:34:08,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:34:08,116 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-11-22 23:34:08,117 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [16], [18], [22], [31], [34], [36], [39], [41], [42], [43], [44], [46], [47], [48] [2018-11-22 23:34:08,138 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:34:08,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:34:08,228 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 23:34:08,228 INFO L272 AbstractInterpreter]: Visited 16 different actions 20 times. Never merged. Never widened. Performed 45 root evaluator evaluations with a maximum evaluation depth of 5. Performed 45 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 6 variables. [2018-11-22 23:34:08,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:08,233 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 23:34:08,268 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 69.44% of their original sizes. [2018-11-22 23:34:08,269 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 23:34:08,306 INFO L415 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-11-22 23:34:08,306 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 23:34:08,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:34:08,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2018-11-22 23:34:08,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:34:08,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 23:34:08,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 23:34:08,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:34:08,309 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-11-22 23:34:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:34:08,471 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-22 23:34:08,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 23:34:08,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-22 23:34:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:34:08,471 INFO L225 Difference]: With dead ends: 41 [2018-11-22 23:34:08,472 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 23:34:08,472 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-22 23:34:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 23:34:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-22 23:34:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 23:34:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-22 23:34:08,477 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 18 [2018-11-22 23:34:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:34:08,477 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-22 23:34:08,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 23:34:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-22 23:34:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 23:34:08,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:34:08,478 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-22 23:34:08,478 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:34:08,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:34:08,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1415691032, now seen corresponding path program 1 times [2018-11-22 23:34:08,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:34:08,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:08,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:34:08,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:34:08,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:34:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:34:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:34:08,507 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 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] assume !!(~n~0 > 0);~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #47#return; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~y~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=1] [?] assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #49#return; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] assume !(~i~0 < ~n~0); VAL [main_~i~0=1, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] assume !!(~n~0 > 0); [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] assume !!(~i~0 < ~n~0); [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] assume !!(0 != ~y~0); [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] assume !(~i~0 < ~n~0); VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- 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 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] assume !!(~n~0 > 0); [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] assume !!(~i~0 < ~n~0); [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] assume !!(0 != ~y~0); [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] assume !(~i~0 < ~n~0); VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- 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 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- 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 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [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 i 0);~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #47#return; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~y~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=1] [?] assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #49#return; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] assume !(~i~0 < ~n~0); VAL [main_~i~0=1, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] assume !!(~n~0 > 0); [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] assume !!(~i~0 < ~n~0); [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] assume !!(0 != ~y~0); [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] assume !(~i~0 < ~n~0); VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- 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 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] assume !!(~n~0 > 0); [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] assume !!(~i~0 < ~n~0); [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] assume !!(0 != ~y~0); [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] assume !(~i~0 < ~n~0); VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- 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 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- 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 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [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 i