./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/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 eda42c9201fdedd9f50669e53ef2af5b1d7cb675 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:14:49,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:14:49,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:14:49,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:14:49,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:14:49,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:14:49,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:14:49,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:14:49,267 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:14:49,268 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:14:49,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:14:49,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:14:49,269 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:14:49,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:14:49,270 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:14:49,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:14:49,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:14:49,272 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:14:49,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:14:49,274 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:14:49,275 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:14:49,276 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:14:49,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:14:49,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:14:49,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:14:49,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:14:49,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:14:49,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:14:49,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:14:49,282 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:14:49,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:14:49,283 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:14:49,283 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:14:49,283 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:14:49,284 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:14:49,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:14:49,285 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 05:14:49,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:14:49,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:14:49,296 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:14:49,296 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:14:49,296 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:14:49,296 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:14:49,297 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:14:49,297 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:14:49,297 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:14:49,297 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:14:49,297 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:14:49,297 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:14:49,297 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:14:49,297 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:14:49,298 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:14:49,298 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:14:49,298 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:14:49,298 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:14:49,298 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:14:49,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:14:49,298 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:14:49,298 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:14:49,298 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:14:49,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:14:49,299 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:14:49,299 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:14:49,299 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:14:49,299 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:14:49,299 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:14:49,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:14:49,299 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_960c1796-9f82-4e54-ae0d-a968dd9514ba/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 -> eda42c9201fdedd9f50669e53ef2af5b1d7cb675 [2018-11-23 05:14:49,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:14:49,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:14:49,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:14:49,333 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:14:49,334 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:14:49,334 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-23 05:14:49,373 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/data/0728bc968/703cbbaea48e498fb8b2079d114b68a5/FLAG42c08323e [2018-11-23 05:14:49,675 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:14:49,675 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-23 05:14:49,680 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/data/0728bc968/703cbbaea48e498fb8b2079d114b68a5/FLAG42c08323e [2018-11-23 05:14:49,690 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/data/0728bc968/703cbbaea48e498fb8b2079d114b68a5 [2018-11-23 05:14:49,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:14:49,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:14:49,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:14:49,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:14:49,697 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:14:49,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49, skipping insertion in model container [2018-11-23 05:14:49,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:14:49,718 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:14:49,831 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:14:49,833 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:14:49,848 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:14:49,860 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:14:49,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49 WrapperNode [2018-11-23 05:14:49,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:14:49,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:14:49,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:14:49,861 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:14:49,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:14:49,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:14:49,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:14:49,879 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:14:49,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (1/1) ... [2018-11-23 05:14:49,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:14:49,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:14:49,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:14:49,932 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:14:49,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:14:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:14:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:14:49,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:14:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:14:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:14:49,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:14:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:14:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:14:49,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:14:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:14:49,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:14:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:14:50,087 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:14:50,088 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 05:14:50,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:14:50 BoogieIcfgContainer [2018-11-23 05:14:50,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:14:50,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:14:50,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:14:50,091 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:14:50,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:14:49" (1/3) ... [2018-11-23 05:14:50,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fcc6acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:14:50, skipping insertion in model container [2018-11-23 05:14:50,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:49" (2/3) ... [2018-11-23 05:14:50,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fcc6acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:14:50, skipping insertion in model container [2018-11-23 05:14:50,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:14:50" (3/3) ... [2018-11-23 05:14:50,094 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-23 05:14:50,101 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:14:50,107 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:14:50,119 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:14:50,142 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:14:50,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:14:50,143 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:14:50,143 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:14:50,143 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:14:50,143 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:14:50,144 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:14:50,144 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:14:50,144 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:14:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 05:14:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:14:50,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:50,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:50,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:50,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1522547275, now seen corresponding path program 1 times [2018-11-23 05:14:50,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:50,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:50,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:50,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:50,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:14:50,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:14:50,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:14:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:14:50,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:14:50,267 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 05:14:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:50,280 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 05:14:50,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:14:50,281 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 05:14:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:50,285 INFO L225 Difference]: With dead ends: 36 [2018-11-23 05:14:50,285 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 05:14:50,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:14:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 05:14:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 05:14:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 05:14:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 05:14:50,313 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-11-23 05:14:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:50,313 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 05:14:50,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:14:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 05:14:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:14:50,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:50,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:50,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:50,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:50,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1742365231, now seen corresponding path program 1 times [2018-11-23 05:14:50,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:50,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:50,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:50,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:50,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:14:50,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:14:50,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:14:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:14:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:14:50,365 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-23 05:14:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:50,382 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 05:14:50,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:14:50,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 05:14:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:50,383 INFO L225 Difference]: With dead ends: 26 [2018-11-23 05:14:50,384 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 05:14:50,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:14:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 05:14:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-11-23 05:14:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 05:14:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 05:14:50,387 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2018-11-23 05:14:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:50,387 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 05:14:50,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:14:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 05:14:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 05:14:50,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:50,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:50,388 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:50,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:50,388 INFO L82 PathProgramCache]: Analyzing trace with hash 351378381, now seen corresponding path program 1 times [2018-11-23 05:14:50,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:50,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:50,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:50,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:50,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:50,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:50,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:50,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:50,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:50,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 05:14:50,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:14:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:14:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:14:50,509 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 5 states. [2018-11-23 05:14:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:50,538 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 05:14:50,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:14:50,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 05:14:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:50,539 INFO L225 Difference]: With dead ends: 28 [2018-11-23 05:14:50,539 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 05:14:50,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:14:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 05:14:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-11-23 05:14:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 05:14:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 05:14:50,543 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-11-23 05:14:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:50,544 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 05:14:50,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:14:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 05:14:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:14:50,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:50,544 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:50,545 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:50,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash -652155413, now seen corresponding path program 2 times [2018-11-23 05:14:50,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:50,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:50,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:50,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:50,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:50,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:50,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:14:50,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 05:14:50,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:14:50,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 05:14:50,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:14:50,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-23 05:14:50,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:14:50,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:14:50,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:14:50,728 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2018-11-23 05:14:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:50,805 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 05:14:50,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:14:50,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 05:14:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:50,806 INFO L225 Difference]: With dead ends: 34 [2018-11-23 05:14:50,806 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 05:14:50,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:14:50,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 05:14:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 05:14:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 05:14:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 05:14:50,811 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2018-11-23 05:14:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:50,812 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 05:14:50,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:14:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 05:14:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:14:50,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:50,812 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:50,813 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:50,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:50,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2123854327, now seen corresponding path program 1 times [2018-11-23 05:14:50,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:50,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:50,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:50,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:14:50,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:50,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:50,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:50,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:14:50,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:50,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 05:14:50,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:14:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:14:50,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:14:50,945 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2018-11-23 05:14:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:50,972 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 05:14:50,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:14:50,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 05:14:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:50,973 INFO L225 Difference]: With dead ends: 34 [2018-11-23 05:14:50,973 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 05:14:50,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:14:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 05:14:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 05:14:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 05:14:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 05:14:50,977 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2018-11-23 05:14:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:50,977 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 05:14:50,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:14:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 05:14:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 05:14:50,978 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:50,978 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:50,978 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:50,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:50,979 INFO L82 PathProgramCache]: Analyzing trace with hash -428652121, now seen corresponding path program 2 times [2018-11-23 05:14:50,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:50,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:50,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:50,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:14:51,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:51,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:51,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:14:51,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:14:51,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:14:51,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:14:51,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:51,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 05:14:51,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:14:51,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:14:51,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:14:51,094 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-11-23 05:14:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:51,122 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 05:14:51,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:14:51,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 05:14:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:51,123 INFO L225 Difference]: With dead ends: 36 [2018-11-23 05:14:51,123 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 05:14:51,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:14:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 05:14:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 05:14:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 05:14:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 05:14:51,127 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2018-11-23 05:14:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:51,127 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 05:14:51,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:14:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 05:14:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:14:51,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:51,128 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:51,129 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:51,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash 868062661, now seen corresponding path program 3 times [2018-11-23 05:14:51,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:51,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:51,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:51,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:51,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:14:51,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:51,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:51,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:14:51,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 05:14:51,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:14:51,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 05:14:51,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:51,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-11-23 05:14:51,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:14:51,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:14:51,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:14:51,447 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 12 states. [2018-11-23 05:14:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:51,827 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 05:14:51,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:14:51,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 05:14:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:51,828 INFO L225 Difference]: With dead ends: 44 [2018-11-23 05:14:51,829 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 05:14:51,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:14:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 05:14:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 05:14:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 05:14:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 05:14:51,835 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2018-11-23 05:14:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:51,836 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 05:14:51,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:14:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 05:14:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 05:14:51,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:51,836 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:51,837 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:51,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:51,837 INFO L82 PathProgramCache]: Analyzing trace with hash -208022531, now seen corresponding path program 4 times [2018-11-23 05:14:51,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:51,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:51,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:51,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:51,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 05:14:51,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:51,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:51,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:14:51,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:14:51,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:14:51,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 05:14:51,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:51,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 05:14:51,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 05:14:51,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 05:14:51,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:14:51,985 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 11 states. [2018-11-23 05:14:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:52,023 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 05:14:52,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:14:52,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-23 05:14:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:52,025 INFO L225 Difference]: With dead ends: 44 [2018-11-23 05:14:52,026 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 05:14:52,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:14:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 05:14:52,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 05:14:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 05:14:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 05:14:52,031 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-11-23 05:14:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:52,031 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 05:14:52,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 05:14:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 05:14:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 05:14:52,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:52,032 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:52,032 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:52,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:52,033 INFO L82 PathProgramCache]: Analyzing trace with hash 80038431, now seen corresponding path program 5 times [2018-11-23 05:14:52,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:52,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:52,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 05:14:52,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:52,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:52,138 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:14:52,180 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 05:14:52,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:14:52,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 05:14:52,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:52,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 05:14:52,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:14:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:14:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:14:52,215 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 12 states. [2018-11-23 05:14:52,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:52,250 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 05:14:52,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:14:52,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-23 05:14:52,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:52,252 INFO L225 Difference]: With dead ends: 46 [2018-11-23 05:14:52,252 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 05:14:52,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:14:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 05:14:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 05:14:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 05:14:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 05:14:52,258 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-11-23 05:14:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:52,258 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 05:14:52,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:14:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 05:14:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:14:52,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:52,259 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:52,259 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:52,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2028715969, now seen corresponding path program 6 times [2018-11-23 05:14:52,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:52,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:52,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 05:14:52,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:52,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:52,357 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:14:52,412 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 05:14:52,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:14:52,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:53,238 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-11-23 05:14:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 05:14:55,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:55,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2018-11-23 05:14:55,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 05:14:55,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 05:14:55,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:14:55,619 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2018-11-23 05:14:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:59,760 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-23 05:14:59,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 05:14:59,760 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-11-23 05:14:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:59,761 INFO L225 Difference]: With dead ends: 55 [2018-11-23 05:14:59,761 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 05:14:59,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2018-11-23 05:14:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 05:14:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-23 05:14:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 05:14:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-23 05:14:59,765 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 34 [2018-11-23 05:14:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:59,765 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-23 05:14:59,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 05:14:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 05:14:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 05:14:59,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:59,766 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:59,766 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:59,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash 775785179, now seen corresponding path program 7 times [2018-11-23 05:14:59,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:59,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:59,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 05:14:59,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:59,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:59,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 05:14:59,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:59,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 05:14:59,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 05:14:59,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 05:14:59,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:14:59,907 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2018-11-23 05:14:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:59,942 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 05:14:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 05:14:59,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-23 05:14:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:14:59,943 INFO L225 Difference]: With dead ends: 51 [2018-11-23 05:14:59,943 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 05:14:59,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:14:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 05:14:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 05:14:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 05:14:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 05:14:59,948 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2018-11-23 05:14:59,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:14:59,948 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 05:14:59,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 05:14:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 05:14:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 05:14:59,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:14:59,949 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:59,949 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:14:59,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:59,949 INFO L82 PathProgramCache]: Analyzing trace with hash 491342457, now seen corresponding path program 8 times [2018-11-23 05:14:59,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:59,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:59,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:59,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:59,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 05:15:00,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:15:00,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:15:00,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:15:12,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:15:12,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-23 05:15:12,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:15:12,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 05:15:12,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:15:12,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:15:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:15:12,290 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2018-11-23 05:15:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:15:12,328 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 05:15:12,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:15:12,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-23 05:15:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:15:12,329 INFO L225 Difference]: With dead ends: 46 [2018-11-23 05:15:12,329 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 05:15:12,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:15:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 05:15:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 05:15:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 05:15:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 05:15:12,337 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-11-23 05:15:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:15:12,337 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 05:15:12,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:15:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 05:15:12,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 05:15:12,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:15:12,338 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:15:12,338 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:15:12,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:15:12,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1912715259, now seen corresponding path program 9 times [2018-11-23 05:15:12,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:15:12,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:15:12,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:15:12,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:15:12,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:15:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 05:15:12,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:15:12,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:15:12,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:17:04,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 05:17:04,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-23 05:17:05,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:17:05,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 05:17:05,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 05:17:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:17:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:17:05,369 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 10 states. [2018-11-23 05:17:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:05,440 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 05:17:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:17:05,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-11-23 05:17:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:17:05,441 INFO L225 Difference]: With dead ends: 47 [2018-11-23 05:17:05,441 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 05:17:05,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:17:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 05:17:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 05:17:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 05:17:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 05:17:05,448 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-11-23 05:17:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:17:05,448 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 05:17:05,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 05:17:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 05:17:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 05:17:05,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:17:05,461 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:05,461 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:17:05,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:05,461 INFO L82 PathProgramCache]: Analyzing trace with hash 870906873, now seen corresponding path program 10 times [2018-11-23 05:17:05,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:05,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:05,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:05,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:05,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 05:17:05,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:17:05,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:17:05,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:17:17,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:17:17,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-23 05:17:18,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:17:18,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 05:17:18,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 05:17:18,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 05:17:18,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:17:18,102 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 11 states. [2018-11-23 05:17:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:18,168 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 05:17:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:17:18,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-23 05:17:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:17:18,169 INFO L225 Difference]: With dead ends: 48 [2018-11-23 05:17:18,169 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 05:17:18,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:17:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 05:17:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 05:17:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 05:17:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 05:17:18,176 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-11-23 05:17:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:17:18,176 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 05:17:18,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 05:17:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 05:17:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 05:17:18,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:17:18,179 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:18,180 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:17:18,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1263847045, now seen corresponding path program 11 times [2018-11-23 05:17:18,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:18,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:18,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:18,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:24,643 WARN L180 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 48 DAG size of output: 13 [2018-11-23 05:17:39,165 WARN L180 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 62 DAG size of output: 14 [2018-11-23 05:17:45,483 WARN L180 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 50 DAG size of output: 13 [2018-11-23 05:17:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 26 refuted. 2 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 05:17:45,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:17:45,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:17:45,573 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:18:31,218 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 05:18:31,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-23 05:18:32,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:18:32,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 05:18:32,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:18:32,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:18:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=93, Unknown=5, NotChecked=0, Total=132 [2018-11-23 05:18:32,478 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 12 states. [2018-11-23 05:18:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:18:32,604 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 05:18:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:18:32,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-23 05:18:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:18:32,605 INFO L225 Difference]: With dead ends: 49 [2018-11-23 05:18:32,605 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 05:18:32,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=78, Invalid=189, Unknown=5, NotChecked=0, Total=272 [2018-11-23 05:18:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 05:18:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 05:18:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 05:18:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-23 05:18:32,612 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-11-23 05:18:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:18:32,612 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-23 05:18:32,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:18:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 05:18:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 05:18:32,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:18:32,613 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:18:32,613 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:18:32,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:18:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash 560090489, now seen corresponding path program 12 times [2018-11-23 05:18:32,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:18:32,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:18:32,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:18:32,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:18:32,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:18:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 05:18:32,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:18:32,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:18:32,757 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:19:22,699 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-11-23 05:19:22,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-23 05:19:23,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:19:23,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-23 05:19:23,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 05:19:23,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 05:19:23,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:19:23,929 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 13 states. [2018-11-23 05:19:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:19:23,992 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 05:19:23,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 05:19:23,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 05:19:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:19:23,993 INFO L225 Difference]: With dead ends: 50 [2018-11-23 05:19:23,993 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 05:19:23,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:19:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 05:19:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 05:19:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 05:19:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 05:19:24,002 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2018-11-23 05:19:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:19:24,003 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 05:19:24,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 05:19:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 05:19:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 05:19:24,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:19:24,004 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:19:24,004 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:19:24,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:19:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash 218473733, now seen corresponding path program 13 times [2018-11-23 05:19:24,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:19:24,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:19:24,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:19:24,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:19:24,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:19:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:19:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 05:19:26,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:19:26,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:19:26,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:19:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 05:19:38,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:19:38,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-23 05:19:38,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 05:19:38,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 05:19:38,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=118, Unknown=1, NotChecked=0, Total=182 [2018-11-23 05:19:38,362 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 14 states. [2018-11-23 05:19:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:19:38,481 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 05:19:38,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 05:19:38,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-23 05:19:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:19:38,481 INFO L225 Difference]: With dead ends: 51 [2018-11-23 05:19:38,481 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 05:19:38,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=91, Invalid=180, Unknown=1, NotChecked=0, Total=272 [2018-11-23 05:19:38,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 05:19:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 05:19:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 05:19:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-23 05:19:38,489 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-11-23 05:19:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:19:38,490 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-23 05:19:38,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 05:19:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 05:19:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 05:19:38,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:19:38,490 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:19:38,491 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:19:38,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:19:38,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1781711111, now seen corresponding path program 14 times [2018-11-23 05:19:38,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:19:38,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:19:38,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:19:38,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:19:38,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:19:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:19:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:19:38,938 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=3828489497, |#NULL.offset|=3828489495, |old(#NULL.base)|=3828489497, |old(#NULL.offset)|=3828489495] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=3828489497, |old(#NULL.offset)|=3828489495] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=3828489497, |old(#NULL.offset)|=3828489495] [?] RET #47#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#in~0.base, ~#in~0.offset := #Ultimate.alloc(11);havoc ~s~0.base, ~s~0.offset;havoc ~c~0;havoc ~i~0;havoc ~j~0;havoc ~idx_in~0;~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !(~i~0 < 11); VAL [main_~i~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] call write~int(0, ~#in~0.base, 10 + ~#in~0.offset, 1);~idx_in~0 := 0;~s~0.base, ~s~0.offset := ~#in~0.base, ~#in~0.offset;~i~0 := 0;call #t~mem2 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem2;havoc #t~mem2; VAL [main_~c~0=56, main_~idx_in~0=0, main_~i~0=0, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=49, main_~idx_in~0=1, main_~i~0=8, main_~j~0=8, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=50, main_~idx_in~0=2, main_~i~0=81, main_~j~0=1, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=51, main_~idx_in~0=3, main_~i~0=812, main_~j~0=2, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=52, main_~idx_in~0=4, main_~i~0=8123, main_~j~0=3, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=53, main_~idx_in~0=5, main_~i~0=81234, main_~j~0=4, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=54, main_~idx_in~0=6, main_~i~0=812345, main_~j~0=5, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=55, main_~idx_in~0=7, main_~i~0=8123456, main_~j~0=6, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=57, main_~idx_in~0=8, main_~i~0=81234567, main_~j~0=7, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=48, main_~idx_in~0=9, main_~i~0=812345679, main_~j~0=9, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=0, main_~idx_in~0=10, main_~i~0=(- 466477802), main_~j~0=0, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); VAL [main_~c~0=0, main_~idx_in~0=10, main_~i~0=(- 466477802), main_~j~0=0, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=3828489497, #NULL.offset=3828489495, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] call ~#in~0.base, ~#in~0.offset := #Ultimate.alloc(11); [L15] havoc ~s~0.base, ~s~0.offset; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=0] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=1] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=2] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=3] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=4] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=5] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=6] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=7] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=8] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=9] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=10] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=11] [L19-L20] assume !(~i~0 < 11); VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=11] [L21] call write~int(0, ~#in~0.base, 10 + ~#in~0.offset, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0.base, ~s~0.offset := ~#in~0.base, ~#in~0.offset; [L24] ~i~0 := 0; [L25] call #t~mem2 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L6-L8] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=3828489497, #NULL.offset=3828489495, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] call ~#in~0.base, ~#in~0.offset := #Ultimate.alloc(11); [L15] havoc ~s~0.base, ~s~0.offset; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=0] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=1] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=2] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=3] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=4] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=5] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=6] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=7] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=8] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=9] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=10] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=11] [L19-L20] assume !(~i~0 < 11); VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=11] [L21] call write~int(0, ~#in~0.base, 10 + ~#in~0.offset, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0.base, ~s~0.offset := ~#in~0.base, ~#in~0.offset; [L24] ~i~0 := 0; [L25] call #t~mem2 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L6-L8] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3828489497, #NULL!offset=3828489495, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call ~#in~0 := #Ultimate.alloc(11); [L15] havoc ~s~0; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L19-L20] COND TRUE !(~i~0 < 11) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L21] FCALL call write~int(0, { base: ~#in~0!base, offset: 10 + ~#in~0!offset }, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0 := ~#in~0; [L24] ~i~0 := 0; [L25] FCALL call #t~mem2 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND TRUE !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3828489497, #NULL!offset=3828489495, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call ~#in~0 := #Ultimate.alloc(11); [L15] havoc ~s~0; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L19-L20] COND TRUE !(~i~0 < 11) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L21] FCALL call write~int(0, { base: ~#in~0!base, offset: 10 + ~#in~0!offset }, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0 := ~#in~0; [L24] ~i~0 := 0; [L25] FCALL call #t~mem2 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND TRUE !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3828489497, #NULL!offset=3828489495, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call ~#in~0 := #Ultimate.alloc(11); [L15] havoc ~s~0; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L19-L20] COND TRUE !(~i~0 < 11) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L21] FCALL call write~int(0, { base: ~#in~0!base, offset: 10 + ~#in~0!offset }, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0 := ~#in~0; [L24] ~i~0 := 0; [L25] FCALL call #t~mem2 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND TRUE !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3828489497, #NULL!offset=3828489495, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call ~#in~0 := #Ultimate.alloc(11); [L15] havoc ~s~0; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L19-L20] COND TRUE !(~i~0 < 11) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L21] FCALL call write~int(0, { base: ~#in~0!base, offset: 10 + ~#in~0!offset }, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0 := ~#in~0; [L24] ~i~0 := 0; [L25] FCALL call #t~mem2 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND TRUE !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L14] char in[11]; [L15] char *s; [L16] unsigned char c; [L17] int i, j; [L18] int idx_in; [L19] i = 0 VAL [i=0, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=1, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=2, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=3, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=4, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=5, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=6, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=7, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=8, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=9, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=10, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=11, in={3828489496:0}] [L19] COND FALSE !(i < 11) VAL [i=11, in={3828489496:0}] [L21] in[10] = 0 [L22] idx_in = 0 [L23] s = in [L24] i = 0 [L25] EXPR in[idx_in] [L25] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND FALSE !(('0' <= c) && (c <= '9')) VAL [c=0, i=-466477802, idx_in=10, in={3828489496:0}, j=0, s={3828489496:0}] [L34] CALL __VERIFIER_assert (i >= 0) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 05:19:39,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:19:39 BoogieIcfgContainer [2018-11-23 05:19:39,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:19:39,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:19:39,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:19:39,191 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:19:39,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:14:50" (3/4) ... [2018-11-23 05:19:39,193 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=3828489497, |#NULL.offset|=3828489495, |old(#NULL.base)|=3828489497, |old(#NULL.offset)|=3828489495] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=3828489497, |old(#NULL.offset)|=3828489495] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=3828489497, |old(#NULL.offset)|=3828489495] [?] RET #47#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#in~0.base, ~#in~0.offset := #Ultimate.alloc(11);havoc ~s~0.base, ~s~0.offset;havoc ~c~0;havoc ~i~0;havoc ~j~0;havoc ~idx_in~0;~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(~i~0 < 11);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1);havoc #t~nondet1; VAL [main_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !(~i~0 < 11); VAL [main_~i~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] call write~int(0, ~#in~0.base, 10 + ~#in~0.offset, 1);~idx_in~0 := 0;~s~0.base, ~s~0.offset := ~#in~0.base, ~#in~0.offset;~i~0 := 0;call #t~mem2 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem2;havoc #t~mem2; VAL [main_~c~0=56, main_~idx_in~0=0, main_~i~0=0, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=49, main_~idx_in~0=1, main_~i~0=8, main_~j~0=8, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=50, main_~idx_in~0=2, main_~i~0=81, main_~j~0=1, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=51, main_~idx_in~0=3, main_~i~0=812, main_~j~0=2, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=52, main_~idx_in~0=4, main_~i~0=8123, main_~j~0=3, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=53, main_~idx_in~0=5, main_~i~0=81234, main_~j~0=4, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=54, main_~idx_in~0=6, main_~i~0=812345, main_~j~0=5, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=55, main_~idx_in~0=7, main_~i~0=8123456, main_~j~0=6, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=57, main_~idx_in~0=8, main_~i~0=81234567, main_~j~0=7, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=48, main_~idx_in~0=9, main_~i~0=812345679, main_~j~0=9, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57);~j~0 := ~c~0 % 256 - 48;~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296);#t~post3 := ~idx_in~0;~idx_in~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1);~c~0 := #t~mem4;havoc #t~mem4; VAL [main_~c~0=0, main_~idx_in~0=10, main_~i~0=(- 466477802), main_~j~0=0, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] assume !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); VAL [main_~c~0=0, main_~idx_in~0=10, main_~i~0=(- 466477802), main_~j~0=0, main_~s~0.base=3828489496, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#in~0.base|=3828489496, |main_~#in~0.offset|=0] [?] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=3828489497, #NULL.offset=3828489495, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] call ~#in~0.base, ~#in~0.offset := #Ultimate.alloc(11); [L15] havoc ~s~0.base, ~s~0.offset; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=0] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=1] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=2] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=3] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=4] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=5] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=6] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=7] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=8] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=9] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=10] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=11] [L19-L20] assume !(~i~0 < 11); VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=11] [L21] call write~int(0, ~#in~0.base, 10 + ~#in~0.offset, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0.base, ~s~0.offset := ~#in~0.base, ~#in~0.offset; [L24] ~i~0 := 0; [L25] call #t~mem2 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L6-L8] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=3828489497, #NULL.offset=3828489495, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3828489497, old(#NULL.offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] call ~#in~0.base, ~#in~0.offset := #Ultimate.alloc(11); [L15] havoc ~s~0.base, ~s~0.offset; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=0] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=1] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=2] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=3] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=4] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=5] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=6] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=7] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=8] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=9] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=10] [L19-L20] assume !!(~i~0 < 11); [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] call write~int(#t~nondet1, ~#in~0.base, ~#in~0.offset + ~i~0, 1); [L20] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=11] [L19-L20] assume !(~i~0 < 11); VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~i~0=11] [L21] call write~int(0, ~#in~0.base, 10 + ~#in~0.offset, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0.base, ~s~0.offset := ~#in~0.base, ~#in~0.offset; [L24] ~i~0 := 0; [L25] call #t~mem2 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] call #t~mem4 := read~int(~#in~0.base, ~#in~0.offset + ~idx_in~0, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L26-L32] assume !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57); VAL [#NULL.base=0, #NULL.offset=0, ~#in~0.base=3828489496, ~#in~0.offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0.base=3828489496, ~s~0.offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L6-L8] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3828489497, #NULL!offset=3828489495, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call ~#in~0 := #Ultimate.alloc(11); [L15] havoc ~s~0; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L19-L20] COND TRUE !(~i~0 < 11) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L21] FCALL call write~int(0, { base: ~#in~0!base, offset: 10 + ~#in~0!offset }, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0 := ~#in~0; [L24] ~i~0 := 0; [L25] FCALL call #t~mem2 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND TRUE !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3828489497, #NULL!offset=3828489495, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call ~#in~0 := #Ultimate.alloc(11); [L15] havoc ~s~0; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L19-L20] COND TRUE !(~i~0 < 11) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L21] FCALL call write~int(0, { base: ~#in~0!base, offset: 10 + ~#in~0!offset }, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0 := ~#in~0; [L24] ~i~0 := 0; [L25] FCALL call #t~mem2 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND TRUE !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3828489497, #NULL!offset=3828489495, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call ~#in~0 := #Ultimate.alloc(11); [L15] havoc ~s~0; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L19-L20] COND TRUE !(~i~0 < 11) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L21] FCALL call write~int(0, { base: ~#in~0!base, offset: 10 + ~#in~0!offset }, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0 := ~#in~0; [L24] ~i~0 := 0; [L25] FCALL call #t~mem2 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND TRUE !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3828489497, #NULL!offset=3828489495, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3828489497, old(#NULL!offset)=3828489495] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call ~#in~0 := #Ultimate.alloc(11); [L15] havoc ~s~0; [L16] havoc ~c~0; [L17] havoc ~i~0; [L17] havoc ~j~0; [L18] havoc ~idx_in~0; [L19] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=0] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=1] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=2] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=3] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=4] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=5] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=6] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=7] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=8] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=9] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19-L20] COND FALSE !(!(~i~0 < 11)) [L20] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L20] FCALL call write~int(#t~nondet1, { base: ~#in~0!base, offset: ~#in~0!offset + ~i~0 }, 1); [L20] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=10] [L19] #t~post0 := ~i~0; [L19] ~i~0 := 1 + #t~post0; [L19] havoc #t~post0; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L19-L20] COND TRUE !(~i~0 < 11) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~i~0=11] [L21] FCALL call write~int(0, { base: ~#in~0!base, offset: 10 + ~#in~0!offset }, 1); [L22] ~idx_in~0 := 0; [L23] ~s~0 := ~#in~0; [L24] ~i~0 := 0; [L25] FCALL call #t~mem2 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L25] ~c~0 := #t~mem2; [L25] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=56, ~idx_in~0=0, ~i~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=49, ~idx_in~0=1, ~i~0=8, ~j~0=8, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=50, ~idx_in~0=2, ~i~0=81, ~j~0=1, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=51, ~idx_in~0=3, ~i~0=812, ~j~0=2, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=52, ~idx_in~0=4, ~i~0=8123, ~j~0=3, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=53, ~idx_in~0=5, ~i~0=81234, ~j~0=4, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=54, ~idx_in~0=6, ~i~0=812345, ~j~0=5, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=55, ~idx_in~0=7, ~i~0=8123456, ~j~0=6, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=57, ~idx_in~0=8, ~i~0=81234567, ~j~0=7, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=48, ~idx_in~0=9, ~i~0=812345679, ~j~0=9, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND FALSE !(!(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57)) [L28] ~j~0 := ~c~0 % 256 - 48; [L29] ~i~0 := (if (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 else (10 * ~i~0 + ~j~0) % 4294967296 % 4294967296 - 4294967296); [L30] #t~post3 := ~idx_in~0; [L30] ~idx_in~0 := 1 + #t~post3; [L30] havoc #t~post3; [L31] FCALL call #t~mem4 := read~int({ base: ~#in~0!base, offset: ~#in~0!offset + ~idx_in~0 }, 1); [L31] ~c~0 := #t~mem4; [L31] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L26-L32] COND TRUE !(48 <= ~c~0 % 256 && ~c~0 % 256 <= 57) VAL [#NULL!base=0, #NULL!offset=0, ~#in~0!base=3828489496, ~#in~0!offset=0, ~c~0=0, ~idx_in~0=10, ~i~0=-466477802, ~j~0=0, ~s~0!base=3828489496, ~s~0!offset=0] [L34] CALL call __VERIFIER_assert((if ~i~0 >= 0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L14] char in[11]; [L15] char *s; [L16] unsigned char c; [L17] int i, j; [L18] int idx_in; [L19] i = 0 VAL [i=0, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=1, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=2, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=3, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=4, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=5, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=6, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=7, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=8, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=9, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=10, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=11, in={3828489496:0}] [L19] COND FALSE !(i < 11) VAL [i=11, in={3828489496:0}] [L21] in[10] = 0 [L22] idx_in = 0 [L23] s = in [L24] i = 0 [L25] EXPR in[idx_in] [L25] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND FALSE !(('0' <= c) && (c <= '9')) VAL [c=0, i=-466477802, idx_in=10, in={3828489496:0}, j=0, s={3828489496:0}] [L34] CALL __VERIFIER_assert (i >= 0) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 05:19:39,771 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_960c1796-9f82-4e54-ae0d-a968dd9514ba/bin-2019/uautomizer/witness.graphml [2018-11-23 05:19:39,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:19:39,772 INFO L168 Benchmark]: Toolchain (without parser) took 290079.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -249.2 MB). Peak memory consumption was 408.0 kB. Max. memory is 11.5 GB. [2018-11-23 05:19:39,773 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:19:39,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.81 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:39,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.01 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:39,774 INFO L168 Benchmark]: Boogie Preprocessor took 52.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -219.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:39,774 INFO L168 Benchmark]: RCFGBuilder took 156.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:39,774 INFO L168 Benchmark]: TraceAbstraction took 289101.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.5 MB). Peak memory consumption was 372.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:39,775 INFO L168 Benchmark]: Witness Printer took 581.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:39,777 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.81 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 17.01 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -219.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 156.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 289101.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.5 MB). Peak memory consumption was 372.6 MB. Max. memory is 11.5 GB. * Witness Printer took 581.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] char in[11]; [L15] char *s; [L16] unsigned char c; [L17] int i, j; [L18] int idx_in; [L19] i = 0 VAL [i=0, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=1, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=2, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=3, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=4, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=5, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=6, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=7, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=8, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=9, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=10, in={3828489496:0}] [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ VAL [i=11, in={3828489496:0}] [L19] COND FALSE !(i < 11) VAL [i=11, in={3828489496:0}] [L21] in[10] = 0 [L22] idx_in = 0 [L23] s = in [L24] i = 0 [L25] EXPR in[idx_in] [L25] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND FALSE !(('0' <= c) && (c <= '9')) VAL [c=0, i=-466477802, idx_in=10, in={3828489496:0}, j=0, s={3828489496:0}] [L34] CALL __VERIFIER_assert (i >= 0) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. UNSAFE Result, 289.0s OverallTime, 18 OverallIterations, 11 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 213 SDtfs, 133 SDslu, 1007 SDs, 0 SdLazy, 557 SolverSat, 120 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 33.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=17, 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, 17 MinimizatonAttempts, 16 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 244.2s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 1037 NumberOfCodeBlocks, 1015 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 717 ConstructedInterpolants, 7 QuantifiedInterpolants, 62076 SizeOfPredicates, 17 NumberOfNonLiveVariables, 940 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 901/1653 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...