./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:47:57,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:47:57,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:47:57,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:47:57,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:47:57,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:47:57,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:47:57,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:47:57,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:47:57,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:47:57,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:47:57,277 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:47:57,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:47:57,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:47:57,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:47:57,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:47:57,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:47:57,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:47:57,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:47:57,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:47:57,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:47:57,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:47:57,286 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:47:57,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:47:57,286 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:47:57,287 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:47:57,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:47:57,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:47:57,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:47:57,289 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:47:57,289 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:47:57,290 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:47:57,290 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:47:57,290 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:47:57,291 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:47:57,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:47:57,291 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 00:47:57,301 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:47:57,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:47:57,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:47:57,302 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:47:57,303 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:47:57,303 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:47:57,303 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:47:57,303 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:47:57,303 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:47:57,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:47:57,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:47:57,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:47:57,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:47:57,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:47:57,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:47:57,304 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:47:57,304 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:47:57,305 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:47:57,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:47:57,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:47:57,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:47:57,305 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:47:57,305 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:47:57,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:47:57,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:47:57,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:47:57,306 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:47:57,306 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:47:57,306 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:47:57,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:47:57,306 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_b16aa179-7da8-4b45-be57-a84503fafe99/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 -> ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 [2018-11-23 00:47:57,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:47:57,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:47:57,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:47:57,343 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:47:57,343 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:47:57,344 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-23 00:47:57,389 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/data/dc4714689/7213cae6b848434cb900b4310c182a4a/FLAGa04f42bb3 [2018-11-23 00:47:57,791 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:47:57,791 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-23 00:47:57,795 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/data/dc4714689/7213cae6b848434cb900b4310c182a4a/FLAGa04f42bb3 [2018-11-23 00:47:57,805 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/data/dc4714689/7213cae6b848434cb900b4310c182a4a [2018-11-23 00:47:57,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:47:57,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:47:57,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:47:57,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:47:57,811 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:47:57,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:57,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d767ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57, skipping insertion in model container [2018-11-23 00:47:57,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:57,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:47:57,834 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:47:57,950 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:47:57,955 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:47:57,967 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:47:57,976 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:47:57,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57 WrapperNode [2018-11-23 00:47:57,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:47:57,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:47:57,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:47:57,977 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:47:57,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:57,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:57,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:47:57,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:47:57,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:47:57,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:47:58,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:58,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:58,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:58,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:58,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:58,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:58,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (1/1) ... [2018-11-23 00:47:58,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:47:58,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:47:58,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:47:58,050 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:47:58,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:47:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:47:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 00:47:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:47:58,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:47:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:47:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:47:58,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:47:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:47:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:47:58,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:47:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 00:47:58,086 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 00:47:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 00:47:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:47:58,226 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:47:58,226 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 00:47:58,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:47:58 BoogieIcfgContainer [2018-11-23 00:47:58,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:47:58,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:47:58,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:47:58,228 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:47:58,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:47:57" (1/3) ... [2018-11-23 00:47:58,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52796d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:47:58, skipping insertion in model container [2018-11-23 00:47:58,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:47:57" (2/3) ... [2018-11-23 00:47:58,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52796d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:47:58, skipping insertion in model container [2018-11-23 00:47:58,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:47:58" (3/3) ... [2018-11-23 00:47:58,230 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_false-unreach-call_true-termination.c [2018-11-23 00:47:58,237 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:47:58,243 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:47:58,253 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:47:58,270 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:47:58,270 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:47:58,271 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:47:58,271 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:47:58,271 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:47:58,271 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:47:58,271 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:47:58,271 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:47:58,271 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:47:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 00:47:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 00:47:58,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:47:58,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:47:58,286 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:47:58,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:47:58,291 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-11-23 00:47:58,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:47:58,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:47:58,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:58,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:47:58,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:58,382 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 00:47:58,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:47:58,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:47:58,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:47:58,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:47:58,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:47:58,400 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 00:47:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:47:58,411 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 00:47:58,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:47:58,412 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 00:47:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:47:58,418 INFO L225 Difference]: With dead ends: 42 [2018-11-23 00:47:58,418 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 00:47:58,421 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 00:47:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 00:47:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 00:47:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 00:47:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 00:47:58,443 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 00:47:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:47:58,443 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 00:47:58,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:47:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 00:47:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:47:58,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:47:58,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:47:58,444 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:47:58,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:47:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-11-23 00:47:58,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:47:58,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:47:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:58,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:47:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:58,485 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 00:47:58,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:47:58,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:47:58,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:47:58,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:47:58,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:47:58,488 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-23 00:47:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:47:58,511 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 00:47:58,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:47:58,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 00:47:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:47:58,512 INFO L225 Difference]: With dead ends: 34 [2018-11-23 00:47:58,512 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 00:47:58,513 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 00:47:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 00:47:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 00:47:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 00:47:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 00:47:58,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-23 00:47:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:47:58,516 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 00:47:58,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:47:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 00:47:58,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 00:47:58,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:47:58,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:47:58,517 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:47:58,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:47:58,517 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-11-23 00:47:58,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:47:58,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:47:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:58,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:47:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:58,575 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 00:47:58,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:47:58,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:47:58,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:47:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:58,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:47:58,644 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 00:47:58,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:47:58,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 00:47:58,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:47:58,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:47:58,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:47:58,661 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-23 00:47:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:47:58,685 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 00:47:58,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:47:58,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 00:47:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:47:58,686 INFO L225 Difference]: With dead ends: 36 [2018-11-23 00:47:58,686 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 00:47:58,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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 00:47:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 00:47:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 00:47:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 00:47:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 00:47:58,689 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-23 00:47:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:47:58,690 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 00:47:58,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:47:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 00:47:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:47:58,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:47:58,690 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:47:58,691 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:47:58,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:47:58,691 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-11-23 00:47:58,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:47:58,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:47:58,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:58,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:47:58,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:58,743 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 00:47:58,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:47:58,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:47:58,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:47:58,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 00:47:58,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:47:58,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:47:58,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 00:47:58,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 00:47:58,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:47:58,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:47:58,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:47:58,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 00:47:58,853 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 00:47:58,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:47:58,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-23 00:47:58,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:47:58,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:47:58,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:47:58,869 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2018-11-23 00:47:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:47:58,932 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 00:47:58,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:47:58,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 00:47:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:47:58,934 INFO L225 Difference]: With dead ends: 40 [2018-11-23 00:47:58,934 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 00:47:58,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:47:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 00:47:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 00:47:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 00:47:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 00:47:58,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-11-23 00:47:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:47:58,938 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 00:47:58,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:47:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 00:47:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 00:47:58,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:47:58,939 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:47:58,942 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:47:58,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:47:58,943 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 1 times [2018-11-23 00:47:58,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:47:58,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:47:58,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:58,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:47:58,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 00:47:59,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:47:59,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:47:59,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:47:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:59,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:47:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 00:47:59,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:47:59,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 00:47:59,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:47:59,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:47:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:47:59,090 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-11-23 00:47:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:47:59,113 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 00:47:59,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:47:59,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 00:47:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:47:59,115 INFO L225 Difference]: With dead ends: 44 [2018-11-23 00:47:59,115 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 00:47:59,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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 00:47:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 00:47:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 00:47:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 00:47:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 00:47:59,119 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-23 00:47:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:47:59,120 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 00:47:59,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:47:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 00:47:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 00:47:59,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:47:59,121 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:47:59,121 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:47:59,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:47:59,121 INFO L82 PathProgramCache]: Analyzing trace with hash 619997966, now seen corresponding path program 2 times [2018-11-23 00:47:59,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:47:59,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:47:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:59,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:47:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 00:47:59,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:47:59,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:47:59,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:47:59,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:47:59,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:47:59,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:47:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 00:47:59,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:47:59,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 00:47:59,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:47:59,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:47:59,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:47:59,306 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 8 states. [2018-11-23 00:47:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:47:59,334 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 00:47:59,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:47:59,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 00:47:59,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:47:59,337 INFO L225 Difference]: With dead ends: 46 [2018-11-23 00:47:59,337 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 00:47:59,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 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 00:47:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 00:47:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 00:47:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 00:47:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 00:47:59,341 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-11-23 00:47:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:47:59,341 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 00:47:59,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:47:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 00:47:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 00:47:59,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:47:59,342 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:47:59,342 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:47:59,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:47:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash 814278768, now seen corresponding path program 3 times [2018-11-23 00:47:59,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:47:59,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:47:59,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:59,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:47:59,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 00:47:59,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:47:59,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:47:59,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:47:59,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 00:47:59,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:47:59,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:47:59,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 00:47:59,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 00:47:59,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:47:59,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:47:59,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:47:59,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 00:47:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 00:47:59,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:47:59,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 00:47:59,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:47:59,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:47:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:47:59,554 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-11-23 00:47:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:47:59,632 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-23 00:47:59,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 00:47:59,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-23 00:47:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:47:59,633 INFO L225 Difference]: With dead ends: 50 [2018-11-23 00:47:59,633 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 00:47:59,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:47:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 00:47:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 00:47:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 00:47:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 00:47:59,637 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-11-23 00:47:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:47:59,638 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 00:47:59,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:47:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 00:47:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 00:47:59,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:47:59,639 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:47:59,639 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:47:59,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:47:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1119042125, now seen corresponding path program 4 times [2018-11-23 00:47:59,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:47:59,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:47:59,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:59,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:47:59,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 00:47:59,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:47:59,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:47:59,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 00:47:59,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 00:47:59,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:47:59,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:47:59,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 00:47:59,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 00:47:59,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:47:59,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:47:59,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:47:59,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 00:47:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 00:47:59,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:47:59,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 00:47:59,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 00:47:59,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 00:47:59,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:47:59,829 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2018-11-23 00:47:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:47:59,904 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-23 00:47:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 00:47:59,905 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-23 00:47:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:47:59,905 INFO L225 Difference]: With dead ends: 56 [2018-11-23 00:47:59,906 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 00:47:59,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-23 00:47:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 00:47:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 00:47:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 00:47:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 00:47:59,909 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-11-23 00:47:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:47:59,910 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 00:47:59,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 00:47:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 00:47:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 00:47:59,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:47:59,910 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:47:59,911 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:47:59,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:47:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash -820541462, now seen corresponding path program 5 times [2018-11-23 00:47:59,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:47:59,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:47:59,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:59,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:47:59,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:47:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:47:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 00:47:59,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:47:59,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:48:00,005 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 00:48:02,850 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 00:48:02,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:48:02,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:48:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 00:48:02,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:48:02,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 00:48:02,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 00:48:02,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 00:48:02,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:48:02,882 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-11-23 00:48:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:48:02,912 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 00:48:02,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 00:48:02,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-23 00:48:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:48:02,913 INFO L225 Difference]: With dead ends: 60 [2018-11-23 00:48:02,913 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 00:48:02,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 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 00:48:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 00:48:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 00:48:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 00:48:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 00:48:02,916 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-11-23 00:48:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:48:02,917 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 00:48:02,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 00:48:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 00:48:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 00:48:02,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:48:02,918 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:48:02,918 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:48:02,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:48:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash 478163660, now seen corresponding path program 6 times [2018-11-23 00:48:02,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:48:02,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:48:02,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:48:02,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:48:02,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:48:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:48:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 00:48:03,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:48:03,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:48:03,022 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 00:48:03,608 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 00:48:03,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:48:03,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:48:03,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 00:48:03,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 00:48:03,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:48:03,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:48:03,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:48:03,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 00:48:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 00:48:03,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:48:03,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-11-23 00:48:03,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 00:48:03,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 00:48:03,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-11-23 00:48:03,693 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 17 states. [2018-11-23 00:48:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:48:03,776 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 00:48:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 00:48:03,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-23 00:48:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:48:03,777 INFO L225 Difference]: With dead ends: 64 [2018-11-23 00:48:03,777 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 00:48:03,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-11-23 00:48:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 00:48:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 00:48:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 00:48:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 00:48:03,781 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2018-11-23 00:48:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:48:03,781 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 00:48:03,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 00:48:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 00:48:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 00:48:03,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:48:03,782 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:48:03,782 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:48:03,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:48:03,782 INFO L82 PathProgramCache]: Analyzing trace with hash -956118231, now seen corresponding path program 7 times [2018-11-23 00:48:03,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:48:03,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:48:03,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:48:03,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:48:03,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:48:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:48:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 00:48:03,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:48:03,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:48:03,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:48:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:48:03,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:48:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 00:48:03,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:48:03,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 00:48:03,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 00:48:03,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 00:48:03,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 00:48:03,971 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 13 states. [2018-11-23 00:48:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:48:04,017 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 00:48:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:48:04,019 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-23 00:48:04,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:48:04,019 INFO L225 Difference]: With dead ends: 67 [2018-11-23 00:48:04,019 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 00:48:04,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 00:48:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 00:48:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 00:48:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 00:48:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-23 00:48:04,023 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-11-23 00:48:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:48:04,023 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-23 00:48:04,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 00:48:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 00:48:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 00:48:04,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:48:04,024 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:48:04,024 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:48:04,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:48:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash -50051957, now seen corresponding path program 8 times [2018-11-23 00:48:04,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:48:04,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:48:04,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:48:04,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:48:04,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:48:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:48:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-23 00:48:04,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:48:04,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:48:04,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:48:04,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:48:04,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:48:04,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:48:04,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 00:48:04,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-11-23 00:48:04,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:48:04,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:48:04,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:48:04,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-11-23 00:48:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:48:04,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:48:04,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 26 [2018-11-23 00:48:04,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 00:48:04,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 00:48:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2018-11-23 00:48:04,931 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 26 states. [2018-11-23 00:48:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:48:05,370 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 00:48:05,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 00:48:05,370 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-11-23 00:48:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:48:05,371 INFO L225 Difference]: With dead ends: 57 [2018-11-23 00:48:05,372 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 00:48:05,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 00:48:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 00:48:05,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 00:48:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 00:48:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 00:48:05,376 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-11-23 00:48:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:48:05,376 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 00:48:05,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 00:48:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 00:48:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 00:48:05,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:48:05,377 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:48:05,377 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:48:05,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:48:05,378 INFO L82 PathProgramCache]: Analyzing trace with hash -715849914, now seen corresponding path program 9 times [2018-11-23 00:48:05,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:48:05,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:48:05,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:48:05,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:48:05,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:48:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:48:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 00:48:05,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:48:05,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/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 00:48:05,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:48:06,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 00:48:06,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:48:06,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:48:06,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 00:48:06,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 00:48:06,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:48:06,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:48:06,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:48:06,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:12 [2018-11-23 00:48:06,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 00:48:06,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 00:48:06,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:48:06,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:48:06,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:48:06,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 00:48:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 00:48:06,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:48:06,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-11-23 00:48:06,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 00:48:06,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 00:48:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-11-23 00:48:06,580 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2018-11-23 00:48:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:48:06,787 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-11-23 00:48:06,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 00:48:06,787 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-11-23 00:48:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:48:06,788 INFO L225 Difference]: With dead ends: 67 [2018-11-23 00:48:06,788 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 00:48:06,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=493, Invalid=1229, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 00:48:06,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 00:48:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 00:48:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 00:48:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 00:48:06,795 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 48 [2018-11-23 00:48:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:48:06,795 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 00:48:06,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 00:48:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 00:48:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 00:48:06,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:48:06,796 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:48:06,797 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:48:06,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:48:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash -875693139, now seen corresponding path program 10 times [2018-11-23 00:48:06,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:48:06,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:48:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:48:06,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:48:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:48:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:48:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:48:06,992 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=111, |#NULL.offset|=107, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] RET #58#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret13 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; VAL [main_~i~0=6, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !(~j~0 < 10); VAL [main_~i~0=6, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [main_~i~0=6, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7.base|=106, |main_#t~mem7.offset|=48, |main_#t~mem8|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; VAL [main_~i~0=(- 9), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 9), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 8), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 8), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 7), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 7), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 6), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 6), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 5), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 5), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 4), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 4), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 3), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 3), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 2), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 2), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 1), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 1), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !(~i~0 < #t~mem10);havoc #t~mem10; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0] [?] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; VAL [check_~i=1, check_~pc.base=122, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0, |check_#res|=0] [?] assume true; VAL [check_~i=1, check_~pc.base=122, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0, |check_#res|=0] [?] RET #62#return; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume 0 == #t~ret12;havoc #t~ret12; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !false; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=111, #NULL.offset=107, old(#NULL.base)=111, old(#NULL.offset)=107] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L19] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L20] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0.base, ~pa~0.offset; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L24-L27] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L29-L41] assume ~i~0 >= 0 && ~i~0 < 9; [L30] call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4); [L31] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L31] ~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset; [L31] havoc #t~mem6.base, #t~mem6.offset; [L32] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L32] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7.base=106, #t~mem7.offset=48, #t~mem8=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L32-L40] assume #t~mem8 > 0; [L32] havoc #t~mem7.base, #t~mem7.offset; [L32] havoc #t~mem8; [L33] call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !(~i~0 < #t~mem10); [L34] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L12-L15] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L12-L15] ~i := #in~i; [L14] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L14] call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0.base, #t~mem0.offset; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L12-L15] ensures true; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L37] RET call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37-L39] assume 0 == #t~ret12; [L37] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L45] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=111, #NULL.offset=107, old(#NULL.base)=111, old(#NULL.offset)=107] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L19] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L20] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0.base, ~pa~0.offset; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L24-L27] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L29-L41] assume ~i~0 >= 0 && ~i~0 < 9; [L30] call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4); [L31] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L31] ~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset; [L31] havoc #t~mem6.base, #t~mem6.offset; [L32] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L32] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7.base=106, #t~mem7.offset=48, #t~mem8=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L32-L40] assume #t~mem8 > 0; [L32] havoc #t~mem7.base, #t~mem7.offset; [L32] havoc #t~mem8; [L33] call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !(~i~0 < #t~mem10); [L34] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L12-L15] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L12-L15] ~i := #in~i; [L14] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L14] call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0.base, #t~mem0.offset; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L12-L15] ensures true; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L37] RET call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37-L39] assume 0 == #t~ret12; [L37] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L45] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={106:0}, cont={122:0}, i=6, j=0] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=1] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=2] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=3] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=4] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=5] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=6] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=7] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=8] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=9] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=10] [L24] COND FALSE !(j < 10) VAL [array={106:0}, cont={122:0}, i=6, j=10] [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b VAL [array={106:0}, cont={122:0}, cont.array={106:48}, cont.array[0].b=1, i=6, j=10, pa={106:52}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-9, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=1, pc={122:0}] [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] RET, EXPR check(&cont, i) VAL [array={106:0}, check(&cont, i)=0, cont={122:0}, i=1, j=10, pa={106:52}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] ----- [2018-11-23 00:48:07,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:48:07 BoogieIcfgContainer [2018-11-23 00:48:07,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:48:07,278 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:48:07,278 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:48:07,279 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:48:07,279 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:47:58" (3/4) ... [2018-11-23 00:48:07,281 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|=111, |#NULL.offset|=107, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] RET #58#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret13 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; VAL [main_~i~0=6, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !(~j~0 < 10); VAL [main_~i~0=6, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [main_~i~0=6, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7.base|=106, |main_#t~mem7.offset|=48, |main_#t~mem8|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; VAL [main_~i~0=(- 9), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 9), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 8), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 8), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 7), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 7), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 6), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 6), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 5), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 5), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 4), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 4), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 3), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 3), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 2), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 2), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 1), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 1), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !(~i~0 < #t~mem10);havoc #t~mem10; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0] [?] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; VAL [check_~i=1, check_~pc.base=122, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0, |check_#res|=0] [?] assume true; VAL [check_~i=1, check_~pc.base=122, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0, |check_#res|=0] [?] RET #62#return; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume 0 == #t~ret12;havoc #t~ret12; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !false; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=111, #NULL.offset=107, old(#NULL.base)=111, old(#NULL.offset)=107] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L19] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L20] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0.base, ~pa~0.offset; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L24-L27] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L29-L41] assume ~i~0 >= 0 && ~i~0 < 9; [L30] call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4); [L31] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L31] ~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset; [L31] havoc #t~mem6.base, #t~mem6.offset; [L32] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L32] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7.base=106, #t~mem7.offset=48, #t~mem8=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L32-L40] assume #t~mem8 > 0; [L32] havoc #t~mem7.base, #t~mem7.offset; [L32] havoc #t~mem8; [L33] call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !(~i~0 < #t~mem10); [L34] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L12-L15] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L12-L15] ~i := #in~i; [L14] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L14] call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0.base, #t~mem0.offset; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L12-L15] ensures true; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L37] RET call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37-L39] assume 0 == #t~ret12; [L37] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L45] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=111, #NULL.offset=107, old(#NULL.base)=111, old(#NULL.offset)=107] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L19] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L20] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0.base, ~pa~0.offset; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L24-L27] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L29-L41] assume ~i~0 >= 0 && ~i~0 < 9; [L30] call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4); [L31] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L31] ~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset; [L31] havoc #t~mem6.base, #t~mem6.offset; [L32] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L32] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7.base=106, #t~mem7.offset=48, #t~mem8=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L32-L40] assume #t~mem8 > 0; [L32] havoc #t~mem7.base, #t~mem7.offset; [L32] havoc #t~mem8; [L33] call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !(~i~0 < #t~mem10); [L34] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L12-L15] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L12-L15] ~i := #in~i; [L14] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L14] call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0.base, #t~mem0.offset; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L12-L15] ensures true; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L37] RET call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37-L39] assume 0 == #t~ret12; [L37] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L45] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={106:0}, cont={122:0}, i=6, j=0] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=1] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=2] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=3] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=4] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=5] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=6] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=7] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=8] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=9] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=10] [L24] COND FALSE !(j < 10) VAL [array={106:0}, cont={122:0}, i=6, j=10] [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b VAL [array={106:0}, cont={122:0}, cont.array={106:48}, cont.array[0].b=1, i=6, j=10, pa={106:52}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-9, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=1, pc={122:0}] [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] RET, EXPR check(&cont, i) VAL [array={106:0}, check(&cont, i)=0, cont={122:0}, i=1, j=10, pa={106:52}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] ----- [2018-11-23 00:48:07,893 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b16aa179-7da8-4b45-be57-a84503fafe99/bin-2019/uautomizer/witness.graphml [2018-11-23 00:48:07,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:48:07,894 INFO L168 Benchmark]: Toolchain (without parser) took 10085.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 959.1 MB in the beginning and 865.2 MB in the end (delta: 93.9 MB). Peak memory consumption was 362.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:48:07,895 INFO L168 Benchmark]: CDTParser took 0.14 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 00:48:07,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.95 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:48:07,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.34 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:48:07,896 INFO L168 Benchmark]: Boogie Preprocessor took 55.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:48:07,896 INFO L168 Benchmark]: RCFGBuilder took 176.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:48:07,896 INFO L168 Benchmark]: TraceAbstraction took 9051.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 1.1 GB in the beginning and 871.9 MB in the end (delta: 249.3 MB). Peak memory consumption was 374.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:48:07,897 INFO L168 Benchmark]: Witness Printer took 614.63 ms. Allocated memory is still 1.3 GB. Free memory was 871.9 MB in the beginning and 865.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:48:07,899 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.95 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.34 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 176.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9051.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 1.1 GB in the beginning and 871.9 MB in the end (delta: 249.3 MB). Peak memory consumption was 374.6 MB. Max. memory is 11.5 GB. * Witness Printer took 614.63 ms. Allocated memory is still 1.3 GB. Free memory was 871.9 MB in the beginning and 865.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 45]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={106:0}, cont={122:0}, i=6, j=0] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=1] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=2] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=3] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=4] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=5] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=6] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=7] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=8] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=9] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=10] [L24] COND FALSE !(j < 10) VAL [array={106:0}, cont={122:0}, i=6, j=10] [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b VAL [array={106:0}, cont={122:0}, cont.array={106:48}, cont.array[0].b=1, i=6, j=10, pa={106:52}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-9, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=1, pc={122:0}] [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] RET, EXPR check(&cont, i) VAL [array={106:0}, check(&cont, i)=0, cont={122:0}, i=1, j=10, pa={106:52}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 9.0s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 237 SDtfs, 124 SDslu, 1018 SDs, 0 SdLazy, 819 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 358 SyntacticMatches, 14 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=13, 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, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 845 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 763 ConstructedInterpolants, 9 QuantifiedInterpolants, 76678 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1701 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 393/1182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...