./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_o10_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_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 0c292d0c9d9c055df9398b3303a92d6621b60758 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:56:21,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:56:21,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:56:21,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:56:21,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:56:21,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:56:21,124 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:56:21,125 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:56:21,127 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:56:21,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:56:21,128 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:56:21,128 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:56:21,129 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:56:21,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:56:21,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:56:21,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:56:21,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:56:21,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:56:21,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:56:21,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:56:21,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:56:21,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:56:21,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:56:21,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:56:21,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:56:21,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:56:21,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:56:21,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:56:21,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:56:21,139 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:56:21,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:56:21,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:56:21,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:56:21,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:56:21,140 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:56:21,141 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:56:21,141 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:56:21,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:56:21,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:56:21,151 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:56:21,152 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:56:21,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:56:21,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:56:21,153 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:56:21,153 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:56:21,153 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:56:21,153 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:56:21,153 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:56:21,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:56:21,154 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:56:21,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:56:21,154 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:56:21,154 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:56:21,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:56:21,154 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:56:21,154 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:56:21,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:56:21,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:56:21,156 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:56:21,156 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:56:21,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:56:21,157 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:56:21,157 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:56:21,157 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:56:21,157 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:56:21,157 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:56:21,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:56:21,157 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_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 -> 0c292d0c9d9c055df9398b3303a92d6621b60758 [2018-11-23 12:56:21,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:56:21,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:56:21,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:56:21,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:56:21,194 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:56:21,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 12:56:21,237 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/data/d93fc3f73/7fce67f32ba943bc8bad01712d50e9b4/FLAGc2bebaa6d [2018-11-23 12:56:21,556 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:56:21,556 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 12:56:21,560 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/data/d93fc3f73/7fce67f32ba943bc8bad01712d50e9b4/FLAGc2bebaa6d [2018-11-23 12:56:21,996 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/data/d93fc3f73/7fce67f32ba943bc8bad01712d50e9b4 [2018-11-23 12:56:21,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:56:22,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:56:22,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:22,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:56:22,003 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:56:22,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:21" (1/1) ... [2018-11-23 12:56:22,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46704e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22, skipping insertion in model container [2018-11-23 12:56:22,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:21" (1/1) ... [2018-11-23 12:56:22,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:56:22,022 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:56:22,123 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:22,125 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:56:22,133 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:22,141 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:56:22,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22 WrapperNode [2018-11-23 12:56:22,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:22,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:22,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:56:22,142 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:56:22,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (1/1) ... [2018-11-23 12:56:22,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (1/1) ... [2018-11-23 12:56:22,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:22,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:56:22,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:56:22,154 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:56:22,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (1/1) ... [2018-11-23 12:56:22,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (1/1) ... [2018-11-23 12:56:22,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (1/1) ... [2018-11-23 12:56:22,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (1/1) ... [2018-11-23 12:56:22,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (1/1) ... [2018-11-23 12:56:22,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (1/1) ... [2018-11-23 12:56:22,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (1/1) ... [2018-11-23 12:56:22,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:56:22,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:56:22,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:56:22,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:56:22,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 12:56:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:56:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:56:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:56:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:56:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:56:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:56:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 12:56:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 12:56:22,310 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:56:22,310 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:56:22,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:22 BoogieIcfgContainer [2018-11-23 12:56:22,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:56:22,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:56:22,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:56:22,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:56:22,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:56:21" (1/3) ... [2018-11-23 12:56:22,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e29b3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:56:22, skipping insertion in model container [2018-11-23 12:56:22,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:22" (2/3) ... [2018-11-23 12:56:22,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e29b3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:56:22, skipping insertion in model container [2018-11-23 12:56:22,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:22" (3/3) ... [2018-11-23 12:56:22,315 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 12:56:22,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:56:22,325 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:56:22,335 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:56:22,352 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:56:22,353 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:56:22,353 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:56:22,353 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:56:22,353 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:56:22,353 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:56:22,353 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:56:22,353 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:56:22,354 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:56:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 12:56:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:56:22,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:22,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:22,371 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:22,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:22,375 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-11-23 12:56:22,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:22,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:22,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:22,536 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 12:56:22,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:22,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:56:22,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:56:22,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:56:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:56:22,549 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 12:56:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:22,581 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 12:56:22,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:56:22,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 12:56:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:22,591 INFO L225 Difference]: With dead ends: 32 [2018-11-23 12:56:22,591 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:56:22,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:56:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:56:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:56:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:56:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 12:56:22,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 12:56:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:22,625 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 12:56:22,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:56:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:56:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:56:22,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:22,627 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 12:56:22,627 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:22,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-11-23 12:56:22,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:22,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:22,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:22,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:22,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:22,763 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 12:56:22,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:22,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 12:56:22,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:22,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:22,829 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 12:56:22,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:22,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:56:22,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:56:22,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:56:22,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:56:22,845 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2018-11-23 12:56:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:22,862 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:56:22,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:56:22,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 12:56:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:22,863 INFO L225 Difference]: With dead ends: 25 [2018-11-23 12:56:22,863 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:56:22,864 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 12:56:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:56:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:56:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:56:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:56:22,868 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 12:56:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:22,868 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:56:22,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:56:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:56:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:56:22,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:22,869 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 12:56:22,869 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:22,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-11-23 12:56:22,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:22,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:22,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:22,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:22,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:23,008 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 12:56:23,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:23,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 12:56:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:56:23,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:56:23,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:56:23,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:23,057 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 12:56:23,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:23,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:56:23,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:56:23,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:56:23,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:56:23,080 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-11-23 12:56:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:23,112 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:56:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:56:23,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 12:56:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:23,113 INFO L225 Difference]: With dead ends: 28 [2018-11-23 12:56:23,113 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:56:23,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:56:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:56:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:56:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:56:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 12:56:23,116 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-23 12:56:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:23,117 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 12:56:23,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:56:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:56:23,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:56:23,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:23,117 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 12:56:23,118 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:23,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:23,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-11-23 12:56:23,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:23,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:23,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:23,253 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 12:56:23,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:23,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 12:56:23,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:56:23,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:56:23,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:56:23,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:23,320 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 12:56:23,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:23,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:56:23,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:56:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:56:23,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:56:23,336 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-11-23 12:56:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:23,366 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:56:23,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:56:23,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 12:56:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:23,367 INFO L225 Difference]: With dead ends: 31 [2018-11-23 12:56:23,367 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:56:23,368 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 12:56:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:56:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:56:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:56:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 12:56:23,372 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-23 12:56:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:23,372 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 12:56:23,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:56:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:56:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:56:23,373 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:23,373 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 12:56:23,374 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:23,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-11-23 12:56:23,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:23,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:23,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:23,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:23,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:23,552 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 12:56:23,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:23,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 12:56:23,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:56:23,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:56:23,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:56:23,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:23,596 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 12:56:23,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:23,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:56:23,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:56:23,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:56:23,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:56:23,612 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-11-23 12:56:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:23,657 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:56:23,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:56:23,658 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-23 12:56:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:23,659 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:56:23,659 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:56:23,659 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 12:56:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:56:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 12:56:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:56:23,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 12:56:23,663 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-23 12:56:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:23,663 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 12:56:23,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:56:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:56:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:56:23,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:23,664 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 12:56:23,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:23,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:23,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-11-23 12:56:23,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:23,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:23,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:23,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:23,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:23,837 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 12:56:23,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:23,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 12:56:23,843 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:56:23,884 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:56:23,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:56:23,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:23,910 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 12:56:23,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:23,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:56:23,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:56:23,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:56:23,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:56:23,928 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2018-11-23 12:56:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:23,994 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 12:56:23,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:56:23,995 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-11-23 12:56:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:23,995 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:56:23,995 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:56:23,996 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 12:56:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:56:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 12:56:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:56:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 12:56:23,999 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-23 12:56:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:23,999 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 12:56:23,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:56:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:56:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:56:24,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:24,000 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 12:56:24,001 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:24,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:24,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-11-23 12:56:24,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:24,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:24,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:24,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:24,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:24,214 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 12:56:24,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:24,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 12:56:24,231 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:56:24,263 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:56:24,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:56:24,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:24,302 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 12:56:24,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:24,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:56:24,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:56:24,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:56:24,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:56:24,317 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2018-11-23 12:56:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:24,377 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:56:24,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:56:24,377 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-11-23 12:56:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:24,378 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:56:24,378 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:56:24,379 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 12:56:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:56:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 12:56:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:56:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 12:56:24,382 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-23 12:56:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:24,382 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 12:56:24,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:56:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:56:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:56:24,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:24,383 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 12:56:24,383 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:24,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:24,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-11-23 12:56:24,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:24,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:24,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:24,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:24,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:24,581 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 12:56:24,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:24,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 12:56:24,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:24,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:24,621 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 12:56:24,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:24,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:56:24,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:56:24,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:56:24,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:56:24,636 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2018-11-23 12:56:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:24,705 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 12:56:24,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:56:24,705 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-23 12:56:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:24,706 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:56:24,706 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:56:24,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:56:24,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:56:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 12:56:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:56:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 12:56:24,710 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-23 12:56:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:24,710 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 12:56:24,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:56:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:56:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:56:24,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:24,711 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 12:56:24,712 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:24,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:24,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-11-23 12:56:24,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:24,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:24,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:24,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:24,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:24,926 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 12:56:24,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:24,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 12:56:24,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:56:24,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:56:24,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:56:24,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:24,989 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 12:56:25,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:25,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:56:25,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:56:25,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:56:25,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:56:25,005 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2018-11-23 12:56:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:25,096 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 12:56:25,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:56:25,098 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-11-23 12:56:25,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:25,099 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:56:25,099 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:56:25,100 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 12:56:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:56:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 12:56:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:56:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 12:56:25,104 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-23 12:56:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:25,104 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 12:56:25,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:56:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:56:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:56:25,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:25,105 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 12:56:25,105 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:25,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:25,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-11-23 12:56:25,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:25,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:25,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:25,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:25,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:25,341 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 12:56:25,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:25,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/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 12:56:25,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:56:25,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:56:25,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:56:25,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:25,450 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 12:56:25,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:25,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:56:25,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:56:25,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:56:25,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:56:25,469 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2018-11-23 12:56:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:25,619 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:56:25,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:56:25,619 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-11-23 12:56:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:25,620 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:56:25,620 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:56:25,620 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 12:56:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:56:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 12:56:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:56:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 12:56:25,624 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-23 12:56:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:25,624 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 12:56:25,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:56:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:56:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:56:25,625 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:25,625 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 12:56:25,625 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:25,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:25,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-11-23 12:56:25,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:25,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:25,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:25,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:25,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:25,692 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=4294967306] [?] CALL call #t~ret2 := id(~input~0); 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 #30#return; VAL [main_~input~0=4294967306, |main_#t~ret2|=10] [?] ~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=4294967306, main_~result~0=10] [?] assume 10 == ~result~0 % 4294967296; VAL [main_~input~0=4294967306, main_~result~0=10] [?] assume !false; VAL [main_~input~0=4294967306, main_~result~0=10] [?] 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12-L14] assume 10 == ~result~0 % 4294967296; VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12-L14] assume 10 == ~result~0 % 4294967296; VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [?] 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [?] 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) 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; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] ----- [2018-11-23 12:56:25,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:56:25 BoogieIcfgContainer [2018-11-23 12:56:25,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:56:25,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:56:25,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:56:25,736 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:56:25,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:22" (3/4) ... [2018-11-23 12:56:25,738 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=4294967306] [?] CALL call #t~ret2 := id(~input~0); 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 #30#return; VAL [main_~input~0=4294967306, |main_#t~ret2|=10] [?] ~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=4294967306, main_~result~0=10] [?] assume 10 == ~result~0 % 4294967296; VAL [main_~input~0=4294967306, main_~result~0=10] [?] assume !false; VAL [main_~input~0=4294967306, main_~result~0=10] [?] 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12-L14] assume 10 == ~result~0 % 4294967296; VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12-L14] assume 10 == ~result~0 % 4294967296; VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [?] 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [?] 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- 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=4294967306] [L11] CALL call #t~ret2 := id(~input~0); 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] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) 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; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] ----- [2018-11-23 12:56:25,915 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_57a72c42-7ebe-478f-b2c2-cc2fe2116cca/bin-2019/uautomizer/witness.graphml [2018-11-23 12:56:25,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:56:25,916 INFO L168 Benchmark]: Toolchain (without parser) took 3917.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 958.2 MB in the beginning and 1.0 GB in the end (delta: -74.8 MB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:25,917 INFO L168 Benchmark]: CDTParser took 0.14 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 12:56:25,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.46 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:25,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.31 ms. Allocated memory is still 1.0 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:56:25,918 INFO L168 Benchmark]: Boogie Preprocessor took 9.95 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.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 12:56:25,919 INFO L168 Benchmark]: RCFGBuilder took 147.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:25,919 INFO L168 Benchmark]: TraceAbstraction took 3424.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.0 MB). Peak memory consumption was 120.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:25,919 INFO L168 Benchmark]: Witness Printer took 179.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:25,921 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.14 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 141.46 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.31 ms. Allocated memory is still 1.0 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.95 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 147.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3424.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.0 MB). Peak memory consumption was 120.9 MB. Max. memory is 11.5 GB. * Witness Printer took 179.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.7 MB). Peak memory consumption was 4.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)=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; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 3.3s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 2 SDslu, 2840 SDs, 0 SdLazy, 1200 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 518 GetRequests, 380 SyntacticMatches, 9 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=10, 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 860 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 137208 SizeOfPredicates, 9 NumberOfNonLiveVariables, 810 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 900/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...