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_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:03:03,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:03:03,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:03:03,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:03:03,287 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:03:03,288 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:03:03,290 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:03:03,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:03:03,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:03:03,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:03:03,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:03:03,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:03:03,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:03:03,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:03:03,299 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:03:03,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:03:03,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:03:03,303 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:03:03,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:03:03,307 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:03:03,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:03:03,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:03:03,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:03:03,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:03:03,316 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:03:03,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:03:03,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:03:03,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:03:03,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:03:03,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:03:03,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:03:03,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:03:03,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:03:03,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:03:03,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:03:03,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:03:03,331 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:03:03,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:03:03,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:03:03,356 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:03:03,356 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:03:03,357 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:03:03,357 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:03:03,357 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:03:03,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:03:03,357 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:03:03,358 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:03:03,358 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:03:03,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:03:03,358 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:03:03,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:03:03,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:03:03,360 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:03:03,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:03:03,360 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:03:03,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:03:03,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:03:03,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:03:03,361 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:03:03,361 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:03:03,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:03,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:03:03,362 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:03:03,362 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:03:03,362 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:03:03,362 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:03:03,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:03:03,364 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:03:03,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:03:03,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:03:03,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:03:03,459 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:03:03,459 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:03:03,460 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i [2018-11-23 13:03:03,528 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17cfc08f6/bd44dc1e34e14e20aba3af82dbbb0fe6/FLAGdc9d2363f [2018-11-23 13:03:03,921 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:03:03,921 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i [2018-11-23 13:03:03,927 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17cfc08f6/bd44dc1e34e14e20aba3af82dbbb0fe6/FLAGdc9d2363f [2018-11-23 13:03:04,301 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17cfc08f6/bd44dc1e34e14e20aba3af82dbbb0fe6 [2018-11-23 13:03:04,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:03:04,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:03:04,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:04,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:03:04,320 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:03:04,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:04" (1/1) ... [2018-11-23 13:03:04,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bbf104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04, skipping insertion in model container [2018-11-23 13:03:04,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:04" (1/1) ... [2018-11-23 13:03:04,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:03:04,359 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:03:04,618 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:04,622 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:03:04,648 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:04,671 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:03:04,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04 WrapperNode [2018-11-23 13:03:04,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:04,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:04,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:03:04,674 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:03:04,684 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:03:04" (1/1) ... [2018-11-23 13:03:04,693 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:03:04" (1/1) ... [2018-11-23 13:03:04,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:04,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:03:04,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:03:04,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:03:04,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04" (1/1) ... [2018-11-23 13:03:04,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04" (1/1) ... [2018-11-23 13:03:04,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04" (1/1) ... [2018-11-23 13:03:04,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04" (1/1) ... [2018-11-23 13:03:04,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04" (1/1) ... [2018-11-23 13:03:04,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04" (1/1) ... [2018-11-23 13:03:04,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04" (1/1) ... [2018-11-23 13:03:04,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:03:04,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:03:04,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:03:04,735 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:03:04,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04" (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:03:04,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:03:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:03:04,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:03:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:03:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:03:04,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:03:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:03:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:03:04,866 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:03:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:03:04,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:03:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:03:05,423 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:03:05,427 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:03:05,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:05 BoogieIcfgContainer [2018-11-23 13:03:05,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:03:05,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:03:05,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:03:05,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:03:05,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:03:04" (1/3) ... [2018-11-23 13:03:05,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a629f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:05, skipping insertion in model container [2018-11-23 13:03:05,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:04" (2/3) ... [2018-11-23 13:03:05,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a629f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:05, skipping insertion in model container [2018-11-23 13:03:05,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:05" (3/3) ... [2018-11-23 13:03:05,436 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call_true-termination.i [2018-11-23 13:03:05,447 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:03:05,455 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:03:05,475 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:03:05,519 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:03:05,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:03:05,520 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:03:05,520 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:03:05,520 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:03:05,520 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:03:05,521 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:03:05,521 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:03:05,521 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:03:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 13:03:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:03:05,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:05,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:05,549 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:05,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:05,556 INFO L82 PathProgramCache]: Analyzing trace with hash 202253298, now seen corresponding path program 1 times [2018-11-23 13:03:05,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:05,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:05,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:05,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 13:03:05,730 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:03:05,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 13:03:05,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #40#return; {25#true} is VALID [2018-11-23 13:03:05,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2018-11-23 13:03:05,731 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:03:05,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-23 13:03:05,733 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:03:05,733 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:03:05,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-23 13:03:05,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2018-11-23 13:03:05,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 13:03:05,737 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:03:05,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:05,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:05,745 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:03:05,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:05,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:03:05,801 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:03:05,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:03:05,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:03:05,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:05,814 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 13:03:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:06,228 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 13:03:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:03:06,229 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:03:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2018-11-23 13:03:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2018-11-23 13:03:06,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2018-11-23 13:03:06,466 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:03:06,478 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:03:06,478 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:03:06,482 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:03:06,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:03:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:03:06,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:06,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:03:06,598 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:03:06,598 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:03:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:06,602 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 13:03:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:03:06,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:06,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:06,603 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:03:06,603 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:03:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:06,607 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 13:03:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:03:06,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:06,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:06,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:06,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:03:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 13:03:06,612 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-11-23 13:03:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:06,613 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 13:03:06,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:03:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:03:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:03:06,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:06,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:06,614 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:06,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash -112667363, now seen corresponding path program 1 times [2018-11-23 13:03:06,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:06,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:06,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:06,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {125#true} call ULTIMATE.init(); {125#true} is VALID [2018-11-23 13:03:06,817 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:03:06,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#true} assume true; {125#true} is VALID [2018-11-23 13:03:06,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} #40#return; {125#true} is VALID [2018-11-23 13:03:06,818 INFO L256 TraceCheckUtils]: 4: Hoare triple {125#true} call #t~ret6 := main(); {125#true} is VALID [2018-11-23 13:03:06,820 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:03:06,821 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:03:06,821 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:03:06,822 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:03:06,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {126#false} ~cond := #in~cond; {126#false} is VALID [2018-11-23 13:03:06,822 INFO L273 TraceCheckUtils]: 10: Hoare triple {126#false} assume 0 == ~cond; {126#false} is VALID [2018-11-23 13:03:06,823 INFO L273 TraceCheckUtils]: 11: Hoare triple {126#false} assume !false; {126#false} is VALID [2018-11-23 13:03:06,825 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:03:06,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:06,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:03:06,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:03:06,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:06,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:03:06,956 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:03:06,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:03:06,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:03:06,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:06,957 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-23 13:03:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:07,102 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 13:03:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:03:07,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:03:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:03:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 13:03:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:03:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 13:03:07,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2018-11-23 13:03:07,178 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:03:07,180 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:03:07,180 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:03:07,181 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:03:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:03:07,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-23 13:03:07,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:07,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 16 states. [2018-11-23 13:03:07,206 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 16 states. [2018-11-23 13:03:07,206 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 16 states. [2018-11-23 13:03:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:07,210 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 13:03:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 13:03:07,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:07,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:07,211 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 18 states. [2018-11-23 13:03:07,211 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 18 states. [2018-11-23 13:03:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:07,213 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 13:03:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 13:03:07,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:07,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:07,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:07,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:03:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 13:03:07,217 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2018-11-23 13:03:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:07,217 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 13:03:07,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:03:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:03:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:03:07,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:07,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:07,219 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:07,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1912057964, now seen corresponding path program 1 times [2018-11-23 13:03:07,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:07,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:08,475 WARN L180 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 11 [2018-11-23 13:03:08,840 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 28 [2018-11-23 13:03:09,199 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 29 [2018-11-23 13:03:09,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2018-11-23 13:03:09,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {224#true} is VALID [2018-11-23 13:03:09,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2018-11-23 13:03:09,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #40#return; {224#true} is VALID [2018-11-23 13:03:09,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2018-11-23 13:03:09,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#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; {226#(and (= |main_~#array~0.offset| 0) (<= main_~SIZE~0 1) (<= 0 (div main_~SIZE~0 4294967296)))} is VALID [2018-11-23 13:03:09,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {226#(and (= |main_~#array~0.offset| 0) (<= main_~SIZE~0 1) (<= 0 (div main_~SIZE~0 4294967296)))} 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); {227#(and (= |main_~#array~0.offset| 0) (= (* 17179869184 (div main_~j~0 4294967296)) (* 4 main_~j~0)) (= |main_#t~mem3| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~j~0) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))) (<= (div main_~SIZE~0 4294967296) 0) (<= 0 (div main_~SIZE~0 4294967296)))} is VALID [2018-11-23 13:03:09,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {227#(and (= |main_~#array~0.offset| 0) (= (* 17179869184 (div main_~j~0 4294967296)) (* 4 main_~j~0)) (= |main_#t~mem3| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~j~0) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))) (<= (div main_~SIZE~0 4294967296) 0) (<= 0 (div main_~SIZE~0 4294967296)))} 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; {228#(and (= |main_~#array~0.offset| 0) (<= (+ (* 4 main_~j~0) |main_~#array~0.offset|) (* 17179869184 (div main_~j~0 4294967296))) (<= (div main_~SIZE~0 4294967296) 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~j~0) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))) (<= 0 (div main_~SIZE~0 4294967296)))} is VALID [2018-11-23 13:03:09,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {228#(and (= |main_~#array~0.offset| 0) (<= (+ (* 4 main_~j~0) |main_~#array~0.offset|) (* 17179869184 (div main_~j~0 4294967296))) (<= (div main_~SIZE~0 4294967296) 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~j~0) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))) (<= 0 (div main_~SIZE~0 4294967296)))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {229#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (div main_~SIZE~0 4294967296) 0) (<= 0 (div main_~SIZE~0 4294967296)))} is VALID [2018-11-23 13:03:09,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {229#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (div main_~SIZE~0 4294967296) 0) (<= 0 (div main_~SIZE~0 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {230#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2018-11-23 13:03:09,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {230#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); {231#(<= main_~menor~0 |main_#t~mem5|)} is VALID [2018-11-23 13:03:09,503 INFO L256 TraceCheckUtils]: 11: Hoare triple {231#(<= main_~menor~0 |main_#t~mem5|)} call __VERIFIER_assert((if #t~mem5 >= ~menor~0 then 1 else 0)); {232#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:09,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {232#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {233#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:09,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {233#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {225#false} is VALID [2018-11-23 13:03:09,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {225#false} assume !false; {225#false} is VALID [2018-11-23 13:03:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:09,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:09,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:09,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:09,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:09,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-11-23 13:03:09,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 13:03:09,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:09,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:09,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:09,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-11-23 13:03:09,879 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:09,880 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_1, v_prenex_2, |v_#memory_int_7|, |v_main_#t~nondet2_3|]. (let ((.cse5 (mod main_~j~0 4294967296))) (let ((.cse0 (< .cse5 (mod main_~SIZE~0 4294967296))) (.cse1 (= main_~SIZE~0 1)) (.cse3 (<= .cse5 2147483647)) (.cse2 (= main_~j~0 0)) (.cse4 (* 4 .cse5))) (or (and .cse0 .cse1 .cse2 .cse3 (= (store v_prenex_1 |main_~#array~0.base| (store (select v_prenex_1 |main_~#array~0.base|) (+ .cse4 |main_~#array~0.offset|) v_prenex_2)) |#memory_int|)) (and .cse0 .cse1 (not .cse3) .cse2 (= (store |v_#memory_int_7| |main_~#array~0.base| (store (select |v_#memory_int_7| |main_~#array~0.base|) (+ .cse4 |main_~#array~0.offset| (- 17179869184)) |v_main_#t~nondet2_3|)) |#memory_int|))))) [2018-11-23 13:03:09,880 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~SIZE~0 1) (= main_~j~0 0)) [2018-11-23 13:03:10,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:03:10,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 13:03:10,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:10,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:10,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:10,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 13:03:10,293 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:10,294 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (and (<= .cse0 |main_#t~mem5|) (<= main_~menor~0 .cse0))) [2018-11-23 13:03:10,294 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= main_~menor~0 |main_#t~mem5|) [2018-11-23 13:03:10,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2018-11-23 13:03:10,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {224#true} is VALID [2018-11-23 13:03:10,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2018-11-23 13:03:10,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #40#return; {224#true} is VALID [2018-11-23 13:03:10,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2018-11-23 13:03:10,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#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; {252#(and (= main_~SIZE~0 1) (= main_~j~0 0))} is VALID [2018-11-23 13:03:10,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {252#(and (= main_~SIZE~0 1) (= main_~j~0 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); {252#(and (= main_~SIZE~0 1) (= main_~j~0 0))} is VALID [2018-11-23 13:03:10,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {252#(and (= main_~SIZE~0 1) (= main_~j~0 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; {259#(and (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~j~0 4294967296)) |main_~#array~0.offset|))) (= main_~j~0 0))} is VALID [2018-11-23 13:03:10,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {259#(and (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~j~0 4294967296)) |main_~#array~0.offset|))) (= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {263#(and (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~j~0 1))} is VALID [2018-11-23 13:03:10,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {263#(and (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {230#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2018-11-23 13:03:10,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {230#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); {231#(<= main_~menor~0 |main_#t~mem5|)} is VALID [2018-11-23 13:03:10,357 INFO L256 TraceCheckUtils]: 11: Hoare triple {231#(<= main_~menor~0 |main_#t~mem5|)} call __VERIFIER_assert((if #t~mem5 >= ~menor~0 then 1 else 0)); {232#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:10,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {232#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {233#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:10,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {233#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {225#false} is VALID [2018-11-23 13:03:10,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {225#false} assume !false; {225#false} is VALID [2018-11-23 13:03:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:10,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:10,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-11-23 13:03:10,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-11-23 13:03:10,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:10,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:03:10,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:10,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:03:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:03:10,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:10,471 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 13 states. [2018-11-23 13:03:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:11,265 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 13:03:11,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:03:11,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-11-23 13:03:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:03:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-23 13:03:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:03:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-23 13:03:11,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2018-11-23 13:03:11,308 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:03:11,308 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:03:11,308 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:03:11,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:03:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:03:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:03:11,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:11,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:03:11,311 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:03:11,311 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:03:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:11,311 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:03:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:03:11,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:11,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:11,312 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:03:11,312 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:03:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:11,313 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:03:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:03:11,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:11,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:11,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:11,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:03:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:03:11,314 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-23 13:03:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:11,314 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:03:11,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:03:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:03:11,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:11,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:03:11,448 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:03:11,448 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:03:11,449 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:03:11,449 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:03:11,449 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:03:11,449 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:03:11,449 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:03:11,449 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 29) the Hoare annotation is: true [2018-11-23 13:03:11,449 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= main_~menor~0 |main_#t~mem5|) (= main_~j~0 1)) [2018-11-23 13:03:11,449 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-23 13:03:11,450 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 29) no Hoare annotation was computed. [2018-11-23 13:03:11,450 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 23) no Hoare annotation was computed. [2018-11-23 13:03:11,450 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 24) no Hoare annotation was computed. [2018-11-23 13:03:11,450 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 24) the Hoare annotation is: (let ((.cse0 (= |main_~#array~0.offset| 0)) (.cse1 (= main_~SIZE~0 1))) (or (and .cse0 .cse1 (= main_~j~0 0)) (and .cse0 .cse1 (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~j~0 1)))) [2018-11-23 13:03:11,450 INFO L448 ceAbstractionStarter]: For program point L19-4(lines 19 24) no Hoare annotation was computed. [2018-11-23 13:03:11,450 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 29) no Hoare annotation was computed. [2018-11-23 13:03:11,450 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:03:11,451 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:03:11,451 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:03:11,451 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:03:11,451 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:03:11,451 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:03:11,453 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:03:11,454 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:03:11,454 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:03:11,454 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:03:11,454 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 13:03:11,454 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 13:03:11,455 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:03:11,455 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:03:11,455 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:03:11,455 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:03:11,455 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:03:11,455 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 13:03:11,455 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:03:11,455 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:03:11,455 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:03:11,455 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:03:11,456 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:03:11,456 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 13:03:11,456 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 13:03:11,456 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:03:11,456 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 13:03:11,456 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:03:11,456 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:03:11,456 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:03:11,463 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:03:11,466 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:03:11,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:03:11 BoogieIcfgContainer [2018-11-23 13:03:11,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:03:11,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:03:11,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:03:11,470 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:03:11,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:05" (3/4) ... [2018-11-23 13:03:11,474 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:03:11,481 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:03:11,482 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:03:11,482 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:03:11,486 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 13:03:11,487 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 13:03:11,487 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:03:11,535 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/array_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:03:11,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:03:11,536 INFO L168 Benchmark]: Toolchain (without parser) took 7223.32 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -381.9 MB). Peak memory consumption was 327.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:11,537 INFO L168 Benchmark]: CDTParser took 0.18 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:03:11,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.69 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:03:11,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.01 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:03:11,539 INFO L168 Benchmark]: Boogie Preprocessor took 32.52 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:03:11,539 INFO L168 Benchmark]: RCFGBuilder took 693.50 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:11,540 INFO L168 Benchmark]: TraceAbstraction took 6039.96 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 335.6 MB). Peak memory consumption was 335.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:11,541 INFO L168 Benchmark]: Witness Printer took 65.88 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:11,545 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.18 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. * CACSL2BoogieTranslator took 357.69 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 28.01 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 32.52 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 693.50 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6039.96 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 335.6 MB). Peak memory consumption was 335.6 MB. Max. memory is 7.1 GB. * Witness Printer took 65.88 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2018-11-23 13:03:11,552 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:03:11,553 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((array == 0 && SIZE == 1) && j == 0) || (((array == 0 && SIZE == 1) && menor <= unknown-#memory_int-unknown[array][array]) && j == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 5.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 11 SDslu, 67 SDs, 0 SdLazy, 70 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.2s 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 13 NumberOfFragments, 53 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 3191 SizeOfPredicates, 7 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...