java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/array_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:01:18,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:01:18,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:01:18,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:01:18,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:01:18,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:01:18,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:01:18,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:01:18,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:01:18,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:01:18,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:01:18,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:01:18,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:01:18,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:01:18,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:01:18,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:01:18,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:01:18,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:01:18,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:01:18,290 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:01:18,291 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:01:18,292 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:01:18,295 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:01:18,295 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:01:18,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:01:18,297 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:01:18,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:01:18,299 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:01:18,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:01:18,303 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:01:18,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:01:18,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:01:18,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:01:18,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:01:18,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:01:18,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:01:18,309 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:01:18,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:01:18,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:01:18,338 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:01:18,338 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:01:18,339 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:01:18,339 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:01:18,339 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:01:18,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:01:18,340 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:01:18,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:01:18,340 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:01:18,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:01:18,340 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:01:18,342 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:01:18,342 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:01:18,342 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:01:18,342 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:01:18,342 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:01:18,343 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:01:18,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:01:18,343 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:01:18,343 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:01:18,343 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:01:18,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:01:18,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:01:18,344 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:01:18,344 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:01:18,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:01:18,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:01:18,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:01:18,347 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:01:18,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:01:18,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:01:18,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:01:18,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:01:18,428 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:01:18,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array_false-unreach-call_true-termination.i [2018-11-23 13:01:18,490 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f3d637a/8e0b27b7d4ff4b2aafa350c97b7fbe15/FLAGe9e43020d [2018-11-23 13:01:18,905 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:01:18,906 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array_false-unreach-call_true-termination.i [2018-11-23 13:01:18,912 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f3d637a/8e0b27b7d4ff4b2aafa350c97b7fbe15/FLAGe9e43020d [2018-11-23 13:01:19,275 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f3d637a/8e0b27b7d4ff4b2aafa350c97b7fbe15 [2018-11-23 13:01:19,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:01:19,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:01:19,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:19,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:01:19,293 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:01:19,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8c04a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19, skipping insertion in model container [2018-11-23 13:01:19,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:01:19,337 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:01:19,609 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:19,614 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:01:19,641 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:19,668 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:01:19,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19 WrapperNode [2018-11-23 13:01:19,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:19,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:01:19,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:01:19,669 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:01:19,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:01:19,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:01:19,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:01:19,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:01:19,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (1/1) ... [2018-11-23 13:01:19,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:01:19,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:01:19,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:01:19,743 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:01:19,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:01:19,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:01:19,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:01:19,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:01:19,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:01:19,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:01:19,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:01:19,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:01:19,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:01:19,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:01:19,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:01:19,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:01:19,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:01:20,475 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:01:20,475 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:01:20,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:20 BoogieIcfgContainer [2018-11-23 13:01:20,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:01:20,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:01:20,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:01:20,484 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:01:20,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:01:19" (1/3) ... [2018-11-23 13:01:20,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bcbb63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:20, skipping insertion in model container [2018-11-23 13:01:20,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:19" (2/3) ... [2018-11-23 13:01:20,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bcbb63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:20, skipping insertion in model container [2018-11-23 13:01:20,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:20" (3/3) ... [2018-11-23 13:01:20,490 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call_true-termination.i [2018-11-23 13:01:20,502 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:01:20,511 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:01:20,529 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:01:20,559 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:01:20,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:01:20,560 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:01:20,560 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:01:20,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:01:20,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:01:20,561 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:01:20,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:01:20,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:01:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 13:01:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:01:20,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:20,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:20,592 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:20,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:20,599 INFO L82 PathProgramCache]: Analyzing trace with hash 202253298, now seen corresponding path program 1 times [2018-11-23 13:01:20,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:20,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:20,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:20,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:20,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 13:01:20,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25#true} is VALID [2018-11-23 13:01:20,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 13:01:20,768 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #40#return; {25#true} is VALID [2018-11-23 13:01:20,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2018-11-23 13:01:20,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~menor~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {25#true} is VALID [2018-11-23 13:01:20,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-23 13:01:20,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); {26#false} is VALID [2018-11-23 13:01:20,772 INFO L256 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); {26#false} is VALID [2018-11-23 13:01:20,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-23 13:01:20,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2018-11-23 13:01:20,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 13:01:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:20,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:20,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:01:20,783 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:01:20,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:20,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:01:20,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:20,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:01:20,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:01:20,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:01:20,890 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 13:01:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:21,201 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 13:01:21,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:01:21,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:01:21,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:01:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2018-11-23 13:01:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:01:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2018-11-23 13:01:21,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2018-11-23 13:01:21,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:21,564 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:01:21,564 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:01:21,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:01:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:01:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:01:21,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:21,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:01:21,612 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:01:21,612 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:01:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:21,616 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 13:01:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:01:21,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:21,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:21,617 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:01:21,617 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:01:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:21,620 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 13:01:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:01:21,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:21,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:21,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:21,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:01:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 13:01:21,625 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-11-23 13:01:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:21,626 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 13:01:21,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:01:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:01:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:01:21,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:21,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:21,627 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:21,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash -112667363, now seen corresponding path program 1 times [2018-11-23 13:01:21,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:21,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:21,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:21,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {125#true} call ULTIMATE.init(); {125#true} is VALID [2018-11-23 13:01:21,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {125#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {125#true} is VALID [2018-11-23 13:01:21,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#true} assume true; {125#true} is VALID [2018-11-23 13:01:21,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} #40#return; {125#true} is VALID [2018-11-23 13:01:21,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {125#true} call #t~ret6 := main(); {125#true} is VALID [2018-11-23 13:01:21,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {125#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~menor~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {127#(and (<= 1 main_~SIZE~0) (= main_~j~0 0) (<= (div main_~SIZE~0 4294967296) 0))} is VALID [2018-11-23 13:01:21,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {127#(and (<= 1 main_~SIZE~0) (= main_~j~0 0) (<= (div main_~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {126#false} is VALID [2018-11-23 13:01:21,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {126#false} call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); {126#false} is VALID [2018-11-23 13:01:21,842 INFO L256 TraceCheckUtils]: 8: Hoare triple {126#false} call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); {126#false} is VALID [2018-11-23 13:01:21,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {126#false} ~cond := #in~cond; {126#false} is VALID [2018-11-23 13:01:21,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {126#false} assume 0 == ~cond; {126#false} is VALID [2018-11-23 13:01:21,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {126#false} assume !false; {126#false} is VALID [2018-11-23 13:01:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:21,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:21,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:01:21,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:01:21,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:21,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:01:21,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:21,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:01:21,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:01:21,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:01:21,918 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-23 13:01:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:22,181 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 13:01:22,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:01:22,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:01:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:01:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 13:01:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:01:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 13:01:22,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2018-11-23 13:01:22,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:22,332 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:01:22,332 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:01:22,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:01:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:01:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-23 13:01:22,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:22,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 16 states. [2018-11-23 13:01:22,349 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 16 states. [2018-11-23 13:01:22,350 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 16 states. [2018-11-23 13:01:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:22,353 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 13:01:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 13:01:22,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:22,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:22,355 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 18 states. [2018-11-23 13:01:22,355 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 18 states. [2018-11-23 13:01:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:22,357 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 13:01:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 13:01:22,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:22,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:22,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:22,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:01:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 13:01:22,361 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2018-11-23 13:01:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:22,361 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 13:01:22,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:01:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:01:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:01:22,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:22,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:22,363 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:22,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1912057964, now seen corresponding path program 1 times [2018-11-23 13:01:22,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:22,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:22,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:22,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:22,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:01:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:01:22,484 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=5, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] RET #40#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~menor~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume #t~mem3 <= ~menor~0;havoc #t~mem3;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem4;havoc #t~mem4; VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem5|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L20] havoc #t~nondet2; [L22] call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22-L23] assume #t~mem3 <= ~menor~0; [L22] havoc #t~mem3; [L23] call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem5=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L20] havoc #t~nondet2; [L22] call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22-L23] assume #t~mem3 <= ~menor~0; [L22] havoc #t~mem3; [L23] call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem5=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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] [L13] unsigned int SIZE=1; [L14] unsigned int j,k; [L15] int array[SIZE], menor; [L17] menor = __VERIFIER_nondet_int() [L19] j=0 VAL [array={6:0}, j=0, menor=0, SIZE=1] [L19] COND TRUE jmenor) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:01:22,541 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 13:01:22,541 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:01:22,541 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:01:22,541 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:01:22,541 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:01:22,542 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:01:22,542 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:01:22,542 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:01:22,542 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2018-11-23 13:01:22,542 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2018-11-23 13:01:22,542 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2018-11-23 13:01:22,543 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:01:22,543 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:01:22,543 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:01:22,543 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:01:22,543 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 13:01:22,543 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:01:22,544 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:01:22,544 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:01:22,544 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:01:22,545 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:01:22,545 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 13:01:22,545 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 13:01:22,545 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 13:01:22,545 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:01:22,545 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 13:01:22,546 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:01:22,546 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:01:22,546 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:01:22,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:01:22 BoogieIcfgContainer [2018-11-23 13:01:22,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:01:22,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:01:22,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:01:22,549 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:01:22,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:20" (3/4) ... [2018-11-23 13:01:22,552 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=5, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] RET #40#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~menor~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume #t~mem3 <= ~menor~0;havoc #t~mem3;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem4;havoc #t~mem4; VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem5|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L20] havoc #t~nondet2; [L22] call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22-L23] assume #t~mem3 <= ~menor~0; [L22] havoc #t~mem3; [L23] call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem5=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L20] havoc #t~nondet2; [L22] call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22-L23] assume #t~mem3 <= ~menor~0; [L22] havoc #t~mem3; [L23] call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem5=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~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] [L13] unsigned int SIZE=1; [L14] unsigned int j,k; [L15] int array[SIZE], menor; [L17] menor = __VERIFIER_nondet_int() [L19] j=0 VAL [array={6:0}, j=0, menor=0, SIZE=1] [L19] COND TRUE jmenor) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:01:22,623 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/array_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:01:22,623 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:01:22,625 INFO L168 Benchmark]: Toolchain (without parser) took 3338.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -680.1 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:01:22,627 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:01:22,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:01:22,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:01:22,629 INFO L168 Benchmark]: Boogie Preprocessor took 41.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:01:22,630 INFO L168 Benchmark]: RCFGBuilder took 735.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:01:22,631 INFO L168 Benchmark]: TraceAbstraction took 2070.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:01:22,631 INFO L168 Benchmark]: Witness Printer took 73.71 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:01:22,636 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 380.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 735.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2070.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 7.1 GB. * Witness Printer took 73.71 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] unsigned int SIZE=1; [L14] unsigned int j,k; [L15] int array[SIZE], menor; [L17] menor = __VERIFIER_nondet_int() [L19] j=0 VAL [array={6:0}, j=0, menor=0, SIZE=1] [L19] COND TRUE jmenor) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. UNSAFE Result, 1.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 3 SDslu, 11 SDs, 0 SdLazy, 7 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...