./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c --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_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/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 7d05936c4bb1bb97a4b24ebc11d02c0e844c743b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-23 08:33:06,855 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:33:06,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:33:06,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:33:06,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:33:06,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:33:06,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:33:06,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:33:06,867 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:33:06,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:33:06,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:33:06,868 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:33:06,869 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:33:06,869 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:33:06,870 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:33:06,871 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:33:06,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:33:06,876 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:33:06,877 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:33:06,878 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:33:06,879 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:33:06,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:33:06,881 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:33:06,881 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:33:06,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:33:06,882 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:33:06,883 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:33:06,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:33:06,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:33:06,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:33:06,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:33:06,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:33:06,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:33:06,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:33:06,886 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:33:06,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:33:06,887 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 08:33:06,894 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:33:06,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:33:06,895 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:33:06,895 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:33:06,895 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 08:33:06,895 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 08:33:06,896 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 08:33:06,896 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 08:33:06,896 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 08:33:06,896 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 08:33:06,896 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 08:33:06,896 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 08:33:06,896 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 08:33:06,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:33:06,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:33:06,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:33:06,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:33:06,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:33:06,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:33:06,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:33:06,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:33:06,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:33:06,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:33:06,898 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:33:06,898 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:33:06,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:33:06,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:33:06,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:33:06,899 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:33:06,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:33:06,899 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:33:06,899 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:33:06,899 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:33:06,900 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 08:33:06,900 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:33:06,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:33:06,900 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 08:33:06,900 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_4a87d325-4b35-43ea-9207-d8213f9bcd0e/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 -> 7d05936c4bb1bb97a4b24ebc11d02c0e844c743b [2018-11-23 08:33:06,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:33:06,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:33:06,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:33:06,940 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:33:06,940 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:33:06,941 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c [2018-11-23 08:33:06,984 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/data/996e1fe07/67d33b12bd624333b3121b77f3d17289/FLAG74de998f4 [2018-11-23 08:33:07,385 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:33:07,385 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/sv-benchmarks/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c [2018-11-23 08:33:07,389 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/data/996e1fe07/67d33b12bd624333b3121b77f3d17289/FLAG74de998f4 [2018-11-23 08:33:07,399 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/data/996e1fe07/67d33b12bd624333b3121b77f3d17289 [2018-11-23 08:33:07,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:33:07,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:33:07,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:33:07,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:33:07,407 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:33:07,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c486bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07, skipping insertion in model container [2018-11-23 08:33:07,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:33:07,432 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:33:07,541 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:33:07,543 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:33:07,551 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:33:07,559 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:33:07,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07 WrapperNode [2018-11-23 08:33:07,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:33:07,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:33:07,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:33:07,560 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:33:07,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:33:07,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:33:07,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:33:07,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:33:07,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (1/1) ... [2018-11-23 08:33:07,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:33:07,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:33:07,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:33:07,582 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:33:07,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/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-23 08:33:07,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:33:07,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:33:07,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:33:07,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:33:07,651 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:33:07,651 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:33:07,651 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 08:33:07,651 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 08:33:07,734 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:33:07,734 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 08:33:07,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:33:07 BoogieIcfgContainer [2018-11-23 08:33:07,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:33:07,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:33:07,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:33:07,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:33:07,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:33:07" (1/3) ... [2018-11-23 08:33:07,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4cbf6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:33:07, skipping insertion in model container [2018-11-23 08:33:07,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:07" (2/3) ... [2018-11-23 08:33:07,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4cbf6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:33:07, skipping insertion in model container [2018-11-23 08:33:07,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:33:07" (3/3) ... [2018-11-23 08:33:07,739 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i20_o20_false-unreach-call_true-termination.c [2018-11-23 08:33:07,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:33:07,756 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:33:07,765 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:33:07,787 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:33:07,787 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:33:07,787 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:33:07,787 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:33:07,787 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:33:07,787 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:33:07,787 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:33:07,787 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:33:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 08:33:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 08:33:07,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:07,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:07,805 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:07,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-11-23 08:33:07,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:07,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:07,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:07,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:07,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:07,926 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 08:33:07,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:33:07,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:33:07,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:33:07,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:33:07,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:33:07,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:33:07,940 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 08:33:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:08,000 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 08:33:08,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:33:08,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 08:33:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:08,008 INFO L225 Difference]: With dead ends: 30 [2018-11-23 08:33:08,008 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 08:33:08,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:33:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 08:33:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 08:33:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 08:33:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 08:33:08,036 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 08:33:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:08,036 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 08:33:08,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:33:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 08:33:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 08:33:08,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:08,038 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:08,038 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:08,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:08,038 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-11-23 08:33:08,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:08,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:08,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:08,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 08:33:08,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:08,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:08,102 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-23 08:33:08,103 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2018-11-23 08:33:08,124 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 08:33:08,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 08:33:08,236 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 08:33:08,237 INFO L272 AbstractInterpreter]: Visited 16 different actions 49 times. Never merged. Widened at 1 different actions 2 times. Performed 105 root evaluator evaluations with a maximum evaluation depth of 3. Performed 105 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-23 08:33:08,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:08,244 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 08:33:08,286 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 58.33% of their original sizes. [2018-11-23 08:33:08,286 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 08:33:08,396 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-11-23 08:33:08,396 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 08:33:08,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:33:08,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-23 08:33:08,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:33:08,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 08:33:08,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 08:33:08,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 08:33:08,398 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2018-11-23 08:33:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:08,650 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 08:33:08,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:33:08,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-23 08:33:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:08,651 INFO L225 Difference]: With dead ends: 39 [2018-11-23 08:33:08,651 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 08:33:08,652 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-23 08:33:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 08:33:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 08:33:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 08:33:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 08:33:08,657 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 19 [2018-11-23 08:33:08,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:08,657 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 08:33:08,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 08:33:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 08:33:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 08:33:08,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:08,658 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:08,658 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:08,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:08,658 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-11-23 08:33:08,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:08,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:08,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 08:33:08,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:08,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:08,698 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:08,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:08,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:08,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:08,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:33:08,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 08:33:08,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 08:33:08,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:33:08,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 08:33:08,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 08:33:09,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:09,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2018-11-23 08:33:09,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:09,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:33:09,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:33:09,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:33:09,028 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-11-23 08:33:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:09,083 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 08:33:09,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:33:09,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 08:33:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:09,084 INFO L225 Difference]: With dead ends: 49 [2018-11-23 08:33:09,084 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 08:33:09,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-23 08:33:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 08:33:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-11-23 08:33:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 08:33:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 08:33:09,089 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2018-11-23 08:33:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:09,090 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 08:33:09,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:33:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 08:33:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 08:33:09,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:09,090 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:09,091 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:09,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-11-23 08:33:09,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:09,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:09,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:33:09,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:09,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 08:33:09,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:09,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:09,150 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:09,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:09,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:09,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:09,156 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:33:09,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 08:33:09,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:33:09,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:33:09,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 08:33:09,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 08:33:09,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:09,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 11] total 22 [2018-11-23 08:33:09,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:09,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 08:33:09,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 08:33:09,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-11-23 08:33:09,537 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 17 states. [2018-11-23 08:33:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:09,631 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 08:33:09,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 08:33:09,631 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-11-23 08:33:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:09,632 INFO L225 Difference]: With dead ends: 52 [2018-11-23 08:33:09,632 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 08:33:09,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-11-23 08:33:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 08:33:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-11-23 08:33:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 08:33:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 08:33:09,637 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-11-23 08:33:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:09,637 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 08:33:09,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 08:33:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 08:33:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 08:33:09,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:09,638 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:09,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:09,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:09,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-11-23 08:33:09,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:09,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:33:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:09,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 08:33:09,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:09,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:09,690 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:09,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:09,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:09,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:09,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:09,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:33:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:09,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 08:33:09,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 08:33:10,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:10,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2018-11-23 08:33:10,176 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:10,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:33:10,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:33:10,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-23 08:33:10,177 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 9 states. [2018-11-23 08:33:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:10,229 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-23 08:33:10,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:33:10,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 08:33:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:10,230 INFO L225 Difference]: With dead ends: 55 [2018-11-23 08:33:10,230 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 08:33:10,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2018-11-23 08:33:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 08:33:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-11-23 08:33:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 08:33:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 08:33:10,236 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 37 [2018-11-23 08:33:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:10,236 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 08:33:10,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:33:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 08:33:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 08:33:10,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:10,237 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:10,237 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:10,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-11-23 08:33:10,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:10,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:10,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:10,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:10,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 08:33:10,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:10,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:10,328 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:10,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:10,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:10,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:10,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:33:10,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 08:33:10,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 08:33:10,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:33:10,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 08:33:10,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 08:33:11,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:11,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 15] total 30 [2018-11-23 08:33:11,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:11,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 08:33:11,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 08:33:11,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-11-23 08:33:11,193 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 23 states. [2018-11-23 08:33:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:11,361 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 08:33:11,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 08:33:11,361 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-11-23 08:33:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:11,362 INFO L225 Difference]: With dead ends: 58 [2018-11-23 08:33:11,362 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 08:33:11,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 08:33:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 08:33:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2018-11-23 08:33:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 08:33:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 08:33:11,368 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 43 [2018-11-23 08:33:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:11,369 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 08:33:11,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 08:33:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 08:33:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 08:33:11,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:11,370 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:11,370 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:11,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-11-23 08:33:11,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:11,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:33:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:11,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 08:33:11,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:11,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:11,460 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:11,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:11,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:11,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:11,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:33:11,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 08:33:11,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:33:11,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:33:11,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 08:33:11,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 08:33:12,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:12,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 17] total 34 [2018-11-23 08:33:12,411 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:12,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 08:33:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 08:33:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 08:33:12,412 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 26 states. [2018-11-23 08:33:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:12,570 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 08:33:12,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 08:33:12,571 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-11-23 08:33:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:12,571 INFO L225 Difference]: With dead ends: 61 [2018-11-23 08:33:12,571 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 08:33:12,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 68 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=422, Invalid=1740, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 08:33:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 08:33:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2018-11-23 08:33:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 08:33:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 08:33:12,576 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 49 [2018-11-23 08:33:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:12,577 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 08:33:12,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 08:33:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 08:33:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 08:33:12,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:12,578 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:12,578 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:12,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:12,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-11-23 08:33:12,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:12,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:12,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:33:12,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:12,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 08:33:12,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:12,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:12,683 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:12,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:12,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:12,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:12,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:12,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:33:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:12,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 08:33:12,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 08:33:13,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:13,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 19] total 38 [2018-11-23 08:33:13,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:13,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 08:33:13,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 08:33:13,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 08:33:13,981 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 29 states. [2018-11-23 08:33:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:14,187 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 08:33:14,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 08:33:14,188 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-11-23 08:33:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:14,189 INFO L225 Difference]: With dead ends: 64 [2018-11-23 08:33:14,189 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 08:33:14,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 76 SyntacticMatches, 16 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 08:33:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 08:33:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-23 08:33:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 08:33:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 08:33:14,195 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 55 [2018-11-23 08:33:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:14,195 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 08:33:14,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 08:33:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 08:33:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 08:33:14,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:14,196 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:14,196 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:14,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:14,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-11-23 08:33:14,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:14,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:14,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:14,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:14,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 08:33:14,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:14,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:14,275 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:14,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:14,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:14,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:14,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:33:14,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 08:33:14,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 08:33:14,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:33:14,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 08:33:14,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 08:33:15,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:15,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 51 [2018-11-23 08:33:15,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:15,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 08:33:15,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 08:33:15,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 08:33:15,856 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 32 states. [2018-11-23 08:33:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:16,079 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 08:33:16,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 08:33:16,080 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2018-11-23 08:33:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:16,083 INFO L225 Difference]: With dead ends: 67 [2018-11-23 08:33:16,083 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 08:33:16,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=832, Invalid=3724, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 08:33:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 08:33:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2018-11-23 08:33:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 08:33:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 08:33:16,088 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 61 [2018-11-23 08:33:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:16,088 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 08:33:16,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 08:33:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 08:33:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 08:33:16,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:16,089 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:16,089 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:16,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-11-23 08:33:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:16,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:33:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:16,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 08:33:16,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:16,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:16,194 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:16,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:16,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:16,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:16,200 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:33:16,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 08:33:16,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:33:16,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:33:16,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 08:33:16,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 08:33:18,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:18,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2018-11-23 08:33:18,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:18,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 08:33:18,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 08:33:18,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-11-23 08:33:18,204 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 14 states. [2018-11-23 08:33:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:18,291 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-23 08:33:18,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 08:33:18,291 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 08:33:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:18,292 INFO L225 Difference]: With dead ends: 70 [2018-11-23 08:33:18,292 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 08:33:18,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 08:33:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 08:33:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-11-23 08:33:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 08:33:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 08:33:18,298 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 67 [2018-11-23 08:33:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:18,298 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 08:33:18,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 08:33:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 08:33:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 08:33:18,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:18,299 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:18,299 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:18,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-11-23 08:33:18,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:18,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:18,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:33:18,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:18,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 08:33:18,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:18,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:18,386 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:18,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:18,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:18,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:18,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:18,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:33:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:18,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 08:33:18,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 08:33:20,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:20,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2018-11-23 08:33:20,888 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:20,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 08:33:20,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 08:33:20,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2018-11-23 08:33:20,889 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 15 states. [2018-11-23 08:33:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:21,041 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-23 08:33:21,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 08:33:21,042 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-11-23 08:33:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:21,043 INFO L225 Difference]: With dead ends: 73 [2018-11-23 08:33:21,043 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 08:33:21,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 123 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 08:33:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 08:33:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-11-23 08:33:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 08:33:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 08:33:21,049 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 73 [2018-11-23 08:33:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:21,050 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 08:33:21,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 08:33:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 08:33:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 08:33:21,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:21,051 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:21,051 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:21,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2018-11-23 08:33:21,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:21,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:21,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:21,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:21,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 08:33:21,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:21,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:21,155 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:21,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:21,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:21,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:21,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:33:21,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 08:33:21,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 08:33:21,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:33:21,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 08:33:21,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 08:33:24,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:24,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2018-11-23 08:33:24,382 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:24,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 08:33:24,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 08:33:24,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-11-23 08:33:24,383 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 16 states. [2018-11-23 08:33:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:24,516 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-23 08:33:24,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 08:33:24,517 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-11-23 08:33:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:24,518 INFO L225 Difference]: With dead ends: 76 [2018-11-23 08:33:24,518 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 08:33:24,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 133 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 08:33:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 08:33:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2018-11-23 08:33:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 08:33:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 08:33:24,524 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 79 [2018-11-23 08:33:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:24,527 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 08:33:24,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 08:33:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 08:33:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 08:33:24,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:24,528 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:24,528 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:24,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2018-11-23 08:33:24,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:24,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:24,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:33:24,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:24,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 08:33:24,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:24,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:24,771 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:24,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:24,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:24,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:24,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:33:24,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 08:33:24,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:33:24,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:33:24,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 08:33:25,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:29,253 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 08:33:29,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:29,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17, 29] total 58 [2018-11-23 08:33:29,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:29,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 08:33:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 08:33:29,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=2866, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 08:33:29,269 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 44 states. [2018-11-23 08:33:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:29,634 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 08:33:29,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 08:33:29,634 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2018-11-23 08:33:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:29,635 INFO L225 Difference]: With dead ends: 79 [2018-11-23 08:33:29,635 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 08:33:29,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 116 SyntacticMatches, 26 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1322, Invalid=5484, Unknown=0, NotChecked=0, Total=6806 [2018-11-23 08:33:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 08:33:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-11-23 08:33:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 08:33:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 08:33:29,640 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 85 [2018-11-23 08:33:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:29,640 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 08:33:29,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 08:33:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 08:33:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 08:33:29,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:29,641 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:29,641 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:29,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:29,641 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2018-11-23 08:33:29,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:29,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:33:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:29,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 08:33:29,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:29,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:29,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:29,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:29,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:29,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:29,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:29,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:33:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:29,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 08:33:30,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 08:33:35,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:35,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 18, 31] total 62 [2018-11-23 08:33:35,384 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:35,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 08:33:35,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 08:33:35,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=3281, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 08:33:35,385 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 47 states. [2018-11-23 08:33:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:35,850 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-11-23 08:33:35,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 08:33:35,850 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2018-11-23 08:33:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:35,851 INFO L225 Difference]: With dead ends: 82 [2018-11-23 08:33:35,851 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 08:33:35,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 124 SyntacticMatches, 28 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1521, Invalid=6311, Unknown=0, NotChecked=0, Total=7832 [2018-11-23 08:33:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 08:33:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-11-23 08:33:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 08:33:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-11-23 08:33:35,857 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 91 [2018-11-23 08:33:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:35,857 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-11-23 08:33:35,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 08:33:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 08:33:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 08:33:35,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:35,858 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:35,858 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:35,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2018-11-23 08:33:35,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:35,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:35,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:35,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:35,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 08:33:36,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:36,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:36,069 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:36,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:36,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:36,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:36,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:33:36,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 08:33:36,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 08:33:36,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:33:36,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 08:33:36,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 08:33:42,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:42,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19, 33] total 66 [2018-11-23 08:33:42,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:42,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 08:33:42,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 08:33:42,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=3724, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 08:33:42,662 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 50 states. [2018-11-23 08:33:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:43,121 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-23 08:33:43,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 08:33:43,121 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2018-11-23 08:33:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:43,122 INFO L225 Difference]: With dead ends: 85 [2018-11-23 08:33:43,122 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 08:33:43,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 132 SyntacticMatches, 30 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2493 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1734, Invalid=7196, Unknown=0, NotChecked=0, Total=8930 [2018-11-23 08:33:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 08:33:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-11-23 08:33:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 08:33:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-23 08:33:43,127 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 97 [2018-11-23 08:33:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:43,127 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-23 08:33:43,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 08:33:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-23 08:33:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 08:33:43,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:43,128 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:43,128 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:43,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:43,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2018-11-23 08:33:43,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:43,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:33:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:43,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-23 08:33:43,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:43,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:43,378 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:43,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:43,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:43,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:43,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:33:43,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 08:33:43,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:33:43,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:33:43,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-23 08:33:43,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:33:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 08:33:51,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:33:51,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 20, 35] total 70 [2018-11-23 08:33:51,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:33:51,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 08:33:51,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 08:33:51,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=4195, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 08:33:51,267 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 53 states. [2018-11-23 08:33:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:33:51,826 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-23 08:33:51,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 08:33:51,826 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2018-11-23 08:33:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:33:51,827 INFO L225 Difference]: With dead ends: 88 [2018-11-23 08:33:51,827 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 08:33:51,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2844 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1961, Invalid=8139, Unknown=0, NotChecked=0, Total=10100 [2018-11-23 08:33:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 08:33:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2018-11-23 08:33:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 08:33:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-23 08:33:51,832 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 103 [2018-11-23 08:33:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:33:51,833 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-23 08:33:51,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-23 08:33:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 08:33:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 08:33:51,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:33:51,833 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:33:51,834 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:33:51,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2018-11-23 08:33:51,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:33:51,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:51,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:33:51,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:33:51,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:33:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 08:33:52,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:52,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:33:52,131 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:33:52,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:33:52,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:33:52,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:33:52,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:33:52,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:33:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:52,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 08:33:52,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:34:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 08:34:01,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:34:01,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 21, 37] total 74 [2018-11-23 08:34:01,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:34:01,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 08:34:01,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 08:34:01,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=4694, Unknown=0, NotChecked=0, Total=5402 [2018-11-23 08:34:01,628 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 56 states. [2018-11-23 08:34:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:34:02,225 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-11-23 08:34:02,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 08:34:02,225 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2018-11-23 08:34:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:34:02,226 INFO L225 Difference]: With dead ends: 91 [2018-11-23 08:34:02,226 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 08:34:02,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 148 SyntacticMatches, 34 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3218 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2202, Invalid=9140, Unknown=0, NotChecked=0, Total=11342 [2018-11-23 08:34:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 08:34:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-11-23 08:34:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 08:34:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-23 08:34:02,231 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 109 [2018-11-23 08:34:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:34:02,231 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-23 08:34:02,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 08:34:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-23 08:34:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 08:34:02,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:34:02,232 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:34:02,233 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:34:02,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:34:02,233 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2018-11-23 08:34:02,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:34:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:34:02,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:34:02,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:34:02,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:34:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:34:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-23 08:34:02,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:34:02,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:34:02,390 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:34:02,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:34:02,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:34:02,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:34:02,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:34:02,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 08:34:02,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 08:34:02,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:34:02,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:34:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-23 08:34:02,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:34:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 08:34:13,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:34:13,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 41 [2018-11-23 08:34:13,083 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:34:13,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 08:34:13,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 08:34:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 08:34:13,084 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 22 states. [2018-11-23 08:34:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:34:13,247 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-11-23 08:34:13,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 08:34:13,247 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2018-11-23 08:34:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:34:13,248 INFO L225 Difference]: With dead ends: 94 [2018-11-23 08:34:13,248 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 08:34:13,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 193 SyntacticMatches, 36 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1124, Invalid=2298, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 08:34:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 08:34:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-11-23 08:34:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 08:34:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-11-23 08:34:13,251 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 115 [2018-11-23 08:34:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:34:13,252 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-11-23 08:34:13,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 08:34:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-23 08:34:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 08:34:13,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:34:13,253 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:34:13,253 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:34:13,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:34:13,253 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2018-11-23 08:34:13,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:34:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:34:13,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:34:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:34:13,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:34:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:34:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 08:34:13,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:34:13,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:34:13,414 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:34:13,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:34:13,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:34:13,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:34:13,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:34:13,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 08:34:13,449 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:34:13,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:34:13,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:34:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 08:34:13,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:34:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-23 08:34:26,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:34:26,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 43 [2018-11-23 08:34:26,035 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:34:26,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 08:34:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 08:34:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 08:34:26,035 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 23 states. [2018-11-23 08:34:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:34:26,210 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-11-23 08:34:26,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 08:34:26,210 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2018-11-23 08:34:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:34:26,211 INFO L225 Difference]: With dead ends: 97 [2018-11-23 08:34:26,211 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 08:34:26,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 203 SyntacticMatches, 38 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1243, Invalid=2539, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 08:34:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 08:34:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-11-23 08:34:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 08:34:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-11-23 08:34:26,214 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 121 [2018-11-23 08:34:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:34:26,215 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-23 08:34:26,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 08:34:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-23 08:34:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 08:34:26,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:34:26,215 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:34:26,216 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:34:26,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:34:26,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2018-11-23 08:34:26,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:34:26,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:34:26,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:34:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:34:26,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:34:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:34:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-23 08:34:26,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:34:26,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:34:26,438 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:34:26,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:34:26,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:34:26,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:34:26,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:34:26,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:34:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:34:26,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:34:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-23 08:34:26,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:34:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-23 08:34:41,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:34:41,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 43] total 44 [2018-11-23 08:34:41,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:34:41,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 08:34:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 08:34:41,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 08:34:41,295 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 24 states. [2018-11-23 08:34:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:34:41,486 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-11-23 08:34:41,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 08:34:41,487 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2018-11-23 08:34:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:34:41,487 INFO L225 Difference]: With dead ends: 100 [2018-11-23 08:34:41,487 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 08:34:41,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 213 SyntacticMatches, 41 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1365, Invalid=2667, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 08:34:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 08:34:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2018-11-23 08:34:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 08:34:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-11-23 08:34:41,491 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 127 [2018-11-23 08:34:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:34:41,491 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-11-23 08:34:41,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 08:34:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-23 08:34:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 08:34:41,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:34:41,492 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:34:41,492 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:34:41,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:34:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2018-11-23 08:34:41,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:34:41,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:34:41,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:34:41,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:34:41,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:34:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:34:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:34:41,532 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret2 := main(); [?] ~input~0 := 20; VAL [main_~input~0=20] [?] CALL call #t~ret1 := id(~input~0); VAL [|id_#in~x|=20] [?] ~x := #in~x; VAL [id_~x=20, |id_#in~x|=20] [?] assume !(0 == ~x); VAL [id_~x=20, |id_#in~x|=20] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=19] [?] ~x := #in~x; VAL [id_~x=19, |id_#in~x|=19] [?] assume !(0 == ~x); VAL [id_~x=19, |id_#in~x|=19] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=18] [?] ~x := #in~x; VAL [id_~x=18, |id_#in~x|=18] [?] assume !(0 == ~x); VAL [id_~x=18, |id_#in~x|=18] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=17] [?] ~x := #in~x; VAL [id_~x=17, |id_#in~x|=17] [?] assume !(0 == ~x); VAL [id_~x=17, |id_#in~x|=17] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=16] [?] ~x := #in~x; VAL [id_~x=16, |id_#in~x|=16] [?] assume !(0 == ~x); VAL [id_~x=16, |id_#in~x|=16] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=15] [?] ~x := #in~x; VAL [id_~x=15, |id_#in~x|=15] [?] assume !(0 == ~x); VAL [id_~x=15, |id_#in~x|=15] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=14] [?] ~x := #in~x; VAL [id_~x=14, |id_#in~x|=14] [?] assume !(0 == ~x); VAL [id_~x=14, |id_#in~x|=14] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=13] [?] ~x := #in~x; VAL [id_~x=13, |id_#in~x|=13] [?] assume !(0 == ~x); VAL [id_~x=13, |id_#in~x|=13] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=12] [?] ~x := #in~x; VAL [id_~x=12, |id_#in~x|=12] [?] assume !(0 == ~x); VAL [id_~x=12, |id_#in~x|=12] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=11] [?] ~x := #in~x; VAL [id_~x=11, |id_#in~x|=11] [?] assume !(0 == ~x); VAL [id_~x=11, |id_#in~x|=11] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=10] [?] ~x := #in~x; VAL [id_~x=10, |id_#in~x|=10] [?] assume !(0 == ~x); VAL [id_~x=10, |id_#in~x|=10] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=9] [?] ~x := #in~x; VAL [id_~x=9, |id_#in~x|=9] [?] assume !(0 == ~x); VAL [id_~x=9, |id_#in~x|=9] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=8] [?] ~x := #in~x; VAL [id_~x=8, |id_#in~x|=8] [?] assume !(0 == ~x); VAL [id_~x=8, |id_#in~x|=8] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=7] [?] ~x := #in~x; VAL [id_~x=7, |id_#in~x|=7] [?] assume !(0 == ~x); VAL [id_~x=7, |id_#in~x|=7] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=6] [?] ~x := #in~x; VAL [id_~x=6, |id_#in~x|=6] [?] assume !(0 == ~x); VAL [id_~x=6, |id_#in~x|=6] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=5] [?] ~x := #in~x; VAL [id_~x=5, |id_#in~x|=5] [?] assume !(0 == ~x); VAL [id_~x=5, |id_#in~x|=5] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4] [?] ~x := #in~x; VAL [id_~x=4, |id_#in~x|=4] [?] assume !(0 == ~x); VAL [id_~x=4, |id_#in~x|=4] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=3] [?] ~x := #in~x; VAL [id_~x=3, |id_#in~x|=3] [?] assume !(0 == ~x); VAL [id_~x=3, |id_#in~x|=3] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=2] [?] ~x := #in~x; VAL [id_~x=2, |id_#in~x|=2] [?] assume !(0 == ~x); VAL [id_~x=2, |id_#in~x|=2] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=1] [?] ~x := #in~x; VAL [id_~x=1, |id_#in~x|=1] [?] assume !(0 == ~x); VAL [id_~x=1, |id_#in~x|=1] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=0] [?] ~x := #in~x; VAL [id_~x=0, |id_#in~x|=0] [?] assume 0 == ~x;#res := 0; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] assume true; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] RET #32#return; VAL [id_~x=1, |id_#in~x|=1, |id_#t~ret0|=0] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] assume true; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] RET #32#return; VAL [id_~x=2, |id_#in~x|=2, |id_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] assume true; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] RET #32#return; VAL [id_~x=3, |id_#in~x|=3, |id_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] assume true; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] RET #32#return; VAL [id_~x=4, |id_#in~x|=4, |id_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] assume true; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] RET #32#return; VAL [id_~x=5, |id_#in~x|=5, |id_#t~ret0|=4] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] assume true; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] RET #32#return; VAL [id_~x=6, |id_#in~x|=6, |id_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] assume true; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] RET #32#return; VAL [id_~x=7, |id_#in~x|=7, |id_#t~ret0|=6] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] assume true; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] RET #32#return; VAL [id_~x=8, |id_#in~x|=8, |id_#t~ret0|=7] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] assume true; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] RET #32#return; VAL [id_~x=9, |id_#in~x|=9, |id_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] assume true; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] RET #32#return; VAL [id_~x=10, |id_#in~x|=10, |id_#t~ret0|=9] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] assume true; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] RET #32#return; VAL [id_~x=11, |id_#in~x|=11, |id_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=11, |id_#in~x|=11, |id_#res|=11] [?] assume true; VAL [id_~x=11, |id_#in~x|=11, |id_#res|=11] [?] RET #32#return; VAL [id_~x=12, |id_#in~x|=12, |id_#t~ret0|=11] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=12, |id_#in~x|=12, |id_#res|=12] [?] assume true; VAL [id_~x=12, |id_#in~x|=12, |id_#res|=12] [?] RET #32#return; VAL [id_~x=13, |id_#in~x|=13, |id_#t~ret0|=12] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=13, |id_#in~x|=13, |id_#res|=13] [?] assume true; VAL [id_~x=13, |id_#in~x|=13, |id_#res|=13] [?] RET #32#return; VAL [id_~x=14, |id_#in~x|=14, |id_#t~ret0|=13] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=14, |id_#in~x|=14, |id_#res|=14] [?] assume true; VAL [id_~x=14, |id_#in~x|=14, |id_#res|=14] [?] RET #32#return; VAL [id_~x=15, |id_#in~x|=15, |id_#t~ret0|=14] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=15, |id_#in~x|=15, |id_#res|=15] [?] assume true; VAL [id_~x=15, |id_#in~x|=15, |id_#res|=15] [?] RET #32#return; VAL [id_~x=16, |id_#in~x|=16, |id_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=16, |id_#in~x|=16, |id_#res|=16] [?] assume true; VAL [id_~x=16, |id_#in~x|=16, |id_#res|=16] [?] RET #32#return; VAL [id_~x=17, |id_#in~x|=17, |id_#t~ret0|=16] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=17, |id_#in~x|=17, |id_#res|=17] [?] assume true; VAL [id_~x=17, |id_#in~x|=17, |id_#res|=17] [?] RET #32#return; VAL [id_~x=18, |id_#in~x|=18, |id_#t~ret0|=17] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=18, |id_#in~x|=18, |id_#res|=18] [?] assume true; VAL [id_~x=18, |id_#in~x|=18, |id_#res|=18] [?] RET #32#return; VAL [id_~x=19, |id_#in~x|=19, |id_#t~ret0|=18] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=19, |id_#in~x|=19, |id_#res|=19] [?] assume true; VAL [id_~x=19, |id_#in~x|=19, |id_#res|=19] [?] RET #32#return; VAL [id_~x=20, |id_#in~x|=20, |id_#t~ret0|=19] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=20, |id_#in~x|=20, |id_#res|=20] [?] assume true; VAL [id_~x=20, |id_#in~x|=20, |id_#res|=20] [?] RET #30#return; VAL [main_~input~0=20, |main_#t~ret1|=20] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~input~0=20, main_~result~0=20] [?] assume 20 == ~result~0; VAL [main_~input~0=20, main_~result~0=20] [?] assume !false; VAL [main_~input~0=20, main_~result~0=20] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] assume !(0 == ~x); VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] assume !(0 == ~x); VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] assume !(0 == ~x); VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] assume !(0 == ~x); VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] assume !(0 == ~x); VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] assume !(0 == ~x); VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] assume !(0 == ~x); VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] assume !(0 == ~x); VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] assume !(0 == ~x); VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] assume !(0 == ~x); VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L4-L7] ensures true; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L4-L7] ensures true; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L4-L7] ensures true; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L4-L7] ensures true; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L4-L7] ensures true; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L4-L7] ensures true; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L4-L7] ensures true; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L4-L7] ensures true; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L4-L7] ensures true; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L4-L7] ensures true; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12-L14] assume 20 == ~result~0; VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] assume !(0 == ~x); VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] assume !(0 == ~x); VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] assume !(0 == ~x); VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] assume !(0 == ~x); VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] assume !(0 == ~x); VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] assume !(0 == ~x); VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] assume !(0 == ~x); VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] assume !(0 == ~x); VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] assume !(0 == ~x); VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] assume !(0 == ~x); VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L4-L7] ensures true; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L4-L7] ensures true; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L4-L7] ensures true; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L4-L7] ensures true; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L4-L7] ensures true; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L4-L7] ensures true; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L4-L7] ensures true; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L4-L7] ensures true; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L4-L7] ensures true; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L4-L7] ensures true; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12-L14] assume 20 == ~result~0; VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [L10] int input = 20; VAL [input=20] [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] ----- [2018-11-23 08:34:41,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:34:41 BoogieIcfgContainer [2018-11-23 08:34:41,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:34:41,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:34:41,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:34:41,691 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:34:41,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:33:07" (3/4) ... [2018-11-23 08:34:41,694 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret2 := main(); [?] ~input~0 := 20; VAL [main_~input~0=20] [?] CALL call #t~ret1 := id(~input~0); VAL [|id_#in~x|=20] [?] ~x := #in~x; VAL [id_~x=20, |id_#in~x|=20] [?] assume !(0 == ~x); VAL [id_~x=20, |id_#in~x|=20] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=19] [?] ~x := #in~x; VAL [id_~x=19, |id_#in~x|=19] [?] assume !(0 == ~x); VAL [id_~x=19, |id_#in~x|=19] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=18] [?] ~x := #in~x; VAL [id_~x=18, |id_#in~x|=18] [?] assume !(0 == ~x); VAL [id_~x=18, |id_#in~x|=18] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=17] [?] ~x := #in~x; VAL [id_~x=17, |id_#in~x|=17] [?] assume !(0 == ~x); VAL [id_~x=17, |id_#in~x|=17] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=16] [?] ~x := #in~x; VAL [id_~x=16, |id_#in~x|=16] [?] assume !(0 == ~x); VAL [id_~x=16, |id_#in~x|=16] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=15] [?] ~x := #in~x; VAL [id_~x=15, |id_#in~x|=15] [?] assume !(0 == ~x); VAL [id_~x=15, |id_#in~x|=15] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=14] [?] ~x := #in~x; VAL [id_~x=14, |id_#in~x|=14] [?] assume !(0 == ~x); VAL [id_~x=14, |id_#in~x|=14] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=13] [?] ~x := #in~x; VAL [id_~x=13, |id_#in~x|=13] [?] assume !(0 == ~x); VAL [id_~x=13, |id_#in~x|=13] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=12] [?] ~x := #in~x; VAL [id_~x=12, |id_#in~x|=12] [?] assume !(0 == ~x); VAL [id_~x=12, |id_#in~x|=12] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=11] [?] ~x := #in~x; VAL [id_~x=11, |id_#in~x|=11] [?] assume !(0 == ~x); VAL [id_~x=11, |id_#in~x|=11] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=10] [?] ~x := #in~x; VAL [id_~x=10, |id_#in~x|=10] [?] assume !(0 == ~x); VAL [id_~x=10, |id_#in~x|=10] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=9] [?] ~x := #in~x; VAL [id_~x=9, |id_#in~x|=9] [?] assume !(0 == ~x); VAL [id_~x=9, |id_#in~x|=9] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=8] [?] ~x := #in~x; VAL [id_~x=8, |id_#in~x|=8] [?] assume !(0 == ~x); VAL [id_~x=8, |id_#in~x|=8] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=7] [?] ~x := #in~x; VAL [id_~x=7, |id_#in~x|=7] [?] assume !(0 == ~x); VAL [id_~x=7, |id_#in~x|=7] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=6] [?] ~x := #in~x; VAL [id_~x=6, |id_#in~x|=6] [?] assume !(0 == ~x); VAL [id_~x=6, |id_#in~x|=6] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=5] [?] ~x := #in~x; VAL [id_~x=5, |id_#in~x|=5] [?] assume !(0 == ~x); VAL [id_~x=5, |id_#in~x|=5] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4] [?] ~x := #in~x; VAL [id_~x=4, |id_#in~x|=4] [?] assume !(0 == ~x); VAL [id_~x=4, |id_#in~x|=4] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=3] [?] ~x := #in~x; VAL [id_~x=3, |id_#in~x|=3] [?] assume !(0 == ~x); VAL [id_~x=3, |id_#in~x|=3] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=2] [?] ~x := #in~x; VAL [id_~x=2, |id_#in~x|=2] [?] assume !(0 == ~x); VAL [id_~x=2, |id_#in~x|=2] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=1] [?] ~x := #in~x; VAL [id_~x=1, |id_#in~x|=1] [?] assume !(0 == ~x); VAL [id_~x=1, |id_#in~x|=1] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=0] [?] ~x := #in~x; VAL [id_~x=0, |id_#in~x|=0] [?] assume 0 == ~x;#res := 0; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] assume true; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] RET #32#return; VAL [id_~x=1, |id_#in~x|=1, |id_#t~ret0|=0] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] assume true; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] RET #32#return; VAL [id_~x=2, |id_#in~x|=2, |id_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] assume true; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] RET #32#return; VAL [id_~x=3, |id_#in~x|=3, |id_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] assume true; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] RET #32#return; VAL [id_~x=4, |id_#in~x|=4, |id_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] assume true; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] RET #32#return; VAL [id_~x=5, |id_#in~x|=5, |id_#t~ret0|=4] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] assume true; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] RET #32#return; VAL [id_~x=6, |id_#in~x|=6, |id_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] assume true; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] RET #32#return; VAL [id_~x=7, |id_#in~x|=7, |id_#t~ret0|=6] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] assume true; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] RET #32#return; VAL [id_~x=8, |id_#in~x|=8, |id_#t~ret0|=7] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] assume true; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] RET #32#return; VAL [id_~x=9, |id_#in~x|=9, |id_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] assume true; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] RET #32#return; VAL [id_~x=10, |id_#in~x|=10, |id_#t~ret0|=9] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] assume true; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] RET #32#return; VAL [id_~x=11, |id_#in~x|=11, |id_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=11, |id_#in~x|=11, |id_#res|=11] [?] assume true; VAL [id_~x=11, |id_#in~x|=11, |id_#res|=11] [?] RET #32#return; VAL [id_~x=12, |id_#in~x|=12, |id_#t~ret0|=11] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=12, |id_#in~x|=12, |id_#res|=12] [?] assume true; VAL [id_~x=12, |id_#in~x|=12, |id_#res|=12] [?] RET #32#return; VAL [id_~x=13, |id_#in~x|=13, |id_#t~ret0|=12] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=13, |id_#in~x|=13, |id_#res|=13] [?] assume true; VAL [id_~x=13, |id_#in~x|=13, |id_#res|=13] [?] RET #32#return; VAL [id_~x=14, |id_#in~x|=14, |id_#t~ret0|=13] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=14, |id_#in~x|=14, |id_#res|=14] [?] assume true; VAL [id_~x=14, |id_#in~x|=14, |id_#res|=14] [?] RET #32#return; VAL [id_~x=15, |id_#in~x|=15, |id_#t~ret0|=14] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=15, |id_#in~x|=15, |id_#res|=15] [?] assume true; VAL [id_~x=15, |id_#in~x|=15, |id_#res|=15] [?] RET #32#return; VAL [id_~x=16, |id_#in~x|=16, |id_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=16, |id_#in~x|=16, |id_#res|=16] [?] assume true; VAL [id_~x=16, |id_#in~x|=16, |id_#res|=16] [?] RET #32#return; VAL [id_~x=17, |id_#in~x|=17, |id_#t~ret0|=16] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=17, |id_#in~x|=17, |id_#res|=17] [?] assume true; VAL [id_~x=17, |id_#in~x|=17, |id_#res|=17] [?] RET #32#return; VAL [id_~x=18, |id_#in~x|=18, |id_#t~ret0|=17] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=18, |id_#in~x|=18, |id_#res|=18] [?] assume true; VAL [id_~x=18, |id_#in~x|=18, |id_#res|=18] [?] RET #32#return; VAL [id_~x=19, |id_#in~x|=19, |id_#t~ret0|=18] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=19, |id_#in~x|=19, |id_#res|=19] [?] assume true; VAL [id_~x=19, |id_#in~x|=19, |id_#res|=19] [?] RET #32#return; VAL [id_~x=20, |id_#in~x|=20, |id_#t~ret0|=19] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=20, |id_#in~x|=20, |id_#res|=20] [?] assume true; VAL [id_~x=20, |id_#in~x|=20, |id_#res|=20] [?] RET #30#return; VAL [main_~input~0=20, |main_#t~ret1|=20] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~input~0=20, main_~result~0=20] [?] assume 20 == ~result~0; VAL [main_~input~0=20, main_~result~0=20] [?] assume !false; VAL [main_~input~0=20, main_~result~0=20] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] assume !(0 == ~x); VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] assume !(0 == ~x); VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] assume !(0 == ~x); VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] assume !(0 == ~x); VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] assume !(0 == ~x); VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] assume !(0 == ~x); VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] assume !(0 == ~x); VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] assume !(0 == ~x); VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] assume !(0 == ~x); VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] assume !(0 == ~x); VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L4-L7] ensures true; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L4-L7] ensures true; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L4-L7] ensures true; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L4-L7] ensures true; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L4-L7] ensures true; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L4-L7] ensures true; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L4-L7] ensures true; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L4-L7] ensures true; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L4-L7] ensures true; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L4-L7] ensures true; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12-L14] assume 20 == ~result~0; VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] assume !(0 == ~x); VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] assume !(0 == ~x); VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] assume !(0 == ~x); VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] assume !(0 == ~x); VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] assume !(0 == ~x); VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] assume !(0 == ~x); VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] assume !(0 == ~x); VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] assume !(0 == ~x); VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] assume !(0 == ~x); VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] assume !(0 == ~x); VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L4-L7] ensures true; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L4-L7] ensures true; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L4-L7] ensures true; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L4-L7] ensures true; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L4-L7] ensures true; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L4-L7] ensures true; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L4-L7] ensures true; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L4-L7] ensures true; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L4-L7] ensures true; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L4-L7] ensures true; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12-L14] assume 20 == ~result~0; VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [L10] int input = 20; VAL [input=20] [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] ----- [2018-11-23 08:34:42,226 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4a87d325-4b35-43ea-9207-d8213f9bcd0e/bin-2019/utaipan/witness.graphml [2018-11-23 08:34:42,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:34:42,227 INFO L168 Benchmark]: Toolchain (without parser) took 94824.12 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 539.0 MB). Free memory was 958.1 MB in the beginning and 1.5 GB in the end (delta: -536.5 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:34:42,227 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:34:42,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.05 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:34:42,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.46 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:34:42,228 INFO L168 Benchmark]: Boogie Preprocessor took 9.96 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:34:42,228 INFO L168 Benchmark]: RCFGBuilder took 152.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:34:42,228 INFO L168 Benchmark]: TraceAbstraction took 93955.81 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 415.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -388.2 MB). Peak memory consumption was 794.9 MB. Max. memory is 11.5 GB. [2018-11-23 08:34:42,229 INFO L168 Benchmark]: Witness Printer took 534.99 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. Max. memory is 11.5 GB. [2018-11-23 08:34:42,231 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.05 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.46 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.96 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 152.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 93955.81 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 415.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -388.2 MB). Peak memory consumption was 794.9 MB. Max. memory is 11.5 GB. * Witness Printer took 534.99 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 20; VAL [input=20] [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 93.9s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 431 SDslu, 3947 SDs, 0 SdLazy, 2345 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 3518 GetRequests, 2095 SyntacticMatches, 397 SemanticMatches, 1026 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19561 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.6944444444444444 AbsIntWeakeningRatio, 0.5555555555555556 AbsIntAvgWeakeningVarsNumRemoved, 0.8333333333333334 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 164 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 87.5s InterpolantComputationTime, 2901 NumberOfCodeBlocks, 2901 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 4080 ConstructedInterpolants, 0 QuantifiedInterpolants, 1004976 SizeOfPredicates, 216 NumberOfNonLiveVariables, 3222 ConjunctsInSsa, 450 ConjunctsInUnsatCore, 56 InterpolantComputations, 1 PerfectInterpolantSequences, 8991/22792 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...