./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.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_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 05:08:37,134 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:08:37,135 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:08:37,144 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:08:37,144 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:08:37,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:08:37,146 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:08:37,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:08:37,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:08:37,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:08:37,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:08:37,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:08:37,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:08:37,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:08:37,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:08:37,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:08:37,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:08:37,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:08:37,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:08:37,159 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:08:37,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:08:37,162 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:08:37,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:08:37,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:08:37,164 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:08:37,165 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:08:37,166 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:08:37,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:08:37,167 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:08:37,168 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:08:37,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:08:37,169 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:08:37,170 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:08:37,170 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:08:37,171 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:08:37,172 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:08:37,172 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 05:08:37,182 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:08:37,182 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:08:37,183 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:08:37,183 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:08:37,183 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:08:37,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:08:37,184 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:08:37,184 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:08:37,184 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:08:37,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:08:37,186 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:08:37,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:08:37,186 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:08:37,186 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:08:37,186 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:08:37,186 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:08:37,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:08:37,187 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:08:37,187 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:08:37,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:08:37,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:08:37,187 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:08:37,188 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:08:37,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:08:37,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:08:37,188 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:08:37,188 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:08:37,188 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:08:37,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:08:37,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:08:37,189 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer 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 -> Automizer 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 -> d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 [2018-11-23 05:08:37,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:08:37,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:08:37,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:08:37,230 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:08:37,231 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:08:37,231 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 05:08:37,281 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/data/d6c27406c/632b649929324534b48f5dd7e0175df2/FLAG7c4337fba [2018-11-23 05:08:37,621 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:08:37,622 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 05:08:37,627 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/data/d6c27406c/632b649929324534b48f5dd7e0175df2/FLAG7c4337fba [2018-11-23 05:08:38,044 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/data/d6c27406c/632b649929324534b48f5dd7e0175df2 [2018-11-23 05:08:38,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:08:38,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:08:38,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:08:38,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:08:38,053 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:08:38,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6566c35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38, skipping insertion in model container [2018-11-23 05:08:38,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:08:38,079 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:08:38,203 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:08:38,205 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:08:38,215 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:08:38,225 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:08:38,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38 WrapperNode [2018-11-23 05:08:38,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:08:38,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:08:38,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:08:38,226 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:08:38,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:08:38,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:08:38,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:08:38,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:08:38,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (1/1) ... [2018-11-23 05:08:38,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:08:38,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:08:38,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:08:38,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:08:38,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:08:38,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:08:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:08:38,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:08:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:08:38,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:08:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 05:08:38,353 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 05:08:38,479 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:08:38,479 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 05:08:38,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:08:38 BoogieIcfgContainer [2018-11-23 05:08:38,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:08:38,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:08:38,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:08:38,482 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:08:38,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:08:38" (1/3) ... [2018-11-23 05:08:38,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575a732b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:08:38, skipping insertion in model container [2018-11-23 05:08:38,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:08:38" (2/3) ... [2018-11-23 05:08:38,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575a732b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:08:38, skipping insertion in model container [2018-11-23 05:08:38,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:08:38" (3/3) ... [2018-11-23 05:08:38,485 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 05:08:38,492 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:08:38,498 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:08:38,511 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:08:38,534 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:08:38,534 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:08:38,534 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:08:38,534 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:08:38,535 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:08:38,535 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:08:38,535 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:08:38,535 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:08:38,535 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:08:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 05:08:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:08:38,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:38,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:08:38,556 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:38,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-11-23 05:08:38,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:38,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:38,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:38,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:38,782 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 05:08:38,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:08:38,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:08:38,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:08:38,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:08:38,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:08:38,802 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 05:08:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:38,843 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 05:08:38,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:08:38,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 05:08:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:38,854 INFO L225 Difference]: With dead ends: 32 [2018-11-23 05:08:38,854 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 05:08:38,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:08:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 05:08:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 05:08:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 05:08:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 05:08:38,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 05:08:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:38,888 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 05:08:38,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:08:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 05:08:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:08:38,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:38,890 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 05:08:38,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:38,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:38,890 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-11-23 05:08:38,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:38,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:38,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:38,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:38,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:39,011 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 05:08:39,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:39,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:39,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:39,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:39,083 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 05:08:39,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:39,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 05:08:39,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:08:39,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:08:39,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:08:39,104 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2018-11-23 05:08:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:39,139 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 05:08:39,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:08:39,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 05:08:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:39,140 INFO L225 Difference]: With dead ends: 25 [2018-11-23 05:08:39,140 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 05:08:39,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:08:39,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 05:08:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 05:08:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 05:08:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 05:08:39,145 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 05:08:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:39,146 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 05:08:39,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:08:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 05:08:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:08:39,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:39,147 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 05:08:39,147 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:39,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-11-23 05:08:39,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:39,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:39,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:39,267 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 05:08:39,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:39,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:39,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:08:39,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:08:39,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:39,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:39,336 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 05:08:39,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:39,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 05:08:39,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 05:08:39,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:08:39,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:08:39,354 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-11-23 05:08:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:39,389 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 05:08:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:08:39,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 05:08:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:39,390 INFO L225 Difference]: With dead ends: 28 [2018-11-23 05:08:39,391 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 05:08:39,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:08:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 05:08:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 05:08:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 05:08:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 05:08:39,396 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-23 05:08:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:39,397 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 05:08:39,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 05:08:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 05:08:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:08:39,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:39,398 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 05:08:39,399 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:39,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-11-23 05:08:39,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:39,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:39,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:39,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:39,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:39,552 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 05:08:39,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:39,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:39,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:08:39,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 05:08:39,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:39,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:39,647 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 05:08:39,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:39,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 05:08:39,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:08:39,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:08:39,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:08:39,678 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-11-23 05:08:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:39,719 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 05:08:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:08:39,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 05:08:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:39,720 INFO L225 Difference]: With dead ends: 31 [2018-11-23 05:08:39,721 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 05:08:39,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:08:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 05:08:39,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 05:08:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 05:08:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 05:08:39,726 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-23 05:08:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:39,727 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 05:08:39,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:08:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 05:08:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 05:08:39,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:39,729 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 05:08:39,729 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:39,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:39,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-11-23 05:08:39,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:39,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:39,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:39,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:39,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:39,896 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 05:08:39,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:39,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:39,902 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:08:39,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:08:39,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:39,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:39,948 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 05:08:39,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:39,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 05:08:39,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 05:08:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 05:08:39,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:08:39,977 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-11-23 05:08:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:40,022 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 05:08:40,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 05:08:40,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-23 05:08:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:40,023 INFO L225 Difference]: With dead ends: 34 [2018-11-23 05:08:40,023 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 05:08:40,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:08:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 05:08:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 05:08:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 05:08:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 05:08:40,027 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-23 05:08:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:40,028 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 05:08:40,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 05:08:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 05:08:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 05:08:40,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:40,029 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 05:08:40,029 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:40,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:40,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-11-23 05:08:40,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:40,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:40,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:40,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:40,228 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 05:08:40,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:40,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:40,238 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:08:40,288 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 05:08:40,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:40,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:40,318 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 05:08:40,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:40,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 05:08:40,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 05:08:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 05:08:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-11-23 05:08:40,337 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2018-11-23 05:08:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:40,418 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 05:08:40,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 05:08:40,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-11-23 05:08:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:40,426 INFO L225 Difference]: With dead ends: 37 [2018-11-23 05:08:40,426 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 05:08:40,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-11-23 05:08:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 05:08:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 05:08:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 05:08:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 05:08:40,431 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-23 05:08:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:40,431 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 05:08:40,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 05:08:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 05:08:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 05:08:40,433 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:40,433 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 05:08:40,433 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:40,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-11-23 05:08:40,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:40,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:40,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:40,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:40,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:40,696 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 05:08:40,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:40,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:40,706 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:08:40,730 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 05:08:40,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:40,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:40,765 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 05:08:40,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:40,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 05:08:40,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 05:08:40,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 05:08:40,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:08:40,784 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2018-11-23 05:08:40,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:40,882 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 05:08:40,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 05:08:40,883 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-11-23 05:08:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:40,884 INFO L225 Difference]: With dead ends: 40 [2018-11-23 05:08:40,884 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 05:08:40,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:08:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 05:08:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 05:08:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 05:08:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 05:08:40,889 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-23 05:08:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:40,889 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 05:08:40,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 05:08:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 05:08:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 05:08:40,890 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:40,890 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 05:08:40,891 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:40,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-11-23 05:08:40,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:40,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:40,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:41,110 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 05:08:41,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:41,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:41,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:41,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:41,183 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 05:08:41,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:41,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 05:08:41,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 05:08:41,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 05:08:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-11-23 05:08:41,203 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2018-11-23 05:08:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:41,288 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 05:08:41,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 05:08:41,288 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-23 05:08:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:41,289 INFO L225 Difference]: With dead ends: 43 [2018-11-23 05:08:41,289 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 05:08:41,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-11-23 05:08:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 05:08:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 05:08:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 05:08:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 05:08:41,294 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-23 05:08:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:41,294 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 05:08:41,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 05:08:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 05:08:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 05:08:41,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:41,295 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 05:08:41,296 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:41,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:41,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-11-23 05:08:41,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:41,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:41,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:41,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:41,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:41,543 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 05:08:41,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:41,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:41,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:08:41,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:08:41,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:41,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:41,622 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 05:08:41,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:41,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 05:08:41,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 05:08:41,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 05:08:41,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-11-23 05:08:41,640 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2018-11-23 05:08:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:41,748 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 05:08:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 05:08:41,748 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-11-23 05:08:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:41,749 INFO L225 Difference]: With dead ends: 46 [2018-11-23 05:08:41,749 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 05:08:41,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-11-23 05:08:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 05:08:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 05:08:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 05:08:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 05:08:41,753 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-23 05:08:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:41,754 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 05:08:41,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 05:08:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 05:08:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 05:08:41,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:41,755 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 05:08:41,755 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:41,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:41,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-11-23 05:08:41,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:41,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:41,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:41,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:41,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:42,038 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 05:08:42,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:42,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:42,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:08:42,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 05:08:42,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:42,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:42,148 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 05:08:42,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:42,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 05:08:42,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 05:08:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 05:08:42,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-11-23 05:08:42,170 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2018-11-23 05:08:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:42,321 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 05:08:42,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 05:08:42,321 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-11-23 05:08:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:42,322 INFO L225 Difference]: With dead ends: 49 [2018-11-23 05:08:42,322 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 05:08:42,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-11-23 05:08:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 05:08:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 05:08:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 05:08:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 05:08:42,329 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-23 05:08:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:42,329 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 05:08:42,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 05:08:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 05:08:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 05:08:42,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:42,331 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 05:08:42,331 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:42,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:42,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-11-23 05:08:42,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:42,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:42,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:42,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:42,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:42,648 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 05:08:42,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:42,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:42,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:08:42,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:08:42,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:42,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:42,712 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 05:08:42,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:42,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 05:08:42,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 05:08:42,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 05:08:42,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-11-23 05:08:42,731 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 26 states. [2018-11-23 05:08:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:42,887 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 05:08:42,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 05:08:42,887 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-11-23 05:08:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:42,888 INFO L225 Difference]: With dead ends: 52 [2018-11-23 05:08:42,888 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 05:08:42,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-11-23 05:08:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 05:08:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 05:08:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 05:08:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 05:08:42,893 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2018-11-23 05:08:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:42,893 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 05:08:42,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 05:08:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 05:08:42,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 05:08:42,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:42,894 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 05:08:42,895 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:42,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:42,895 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2018-11-23 05:08:42,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:42,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:42,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:42,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:42,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:43,369 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 05:08:43,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:43,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:43,381 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:08:55,966 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 05:08:55,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:55,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:56,013 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 05:08:56,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:56,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 05:08:56,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 05:08:56,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 05:08:56,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-11-23 05:08:56,031 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 28 states. [2018-11-23 05:08:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:56,181 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 05:08:56,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 05:08:56,181 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-11-23 05:08:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:08:56,182 INFO L225 Difference]: With dead ends: 55 [2018-11-23 05:08:56,182 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 05:08:56,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-11-23 05:08:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 05:08:56,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 05:08:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 05:08:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 05:08:56,187 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2018-11-23 05:08:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:08:56,187 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 05:08:56,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 05:08:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 05:08:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 05:08:56,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:08:56,188 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 05:08:56,188 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:08:56,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:56,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2018-11-23 05:08:56,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:56,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:56,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:56,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:56,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:56,506 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 05:08:56,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:56,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:08:56,513 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:09:23,630 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 05:09:23,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:09:23,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:23,704 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 05:09:23,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:23,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 05:09:23,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 05:09:23,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 05:09:23,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-11-23 05:09:23,723 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 30 states. [2018-11-23 05:09:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:23,962 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 05:09:23,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 05:09:23,962 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2018-11-23 05:09:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:09:23,964 INFO L225 Difference]: With dead ends: 58 [2018-11-23 05:09:23,964 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 05:09:23,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-11-23 05:09:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 05:09:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 05:09:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 05:09:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 05:09:23,975 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2018-11-23 05:09:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:09:23,975 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 05:09:23,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 05:09:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 05:09:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 05:09:23,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:09:23,976 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 05:09:23,977 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:09:23,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:23,977 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2018-11-23 05:09:23,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:23,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:23,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:24,460 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 05:09:24,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:24,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:09:24,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:09:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:24,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:24,558 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 05:09:24,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:24,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 05:09:24,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 05:09:24,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 05:09:24,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-11-23 05:09:24,576 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 32 states. [2018-11-23 05:09:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:24,816 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 05:09:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 05:09:24,817 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-11-23 05:09:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:09:24,818 INFO L225 Difference]: With dead ends: 61 [2018-11-23 05:09:24,818 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 05:09:24,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-11-23 05:09:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 05:09:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 05:09:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 05:09:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 05:09:24,823 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2018-11-23 05:09:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:09:24,824 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 05:09:24,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 05:09:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 05:09:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 05:09:24,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:09:24,827 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 05:09:24,828 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:09:24,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:24,828 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2018-11-23 05:09:24,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:24,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:24,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:24,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:09:24,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:25,261 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 05:09:25,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:25,261 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:09:25,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:09:25,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:09:25,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:09:25,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:25,334 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 05:09:25,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:25,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 05:09:25,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 05:09:25,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 05:09:25,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 05:09:25,352 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 34 states. [2018-11-23 05:09:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:25,569 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 05:09:25,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 05:09:25,569 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2018-11-23 05:09:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:09:25,570 INFO L225 Difference]: With dead ends: 64 [2018-11-23 05:09:25,570 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 05:09:25,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 05:09:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 05:09:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 05:09:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 05:09:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 05:09:25,577 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2018-11-23 05:09:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:09:25,577 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 05:09:25,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 05:09:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 05:09:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 05:09:25,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:09:25,579 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 05:09:25,579 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:09:25,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:25,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2018-11-23 05:09:25,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:25,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:25,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:26,093 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 05:09:26,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:26,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:09:26,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:09:27,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 05:09:27,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:09:27,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:27,324 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 05:09:27,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:27,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 05:09:27,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 05:09:27,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 05:09:27,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 05:09:27,344 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 36 states. [2018-11-23 05:09:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:27,613 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-11-23 05:09:27,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 05:09:27,614 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2018-11-23 05:09:27,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:09:27,614 INFO L225 Difference]: With dead ends: 67 [2018-11-23 05:09:27,614 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 05:09:27,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 05:09:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 05:09:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 05:09:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 05:09:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-11-23 05:09:27,618 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2018-11-23 05:09:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:09:27,619 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-11-23 05:09:27,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 05:09:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 05:09:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 05:09:27,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:09:27,619 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 05:09:27,619 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:09:27,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2018-11-23 05:09:27,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:27,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:27,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:27,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:27,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:28,126 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 05:09:28,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:28,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:09:28,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:09:28,152 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:09:28,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:09:28,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:28,216 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 05:09:28,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:28,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 05:09:28,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 05:09:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 05:09:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 05:09:28,234 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 38 states. [2018-11-23 05:09:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:28,510 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-23 05:09:28,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 05:09:28,510 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-11-23 05:09:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:09:28,511 INFO L225 Difference]: With dead ends: 70 [2018-11-23 05:09:28,511 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 05:09:28,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 05:09:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 05:09:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 05:09:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 05:09:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-23 05:09:28,516 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2018-11-23 05:09:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:09:28,517 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-23 05:09:28,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 05:09:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-23 05:09:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 05:09:28,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:09:28,518 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 05:09:28,518 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:09:28,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:28,518 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2018-11-23 05:09:28,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:28,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:28,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:29,269 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 05:09:29,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:29,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:09:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:11:23,910 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 05:11:23,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:11:25,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:11:25,280 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 05:11:25,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:11:25,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 05:11:25,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 05:11:25,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 05:11:25,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 05:11:25,286 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 40 states. [2018-11-23 05:11:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:25,591 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-23 05:11:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 05:11:25,591 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2018-11-23 05:11:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:25,592 INFO L225 Difference]: With dead ends: 73 [2018-11-23 05:11:25,592 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 05:11:25,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 05:11:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 05:11:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-23 05:11:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 05:11:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-23 05:11:25,595 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2018-11-23 05:11:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:25,595 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-23 05:11:25,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 05:11:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 05:11:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 05:11:25,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:25,595 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 05:11:25,596 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:25,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2018-11-23 05:11:25,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:11:25,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:11:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:25,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:11:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:26,251 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 05:11:26,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:11:26,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/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 05:11:26,259 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:12:27,745 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 05:12:27,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:27,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:27,847 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 05:12:27,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:27,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 05:12:27,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 05:12:27,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 05:12:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 05:12:27,876 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 42 states. [2018-11-23 05:12:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:28,309 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-23 05:12:28,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 05:12:28,309 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2018-11-23 05:12:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:12:28,310 INFO L225 Difference]: With dead ends: 76 [2018-11-23 05:12:28,310 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 05:12:28,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 05:12:28,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 05:12:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 05:12:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 05:12:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-23 05:12:28,315 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2018-11-23 05:12:28,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:12:28,316 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-23 05:12:28,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 05:12:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-23 05:12:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 05:12:28,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:12:28,316 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 05:12:28,316 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:12:28,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2018-11-23 05:12:28,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:28,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:28,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:28,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:28,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:29,084 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 05:12:29,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:29,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:12:29,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:29,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:29,212 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 05:12:29,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:29,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 05:12:29,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 05:12:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 05:12:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 05:12:29,233 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 44 states. [2018-11-23 05:12:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:29,650 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-11-23 05:12:29,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 05:12:29,650 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2018-11-23 05:12:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:12:29,651 INFO L225 Difference]: With dead ends: 79 [2018-11-23 05:12:29,651 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 05:12:29,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 05:12:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 05:12:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-23 05:12:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 05:12:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-11-23 05:12:29,654 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2018-11-23 05:12:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:12:29,655 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-11-23 05:12:29,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 05:12:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-23 05:12:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 05:12:29,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:12:29,656 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 05:12:29,656 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:12:29,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2018-11-23 05:12:29,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:29,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:29,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:29,834 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~ret3 := main(); [?] ~input~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~input~0=4294967316] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=4294967316] [?] ~x := #in~x; VAL [id_~x=4294967316, |id_#in~x|=4294967316] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967316, |id_#in~x|=4294967316] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967315] [?] ~x := #in~x; VAL [id_~x=4294967315, |id_#in~x|=4294967315] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967315, |id_#in~x|=4294967315] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967314] [?] ~x := #in~x; VAL [id_~x=4294967314, |id_#in~x|=4294967314] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967314, |id_#in~x|=4294967314] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967313] [?] ~x := #in~x; VAL [id_~x=4294967313, |id_#in~x|=4294967313] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967313, |id_#in~x|=4294967313] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967312] [?] ~x := #in~x; VAL [id_~x=4294967312, |id_#in~x|=4294967312] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967312, |id_#in~x|=4294967312] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967311] [?] ~x := #in~x; VAL [id_~x=4294967311, |id_#in~x|=4294967311] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967311, |id_#in~x|=4294967311] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967310] [?] ~x := #in~x; VAL [id_~x=4294967310, |id_#in~x|=4294967310] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967310, |id_#in~x|=4294967310] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967309] [?] ~x := #in~x; VAL [id_~x=4294967309, |id_#in~x|=4294967309] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967309, |id_#in~x|=4294967309] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967308] [?] ~x := #in~x; VAL [id_~x=4294967308, |id_#in~x|=4294967308] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967308, |id_#in~x|=4294967308] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967307] [?] ~x := #in~x; VAL [id_~x=4294967307, |id_#in~x|=4294967307] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967307, |id_#in~x|=4294967307] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967306] [?] ~x := #in~x; VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967305] [?] ~x := #in~x; VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967304] [?] ~x := #in~x; VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967303] [?] ~x := #in~x; VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967302] [?] ~x := #in~x; VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967301] [?] ~x := #in~x; VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967300] [?] ~x := #in~x; VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967299] [?] ~x := #in~x; VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967298] [?] ~x := #in~x; VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967297] [?] ~x := #in~x; VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967296] [?] ~x := #in~x; VAL [id_~x=4294967296, |id_#in~x|=4294967296] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] assume true; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] RET #32#return; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#t~ret0|=0] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] assume true; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] RET #32#return; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#t~ret0|=1] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] assume true; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] RET #32#return; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#t~ret0|=2] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] assume true; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] RET #32#return; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#t~ret0|=3] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] assume true; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] RET #32#return; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#t~ret0|=4] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] assume true; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] RET #32#return; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#t~ret0|=5] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] assume true; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] RET #32#return; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#t~ret0|=6] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] assume true; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] RET #32#return; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#t~ret0|=7] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] assume true; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] RET #32#return; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#t~ret0|=8] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] assume true; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] RET #32#return; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#t~ret0|=9] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] assume true; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] RET #32#return; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#t~ret0|=10] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#res|=11] [?] assume true; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#res|=11] [?] RET #32#return; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#t~ret0|=11] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#res|=12] [?] assume true; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#res|=12] [?] RET #32#return; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#t~ret0|=12] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#res|=13] [?] assume true; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#res|=13] [?] RET #32#return; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#t~ret0|=13] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#res|=14] [?] assume true; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#res|=14] [?] RET #32#return; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#t~ret0|=14] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#res|=15] [?] assume true; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#res|=15] [?] RET #32#return; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#t~ret0|=15] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#res|=16] [?] assume true; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#res|=16] [?] RET #32#return; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#t~ret0|=16] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#res|=17] [?] assume true; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#res|=17] [?] RET #32#return; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#t~ret0|=17] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#res|=18] [?] assume true; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#res|=18] [?] RET #32#return; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#t~ret0|=18] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#res|=19] [?] assume true; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#res|=19] [?] RET #32#return; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#t~ret0|=19] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#res|=20] [?] assume true; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#res|=20] [?] RET #30#return; VAL [main_~input~0=4294967316, |main_#t~ret2|=20] [?] ~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=4294967316, main_~result~0=20] [?] assume 20 == ~result~0 % 4294967296; VAL [main_~input~0=4294967316, main_~result~0=20] [?] assume !false; VAL [main_~input~0=4294967316, main_~result~0=20] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L4-L7] ensures true; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L4-L7] ensures true; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L4-L7] ensures true; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L4-L7] ensures true; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L4-L7] ensures true; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L4-L7] ensures true; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L4-L7] ensures true; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L4-L7] ensures true; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L4-L7] ensures true; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L4-L7] ensures true; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12-L14] assume 20 == ~result~0 % 4294967296; VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~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~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L4-L7] ensures true; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L4-L7] ensures true; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L4-L7] ensures true; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L4-L7] ensures true; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L4-L7] ensures true; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L4-L7] ensures true; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L4-L7] ensures true; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L4-L7] ensures true; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L4-L7] ensures true; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L4-L7] ensures true; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12-L14] assume 20 == ~result~0 % 4294967296; VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [L10] unsigned int input = __VERIFIER_nondet_uint(); [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] unsigned 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 05:12:30,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:12:30 BoogieIcfgContainer [2018-11-23 05:12:30,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:12:30,059 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:12:30,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:12:30,059 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:12:30,060 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:08:38" (3/4) ... [2018-11-23 05:12:30,065 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~ret3 := main(); [?] ~input~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~input~0=4294967316] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=4294967316] [?] ~x := #in~x; VAL [id_~x=4294967316, |id_#in~x|=4294967316] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967316, |id_#in~x|=4294967316] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967315] [?] ~x := #in~x; VAL [id_~x=4294967315, |id_#in~x|=4294967315] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967315, |id_#in~x|=4294967315] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967314] [?] ~x := #in~x; VAL [id_~x=4294967314, |id_#in~x|=4294967314] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967314, |id_#in~x|=4294967314] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967313] [?] ~x := #in~x; VAL [id_~x=4294967313, |id_#in~x|=4294967313] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967313, |id_#in~x|=4294967313] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967312] [?] ~x := #in~x; VAL [id_~x=4294967312, |id_#in~x|=4294967312] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967312, |id_#in~x|=4294967312] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967311] [?] ~x := #in~x; VAL [id_~x=4294967311, |id_#in~x|=4294967311] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967311, |id_#in~x|=4294967311] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967310] [?] ~x := #in~x; VAL [id_~x=4294967310, |id_#in~x|=4294967310] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967310, |id_#in~x|=4294967310] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967309] [?] ~x := #in~x; VAL [id_~x=4294967309, |id_#in~x|=4294967309] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967309, |id_#in~x|=4294967309] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967308] [?] ~x := #in~x; VAL [id_~x=4294967308, |id_#in~x|=4294967308] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967308, |id_#in~x|=4294967308] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967307] [?] ~x := #in~x; VAL [id_~x=4294967307, |id_#in~x|=4294967307] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967307, |id_#in~x|=4294967307] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967306] [?] ~x := #in~x; VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967305] [?] ~x := #in~x; VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967304] [?] ~x := #in~x; VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967303] [?] ~x := #in~x; VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967302] [?] ~x := #in~x; VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967301] [?] ~x := #in~x; VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967300] [?] ~x := #in~x; VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967299] [?] ~x := #in~x; VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967298] [?] ~x := #in~x; VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967297] [?] ~x := #in~x; VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967296] [?] ~x := #in~x; VAL [id_~x=4294967296, |id_#in~x|=4294967296] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] assume true; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] RET #32#return; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#t~ret0|=0] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] assume true; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] RET #32#return; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#t~ret0|=1] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] assume true; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] RET #32#return; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#t~ret0|=2] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] assume true; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] RET #32#return; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#t~ret0|=3] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] assume true; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] RET #32#return; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#t~ret0|=4] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] assume true; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] RET #32#return; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#t~ret0|=5] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] assume true; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] RET #32#return; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#t~ret0|=6] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] assume true; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] RET #32#return; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#t~ret0|=7] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] assume true; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] RET #32#return; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#t~ret0|=8] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] assume true; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] RET #32#return; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#t~ret0|=9] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] assume true; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] RET #32#return; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#t~ret0|=10] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#res|=11] [?] assume true; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#res|=11] [?] RET #32#return; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#t~ret0|=11] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#res|=12] [?] assume true; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#res|=12] [?] RET #32#return; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#t~ret0|=12] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#res|=13] [?] assume true; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#res|=13] [?] RET #32#return; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#t~ret0|=13] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#res|=14] [?] assume true; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#res|=14] [?] RET #32#return; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#t~ret0|=14] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#res|=15] [?] assume true; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#res|=15] [?] RET #32#return; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#t~ret0|=15] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#res|=16] [?] assume true; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#res|=16] [?] RET #32#return; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#t~ret0|=16] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#res|=17] [?] assume true; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#res|=17] [?] RET #32#return; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#t~ret0|=17] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#res|=18] [?] assume true; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#res|=18] [?] RET #32#return; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#t~ret0|=18] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#res|=19] [?] assume true; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#res|=19] [?] RET #32#return; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#t~ret0|=19] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#res|=20] [?] assume true; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#res|=20] [?] RET #30#return; VAL [main_~input~0=4294967316, |main_#t~ret2|=20] [?] ~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=4294967316, main_~result~0=20] [?] assume 20 == ~result~0 % 4294967296; VAL [main_~input~0=4294967316, main_~result~0=20] [?] assume !false; VAL [main_~input~0=4294967316, main_~result~0=20] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L4-L7] ensures true; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L4-L7] ensures true; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L4-L7] ensures true; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L4-L7] ensures true; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L4-L7] ensures true; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L4-L7] ensures true; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L4-L7] ensures true; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L4-L7] ensures true; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L4-L7] ensures true; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L4-L7] ensures true; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12-L14] assume 20 == ~result~0 % 4294967296; VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~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~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L4-L7] ensures true; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L4-L7] ensures true; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L4-L7] ensures true; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L4-L7] ensures true; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L4-L7] ensures true; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L4-L7] ensures true; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L4-L7] ensures true; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L4-L7] ensures true; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L4-L7] ensures true; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L4-L7] ensures true; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12-L14] assume 20 == ~result~0 % 4294967296; VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [L10] unsigned int input = __VERIFIER_nondet_uint(); [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] unsigned 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 05:12:30,661 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_55628490-f1e3-45d0-9ab2-e54f06bf4120/bin-2019/uautomizer/witness.graphml [2018-11-23 05:12:30,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:12:30,662 INFO L168 Benchmark]: Toolchain (without parser) took 232614.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.8 MB). Free memory was 959.3 MB in the beginning and 825.3 MB in the end (delta: 133.9 MB). Peak memory consumption was 475.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:12:30,663 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:12:30,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:12:30,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.13 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:12:30,664 INFO L168 Benchmark]: Boogie Preprocessor took 12.99 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:12:30,664 INFO L168 Benchmark]: RCFGBuilder took 224.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:12:30,664 INFO L168 Benchmark]: TraceAbstraction took 231578.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 835.1 MB in the end (delta: 297.3 MB). Peak memory consumption was 486.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:12:30,665 INFO L168 Benchmark]: Witness Printer took 602.29 ms. Allocated memory is still 1.4 GB. Free memory was 835.1 MB in the beginning and 825.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:12:30,667 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 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 15.13 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.99 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 231578.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 835.1 MB in the end (delta: 297.3 MB). Peak memory consumption was 486.6 MB. Max. memory is 11.5 GB. * Witness Printer took 602.29 ms. Allocated memory is still 1.4 GB. Free memory was 835.1 MB in the beginning and 825.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. 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] unsigned int input = __VERIFIER_nondet_uint(); [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] unsigned 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, 231.5s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 684 SDtfs, 2 SDslu, 14784 SDs, 0 SdLazy, 8747 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1848 GetRequests, 1370 SyntacticMatches, 19 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 217.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 2920 NumberOfCodeBlocks, 2920 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2748 ConstructedInterpolants, 0 QuantifiedInterpolants, 925248 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2850 ConjunctsInSsa, 912 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 7600/15200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...