./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/matrix_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/matrix_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a06687718ac0cd281e66000f698ec14d3c3893e6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-22 21:57:45,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:57:45,731 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:57:45,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:57:45,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:57:45,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:57:45,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:57:45,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:57:45,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:57:45,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:57:45,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:57:45,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:57:45,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:57:45,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:57:45,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:57:45,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:57:45,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:57:45,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:57:45,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:57:45,751 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:57:45,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:57:45,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:57:45,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:57:45,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:57:45,754 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:57:45,755 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:57:45,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:57:45,756 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:57:45,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:57:45,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:57:45,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:57:45,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:57:45,758 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:57:45,758 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:57:45,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:57:45,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:57:45,760 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 21:57:45,769 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:57:45,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:57:45,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:57:45,770 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:57:45,771 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 21:57:45,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 21:57:45,771 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 21:57:45,771 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 21:57:45,771 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 21:57:45,771 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 21:57:45,771 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 21:57:45,771 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 21:57:45,772 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 21:57:45,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:57:45,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:57:45,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:57:45,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:57:45,773 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:57:45,773 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:57:45,773 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:57:45,773 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:57:45,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:57:45,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:57:45,773 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:57:45,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:57:45,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:57:45,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:57:45,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:57:45,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:57:45,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:57:45,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:57:45,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:57:45,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:57:45,775 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 21:57:45,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:57:45,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:57:45,775 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 21:57:45,775 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a06687718ac0cd281e66000f698ec14d3c3893e6 [2018-11-22 21:57:45,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:57:45,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:57:45,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:57:45,812 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:57:45,812 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:57:45,813 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/../../sv-benchmarks/c/loops/matrix_false-unreach-call_true-termination.i [2018-11-22 21:57:45,859 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/data/e4bd0e333/be4dfe451f364ae3ad80d37f491c345d/FLAG47c20f87c [2018-11-22 21:57:46,165 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:57:46,166 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/sv-benchmarks/c/loops/matrix_false-unreach-call_true-termination.i [2018-11-22 21:57:46,170 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/data/e4bd0e333/be4dfe451f364ae3ad80d37f491c345d/FLAG47c20f87c [2018-11-22 21:57:46,179 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/data/e4bd0e333/be4dfe451f364ae3ad80d37f491c345d [2018-11-22 21:57:46,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:57:46,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:57:46,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:57:46,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:57:46,186 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:57:46,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46, skipping insertion in model container [2018-11-22 21:57:46,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:57:46,215 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:57:46,352 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:57:46,355 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:57:46,370 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:57:46,382 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:57:46,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46 WrapperNode [2018-11-22 21:57:46,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:57:46,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:57:46,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:57:46,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:57:46,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:57:46,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:57:46,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:57:46,397 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:57:46,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (1/1) ... [2018-11-22 21:57:46,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:57:46,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:57:46,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:57:46,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:57:46,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:57:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:57:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:57:46,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:57:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:57:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:57:46,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:57:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:57:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:57:46,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:57:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-22 21:57:46,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-22 21:57:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:57:46,643 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:57:46,644 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-22 21:57:46,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:57:46 BoogieIcfgContainer [2018-11-22 21:57:46,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:57:46,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:57:46,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:57:46,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:57:46,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:57:46" (1/3) ... [2018-11-22 21:57:46,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f885028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:57:46, skipping insertion in model container [2018-11-22 21:57:46,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:46" (2/3) ... [2018-11-22 21:57:46,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f885028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:57:46, skipping insertion in model container [2018-11-22 21:57:46,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:57:46" (3/3) ... [2018-11-22 21:57:46,649 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix_false-unreach-call_true-termination.i [2018-11-22 21:57:46,655 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:57:46,660 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:57:46,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:57:46,692 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:57:46,692 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:57:46,692 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:57:46,692 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:57:46,692 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:57:46,692 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:57:46,692 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:57:46,693 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:57:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-22 21:57:46,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 21:57:46,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:46,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:46,710 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:46,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:46,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2125374060, now seen corresponding path program 1 times [2018-11-22 21:57:46,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:46,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:46,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:46,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:46,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:46,772 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-22 21:57:46,772 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-22 21:57:46,772 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-22 21:57:46,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:46,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-22 21:57:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:46,812 INFO L190 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-11-22 21:57:46,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 21:57:46,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:57:46,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:57:46,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:46,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 21:57:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:46,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:57:46,852 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-22 21:57:46,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:57:46,870 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-22 21:57:46,885 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:46,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-11-22 21:57:46,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:46,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:57:46,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:57:46,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:57:46,898 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-22 21:57:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:46,910 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2018-11-22 21:57:46,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:57:46,911 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-22 21:57:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:46,917 INFO L225 Difference]: With dead ends: 52 [2018-11-22 21:57:46,917 INFO L226 Difference]: Without dead ends: 24 [2018-11-22 21:57:46,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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-22 21:57:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-22 21:57:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-22 21:57:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 21:57:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-22 21:57:46,942 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2018-11-22 21:57:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:46,942 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-22 21:57:46,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:57:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-22 21:57:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 21:57:46,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:46,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:46,943 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:46,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:46,943 INFO L82 PathProgramCache]: Analyzing trace with hash 739661195, now seen corresponding path program 1 times [2018-11-22 21:57:46,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:46,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:46,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:46,949 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-22 21:57:46,949 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-22 21:57:46,949 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-22 21:57:46,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:46,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-22 21:57:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:46,993 INFO L190 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-11-22 21:57:46,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 21:57:46,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:57:46,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:57:46,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:47,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 21:57:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:47,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:57:47,075 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-22 21:57:47,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:57:47,107 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-22 21:57:47,131 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:47,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-11-22 21:57:47,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:47,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:57:47,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:57:47,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:57:47,133 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 5 states. [2018-11-22 21:57:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:47,184 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-22 21:57:47,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:57:47,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-22 21:57:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:47,186 INFO L225 Difference]: With dead ends: 49 [2018-11-22 21:57:47,186 INFO L226 Difference]: Without dead ends: 35 [2018-11-22 21:57:47,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:57:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-22 21:57:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-11-22 21:57:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-22 21:57:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-22 21:57:47,195 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2018-11-22 21:57:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:47,195 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-22 21:57:47,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:57:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-22 21:57:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:57:47,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:47,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:47,196 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:47,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1656958391, now seen corresponding path program 1 times [2018-11-22 21:57:47,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:47,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:47,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:47,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:47,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:47,203 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-22 21:57:47,203 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-22 21:57:47,203 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-22 21:57:47,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:47,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-22 21:57:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:47,248 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-22 21:57:47,249 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [19], [32], [36], [44], [52], [66], [69], [71], [77], [78], [79], [81] [2018-11-22 21:57:47,269 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 21:57:47,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 21:57:47,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 21:57:47,393 INFO L272 AbstractInterpreter]: Visited 17 different actions 32 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 144 root evaluator evaluations with a maximum evaluation depth of 4. Performed 144 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 22 variables. [2018-11-22 21:57:47,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:47,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 21:57:47,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:57:47,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:57:47,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:47,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 21:57:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:47,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:57:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:47,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:57:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:47,491 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:47,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-11-22 21:57:47,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:47,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:57:47,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:57:47,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:57:47,492 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2018-11-22 21:57:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:47,543 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-22 21:57:47,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:57:47,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-22 21:57:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:47,545 INFO L225 Difference]: With dead ends: 57 [2018-11-22 21:57:47,545 INFO L226 Difference]: Without dead ends: 32 [2018-11-22 21:57:47,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:57:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-22 21:57:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-22 21:57:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 21:57:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-22 21:57:47,549 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-11-22 21:57:47,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:47,549 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-22 21:57:47,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:57:47,550 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-22 21:57:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 21:57:47,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:47,550 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-22 21:57:47,551 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:47,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1471852900, now seen corresponding path program 1 times [2018-11-22 21:57:47,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:47,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:47,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:47,557 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-22 21:57:47,557 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-22 21:57:47,557 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab4ac991-1537-494c-bcfb-227f86c72445/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-22 21:57:47,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:47,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-22 21:57:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:57:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:57:47,619 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=2, |#NULL.offset|=3, |old(#NULL.base)|=2, |old(#NULL.offset)|=3] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2, |old(#NULL.offset)|=3] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2, |old(#NULL.offset)|=3] [?] RET #78#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~N_LIN~0 := #t~nondet0;havoc #t~nondet0;~N_COL~0 := #t~nondet1;havoc #t~nondet1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; VAL [main_~j~0=0, main_~maior~0=(- 2147479327), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147479327), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet5;call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147479327), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=(- 2147479326), |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume #t~mem6 > ~maior~0;havoc #t~mem6;call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem7;havoc #t~mem7; VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] #t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~j~0=1, main_~k~0=1, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [main_~j~0=1, main_~k~0=1, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] ~j~0 := 0; VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=(- 2147479326), |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2, #NULL.offset=3, old(#NULL.base)=2, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L21] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] call write~int(#t~nondet5, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] havoc #t~nondet5; [L25] call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=-2147479326, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25-L26] assume #t~mem6 > ~maior~0; [L25] havoc #t~mem6; [L26] call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L30] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L31] call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=-2147479326, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2, #NULL.offset=3, old(#NULL.base)=2, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L21] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] call write~int(#t~nondet5, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] havoc #t~nondet5; [L25] call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=-2147479326, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25-L26] assume #t~mem6 > ~maior~0; [L25] havoc #t~mem6; [L26] call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L30] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L31] call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=-2147479326, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L14] unsigned int N_LIN=__VERIFIER_nondet_uint(); [L15] unsigned int N_COL=__VERIFIER_nondet_uint(); [L16] unsigned int j,k; [L17] int matriz[N_COL][N_LIN], maior; [L19] maior = __VERIFIER_nondet_int() [L20] j=0 VAL [j=0, maior=-2147479327, matriz={6:0}, N_COL=1, N_LIN=1] [L20] COND TRUE jmaior [L26] EXPR matriz[j][k] [L26] maior = matriz[j][k] [L21] k++ VAL [j=0, k=1, maior=-2147479326, matriz={6:0}, N_COL=1, N_LIN=1] [L21] COND FALSE !(k ~maior~0;havoc #t~mem6;call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem7;havoc #t~mem7; VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] #t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~j~0=1, main_~k~0=1, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [main_~j~0=1, main_~k~0=1, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] ~j~0 := 0; VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147479326), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=(- 2147479326), |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2, #NULL.offset=3, old(#NULL.base)=2, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L21] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] call write~int(#t~nondet5, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] havoc #t~nondet5; [L25] call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=-2147479326, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25-L26] assume #t~mem6 > ~maior~0; [L25] havoc #t~mem6; [L26] call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L30] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L31] call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=-2147479326, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2, #NULL.offset=3, old(#NULL.base)=2, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L21] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] call write~int(#t~nondet5, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] havoc #t~nondet5; [L25] call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=-2147479326, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25-L26] assume #t~mem6 > ~maior~0; [L25] havoc #t~mem6; [L26] call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L30] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L31] call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=-2147479326, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479327, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147479326, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147479326, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L14] unsigned int N_LIN=__VERIFIER_nondet_uint(); [L15] unsigned int N_COL=__VERIFIER_nondet_uint(); [L16] unsigned int j,k; [L17] int matriz[N_COL][N_LIN], maior; [L19] maior = __VERIFIER_nondet_int() [L20] j=0 VAL [j=0, maior=-2147479327, matriz={6:0}, N_COL=1, N_LIN=1] [L20] COND TRUE jmaior [L26] EXPR matriz[j][k] [L26] maior = matriz[j][k] [L21] k++ VAL [j=0, k=1, maior=-2147479326, matriz={6:0}, N_COL=1, N_LIN=1] [L21] COND FALSE !(kmaior [L26] EXPR matriz[j][k] [L26] maior = matriz[j][k] [L21] k++ VAL [j=0, k=1, maior=-2147479326, matriz={6:0}, N_COL=1, N_LIN=1] [L21] COND FALSE !(k