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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/mbpr5_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:04:17,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:04:17,463 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:04:17,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:04:17,479 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:04:17,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:04:17,481 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:04:17,483 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:04:17,485 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:04:17,486 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:04:17,487 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:04:17,487 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:04:17,488 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:04:17,489 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:04:17,490 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:04:17,491 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:04:17,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:04:17,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:04:17,502 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:04:17,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:04:17,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:04:17,513 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:04:17,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:04:17,516 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:04:17,516 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:04:17,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:04:17,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:04:17,520 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:04:17,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:04:17,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:04:17,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:04:17,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:04:17,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:04:17,526 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:04:17,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:04:17,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:04:17,530 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-14 17:04:17,551 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:04:17,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:04:17,552 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:04:17,552 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:04:17,553 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:04:17,553 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:04:17,553 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:04:17,553 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:04:17,554 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:04:17,554 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:04:17,554 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:04:17,554 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:04:17,554 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:04:17,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:04:17,555 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:04:17,555 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:04:17,555 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:04:17,555 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:04:17,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:04:17,556 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:04:17,556 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:04:17,556 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:04:17,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:04:17,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:04:17,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:04:17,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:04:17,557 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:04:17,557 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:04:17,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:04:17,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:04:17,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:04:17,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:04:17,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:04:17,619 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:04:17,620 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:04:17,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr5_true-unreach-call.i [2018-11-14 17:04:17,686 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec35490ad/5fecd631935b4c1a809bd732648b6d68/FLAG7f3cf6ec8 [2018-11-14 17:04:18,141 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:04:18,142 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr5_true-unreach-call.i [2018-11-14 17:04:18,150 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec35490ad/5fecd631935b4c1a809bd732648b6d68/FLAG7f3cf6ec8 [2018-11-14 17:04:18,166 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec35490ad/5fecd631935b4c1a809bd732648b6d68 [2018-11-14 17:04:18,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:04:18,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:04:18,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:04:18,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:04:18,184 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:04:18,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:04:18" (1/1) ... [2018-11-14 17:04:18,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d22c5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18, skipping insertion in model container [2018-11-14 17:04:18,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:04:18" (1/1) ... [2018-11-14 17:04:18,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:04:18,229 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:04:18,514 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:04:18,524 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:04:18,603 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:04:18,624 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:04:18,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18 WrapperNode [2018-11-14 17:04:18,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:04:18,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:04:18,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:04:18,626 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:04:18,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18" (1/1) ... [2018-11-14 17:04:18,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18" (1/1) ... [2018-11-14 17:04:18,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18" (1/1) ... [2018-11-14 17:04:18,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18" (1/1) ... [2018-11-14 17:04:18,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18" (1/1) ... [2018-11-14 17:04:18,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18" (1/1) ... [2018-11-14 17:04:18,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18" (1/1) ... [2018-11-14 17:04:18,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:04:18,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:04:18,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:04:18,793 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:04:18,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18" (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-14 17:04:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:04:18,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:04:18,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:04:18,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:04:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:04:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:04:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:04:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:04:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:04:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:04:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:04:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:04:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:04:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:04:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:04:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:04:20,123 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:04:20,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:20 BoogieIcfgContainer [2018-11-14 17:04:20,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:04:20,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:04:20,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:04:20,128 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:04:20,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:04:18" (1/3) ... [2018-11-14 17:04:20,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c41e370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:04:20, skipping insertion in model container [2018-11-14 17:04:20,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:18" (2/3) ... [2018-11-14 17:04:20,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c41e370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:04:20, skipping insertion in model container [2018-11-14 17:04:20,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:20" (3/3) ... [2018-11-14 17:04:20,132 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr5_true-unreach-call.i [2018-11-14 17:04:20,140 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:04:20,149 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:04:20,164 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:04:20,197 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:04:20,198 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:04:20,198 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:04:20,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:04:20,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:04:20,200 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:04:20,200 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:04:20,200 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:04:20,200 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:04:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-14 17:04:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:04:20,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:20,229 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:20,232 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:20,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1029062908, now seen corresponding path program 1 times [2018-11-14 17:04:20,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:20,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:20,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:20,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:20,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:20,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {59#true} is VALID [2018-11-14 17:04:20,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {59#true} is VALID [2018-11-14 17:04:20,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 17:04:20,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {59#true} {59#true} #163#return; {59#true} is VALID [2018-11-14 17:04:20,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {59#true} call #t~ret31 := main(); {59#true} is VALID [2018-11-14 17:04:20,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {59#true} is VALID [2018-11-14 17:04:20,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {59#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {59#true} is VALID [2018-11-14 17:04:20,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {59#true} is VALID [2018-11-14 17:04:20,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#true} assume !true; {60#false} is VALID [2018-11-14 17:04:20,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {60#false} ~i~0 := 1; {60#false} is VALID [2018-11-14 17:04:20,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 17:04:20,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {60#false} ~i~0 := 1; {60#false} is VALID [2018-11-14 17:04:20,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 17:04:20,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {60#false} ~i~0 := 1; {60#false} is VALID [2018-11-14 17:04:20,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 17:04:20,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {60#false} ~i~0 := 1; {60#false} is VALID [2018-11-14 17:04:20,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 17:04:20,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {60#false} ~i~0 := 0; {60#false} is VALID [2018-11-14 17:04:20,420 INFO L273 TraceCheckUtils]: 18: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-14 17:04:20,421 INFO L273 TraceCheckUtils]: 19: Hoare triple {60#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {60#false} is VALID [2018-11-14 17:04:20,421 INFO L273 TraceCheckUtils]: 20: Hoare triple {60#false} assume #t~short30; {60#false} is VALID [2018-11-14 17:04:20,421 INFO L256 TraceCheckUtils]: 21: Hoare triple {60#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {60#false} is VALID [2018-11-14 17:04:20,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {60#false} ~cond := #in~cond; {60#false} is VALID [2018-11-14 17:04:20,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {60#false} assume ~cond == 0; {60#false} is VALID [2018-11-14 17:04:20,422 INFO L273 TraceCheckUtils]: 24: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-11-14 17:04:20,427 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-14 17:04:20,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:20,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:04:20,435 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-14 17:04:20,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:20,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:04:20,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:20,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:04:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:04:20,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:04:20,681 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-14 17:04:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:20,854 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2018-11-14 17:04:20,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:04:20,854 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-14 17:04:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:04:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 135 transitions. [2018-11-14 17:04:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:04:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 135 transitions. [2018-11-14 17:04:20,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 135 transitions. [2018-11-14 17:04:21,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:21,855 INFO L225 Difference]: With dead ends: 99 [2018-11-14 17:04:21,856 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 17:04:21,859 INFO L604 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-14 17:04:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 17:04:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 17:04:21,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:21,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 17:04:21,926 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 17:04:21,927 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 17:04:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:21,937 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-11-14 17:04:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-14 17:04:21,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:21,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:21,938 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 17:04:21,939 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 17:04:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:21,946 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-11-14 17:04:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-14 17:04:21,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:21,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:21,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:21,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:04:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-14 17:04:21,957 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 25 [2018-11-14 17:04:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:21,957 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-14 17:04:21,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:04:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-14 17:04:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:04:21,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:21,962 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:21,962 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:21,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:21,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1702974415, now seen corresponding path program 1 times [2018-11-14 17:04:21,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:21,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:21,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:22,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {343#true} call ULTIMATE.init(); {343#true} is VALID [2018-11-14 17:04:22,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {343#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {343#true} is VALID [2018-11-14 17:04:22,171 INFO L273 TraceCheckUtils]: 2: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 17:04:22,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {343#true} {343#true} #163#return; {343#true} is VALID [2018-11-14 17:04:22,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {343#true} call #t~ret31 := main(); {343#true} is VALID [2018-11-14 17:04:22,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {343#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {343#true} is VALID [2018-11-14 17:04:22,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {343#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {343#true} is VALID [2018-11-14 17:04:22,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {343#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {343#true} is VALID [2018-11-14 17:04:22,173 INFO L273 TraceCheckUtils]: 8: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 17:04:22,173 INFO L273 TraceCheckUtils]: 9: Hoare triple {343#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {343#true} is VALID [2018-11-14 17:04:22,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {343#true} ~i~0 := 1; {343#true} is VALID [2018-11-14 17:04:22,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 17:04:22,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {343#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {343#true} is VALID [2018-11-14 17:04:22,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {343#true} ~i~0 := 1; {343#true} is VALID [2018-11-14 17:04:22,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 17:04:22,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {343#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {343#true} is VALID [2018-11-14 17:04:22,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {343#true} ~i~0 := 1; {343#true} is VALID [2018-11-14 17:04:22,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 17:04:22,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {343#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {343#true} is VALID [2018-11-14 17:04:22,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {343#true} ~i~0 := 1; {343#true} is VALID [2018-11-14 17:04:22,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 17:04:22,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {343#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {343#true} is VALID [2018-11-14 17:04:22,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {343#true} ~i~0 := 0; {343#true} is VALID [2018-11-14 17:04:22,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 17:04:22,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {343#true} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {343#true} is VALID [2018-11-14 17:04:22,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {343#true} assume #t~short30; {345#|main_#t~short30|} is VALID [2018-11-14 17:04:22,183 INFO L256 TraceCheckUtils]: 26: Hoare triple {345#|main_#t~short30|} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {346#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-14 17:04:22,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {346#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {347#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-14 17:04:22,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {347#(not (= 0 __VERIFIER_assert_~cond))} assume ~cond == 0; {344#false} is VALID [2018-11-14 17:04:22,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {344#false} assume !false; {344#false} is VALID [2018-11-14 17:04:22,189 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-14 17:04:22,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:22,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:04:22,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 17:04:22,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:22,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:04:22,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:22,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:04:22,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:04:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:04:22,285 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 5 states. [2018-11-14 17:04:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:22,761 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 17:04:22,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:04:22,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 17:04:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:04:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-14 17:04:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:04:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-14 17:04:22,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2018-11-14 17:04:22,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:22,881 INFO L225 Difference]: With dead ends: 58 [2018-11-14 17:04:22,881 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 17:04:22,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:04:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 17:04:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-14 17:04:22,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:22,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2018-11-14 17:04:22,913 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2018-11-14 17:04:22,913 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2018-11-14 17:04:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:22,917 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-14 17:04:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-14 17:04:22,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:22,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:22,919 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2018-11-14 17:04:22,919 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2018-11-14 17:04:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:22,923 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-14 17:04:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-14 17:04:22,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:22,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:22,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:22,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-14 17:04:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-11-14 17:04:22,928 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 30 [2018-11-14 17:04:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:22,929 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2018-11-14 17:04:22,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:04:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-11-14 17:04:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:04:22,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:22,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:22,931 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:22,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1704821457, now seen corresponding path program 1 times [2018-11-14 17:04:22,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:22,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:22,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:22,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:22,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:23,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2018-11-14 17:04:23,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {605#true} is VALID [2018-11-14 17:04:23,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2018-11-14 17:04:23,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #163#return; {605#true} is VALID [2018-11-14 17:04:23,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret31 := main(); {605#true} is VALID [2018-11-14 17:04:23,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {605#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {605#true} is VALID [2018-11-14 17:04:23,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {607#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 17:04:23,140 INFO L273 TraceCheckUtils]: 7: Hoare triple {607#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {608#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:23,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {608#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {608#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:23,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {608#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-14 17:04:23,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {606#false} ~i~0 := 1; {606#false} is VALID [2018-11-14 17:04:23,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {606#false} assume true; {606#false} is VALID [2018-11-14 17:04:23,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-14 17:04:23,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {606#false} ~i~0 := 1; {606#false} is VALID [2018-11-14 17:04:23,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {606#false} assume true; {606#false} is VALID [2018-11-14 17:04:23,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-14 17:04:23,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {606#false} ~i~0 := 1; {606#false} is VALID [2018-11-14 17:04:23,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {606#false} assume true; {606#false} is VALID [2018-11-14 17:04:23,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-14 17:04:23,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {606#false} ~i~0 := 1; {606#false} is VALID [2018-11-14 17:04:23,147 INFO L273 TraceCheckUtils]: 20: Hoare triple {606#false} assume true; {606#false} is VALID [2018-11-14 17:04:23,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-14 17:04:23,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {606#false} ~i~0 := 0; {606#false} is VALID [2018-11-14 17:04:23,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {606#false} assume true; {606#false} is VALID [2018-11-14 17:04:23,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {606#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {606#false} is VALID [2018-11-14 17:04:23,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {606#false} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {606#false} is VALID [2018-11-14 17:04:23,148 INFO L256 TraceCheckUtils]: 26: Hoare triple {606#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {606#false} is VALID [2018-11-14 17:04:23,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {606#false} ~cond := #in~cond; {606#false} is VALID [2018-11-14 17:04:23,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {606#false} assume ~cond == 0; {606#false} is VALID [2018-11-14 17:04:23,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {606#false} assume !false; {606#false} is VALID [2018-11-14 17:04:23,151 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-14 17:04:23,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:23,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:04:23,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-14 17:04:23,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:23,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:04:23,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:23,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:04:23,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:04:23,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:04:23,252 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 4 states. [2018-11-14 17:04:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:23,711 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2018-11-14 17:04:23,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:04:23,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-14 17:04:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:04:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2018-11-14 17:04:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:04:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2018-11-14 17:04:23,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2018-11-14 17:04:23,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:23,925 INFO L225 Difference]: With dead ends: 102 [2018-11-14 17:04:23,925 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 17:04:23,926 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:04:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 17:04:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-11-14 17:04:23,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:23,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 57 states. [2018-11-14 17:04:23,968 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 57 states. [2018-11-14 17:04:23,968 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 57 states. [2018-11-14 17:04:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:23,972 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 17:04:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 17:04:23,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:23,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:23,973 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 60 states. [2018-11-14 17:04:23,974 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 60 states. [2018-11-14 17:04:23,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:23,977 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 17:04:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 17:04:23,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:23,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:23,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:23,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 17:04:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-14 17:04:23,982 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 30 [2018-11-14 17:04:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:23,982 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-14 17:04:23,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:04:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-14 17:04:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:04:23,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:23,984 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:23,984 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:23,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:23,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1923271226, now seen corresponding path program 1 times [2018-11-14 17:04:23,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:23,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:23,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:23,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:24,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2018-11-14 17:04:24,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {929#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {929#true} is VALID [2018-11-14 17:04:24,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2018-11-14 17:04:24,378 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #163#return; {929#true} is VALID [2018-11-14 17:04:24,378 INFO L256 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret31 := main(); {929#true} is VALID [2018-11-14 17:04:24,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {929#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {929#true} is VALID [2018-11-14 17:04:24,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {929#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {931#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 17:04:24,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {931#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {933#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,471 INFO L273 TraceCheckUtils]: 25: Hoare triple {933#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {933#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:24,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {933#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {930#false} is VALID [2018-11-14 17:04:24,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {930#false} ~i~0 := 0; {930#false} is VALID [2018-11-14 17:04:24,473 INFO L273 TraceCheckUtils]: 28: Hoare triple {930#false} assume true; {930#false} is VALID [2018-11-14 17:04:24,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {930#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {930#false} is VALID [2018-11-14 17:04:24,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {930#false} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {930#false} is VALID [2018-11-14 17:04:24,474 INFO L256 TraceCheckUtils]: 31: Hoare triple {930#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {930#false} is VALID [2018-11-14 17:04:24,474 INFO L273 TraceCheckUtils]: 32: Hoare triple {930#false} ~cond := #in~cond; {930#false} is VALID [2018-11-14 17:04:24,475 INFO L273 TraceCheckUtils]: 33: Hoare triple {930#false} assume ~cond == 0; {930#false} is VALID [2018-11-14 17:04:24,475 INFO L273 TraceCheckUtils]: 34: Hoare triple {930#false} assume !false; {930#false} is VALID [2018-11-14 17:04:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:04:24,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:24,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:04:24,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-14 17:04:24,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:24,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:04:24,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:24,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:04:24,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:04:24,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:04:24,552 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 5 states. [2018-11-14 17:04:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:25,198 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2018-11-14 17:04:25,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:04:25,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-14 17:04:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:04:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-14 17:04:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:04:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-14 17:04:25,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 133 transitions. [2018-11-14 17:04:25,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:25,514 INFO L225 Difference]: With dead ends: 116 [2018-11-14 17:04:25,514 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 17:04:25,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:04:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 17:04:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2018-11-14 17:04:25,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:25,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 65 states. [2018-11-14 17:04:25,613 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 65 states. [2018-11-14 17:04:25,613 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 65 states. [2018-11-14 17:04:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:25,616 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-11-14 17:04:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2018-11-14 17:04:25,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:25,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:25,618 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 80 states. [2018-11-14 17:04:25,618 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 80 states. [2018-11-14 17:04:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:25,622 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-11-14 17:04:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2018-11-14 17:04:25,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:25,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:25,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:25,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:04:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-11-14 17:04:25,626 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 35 [2018-11-14 17:04:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:25,627 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-11-14 17:04:25,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:04:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-11-14 17:04:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:04:25,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:25,630 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:25,630 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:25,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1665185152, now seen corresponding path program 1 times [2018-11-14 17:04:25,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:25,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:25,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:25,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:25,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {1323#true} call ULTIMATE.init(); {1323#true} is VALID [2018-11-14 17:04:25,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {1323#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1323#true} is VALID [2018-11-14 17:04:25,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {1323#true} assume true; {1323#true} is VALID [2018-11-14 17:04:25,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1323#true} {1323#true} #163#return; {1323#true} is VALID [2018-11-14 17:04:25,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {1323#true} call #t~ret31 := main(); {1323#true} is VALID [2018-11-14 17:04:25,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {1323#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1323#true} is VALID [2018-11-14 17:04:25,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {1323#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume true; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume true; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} ~i~0 := 1; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume true; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:04:25,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {1324#false} is VALID [2018-11-14 17:04:25,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {1324#false} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {1324#false} is VALID [2018-11-14 17:04:25,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {1324#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1324#false} is VALID [2018-11-14 17:04:25,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 17:04:25,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {1324#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 17:04:25,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {1324#false} ~i~0 := 1; {1324#false} is VALID [2018-11-14 17:04:25,761 INFO L273 TraceCheckUtils]: 24: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 17:04:25,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {1324#false} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 17:04:25,762 INFO L273 TraceCheckUtils]: 26: Hoare triple {1324#false} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {1324#false} is VALID [2018-11-14 17:04:25,762 INFO L273 TraceCheckUtils]: 27: Hoare triple {1324#false} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {1324#false} is VALID [2018-11-14 17:04:25,762 INFO L273 TraceCheckUtils]: 28: Hoare triple {1324#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1324#false} is VALID [2018-11-14 17:04:25,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 17:04:25,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {1324#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 17:04:25,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {1324#false} ~i~0 := 1; {1324#false} is VALID [2018-11-14 17:04:25,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 17:04:25,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {1324#false} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 17:04:25,764 INFO L273 TraceCheckUtils]: 34: Hoare triple {1324#false} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {1324#false} is VALID [2018-11-14 17:04:25,764 INFO L273 TraceCheckUtils]: 35: Hoare triple {1324#false} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {1324#false} is VALID [2018-11-14 17:04:25,765 INFO L273 TraceCheckUtils]: 36: Hoare triple {1324#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {1324#false} is VALID [2018-11-14 17:04:25,765 INFO L273 TraceCheckUtils]: 37: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 17:04:25,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {1324#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 17:04:25,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {1324#false} ~i~0 := 1; {1324#false} is VALID [2018-11-14 17:04:25,766 INFO L273 TraceCheckUtils]: 40: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 17:04:25,766 INFO L273 TraceCheckUtils]: 41: Hoare triple {1324#false} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 17:04:25,766 INFO L273 TraceCheckUtils]: 42: Hoare triple {1324#false} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {1324#false} is VALID [2018-11-14 17:04:25,766 INFO L273 TraceCheckUtils]: 43: Hoare triple {1324#false} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {1324#false} is VALID [2018-11-14 17:04:25,767 INFO L273 TraceCheckUtils]: 44: Hoare triple {1324#false} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {1324#false} is VALID [2018-11-14 17:04:25,767 INFO L273 TraceCheckUtils]: 45: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 17:04:25,767 INFO L273 TraceCheckUtils]: 46: Hoare triple {1324#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 17:04:25,767 INFO L273 TraceCheckUtils]: 47: Hoare triple {1324#false} ~i~0 := 0; {1324#false} is VALID [2018-11-14 17:04:25,767 INFO L273 TraceCheckUtils]: 48: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 17:04:25,768 INFO L273 TraceCheckUtils]: 49: Hoare triple {1324#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {1324#false} is VALID [2018-11-14 17:04:25,768 INFO L273 TraceCheckUtils]: 50: Hoare triple {1324#false} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {1324#false} is VALID [2018-11-14 17:04:25,768 INFO L256 TraceCheckUtils]: 51: Hoare triple {1324#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {1324#false} is VALID [2018-11-14 17:04:25,768 INFO L273 TraceCheckUtils]: 52: Hoare triple {1324#false} ~cond := #in~cond; {1324#false} is VALID [2018-11-14 17:04:25,768 INFO L273 TraceCheckUtils]: 53: Hoare triple {1324#false} assume ~cond == 0; {1324#false} is VALID [2018-11-14 17:04:25,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {1324#false} assume !false; {1324#false} is VALID [2018-11-14 17:04:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:04:25,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:25,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:04:25,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-14 17:04:25,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:25,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:04:25,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:25,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:04:25,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:04:25,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:04:25,855 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 3 states. [2018-11-14 17:04:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:26,007 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-11-14 17:04:26,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:04:26,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-14 17:04:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:04:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-14 17:04:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:04:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-14 17:04:26,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2018-11-14 17:04:26,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:26,163 INFO L225 Difference]: With dead ends: 112 [2018-11-14 17:04:26,163 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 17:04:26,164 INFO L604 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-14 17:04:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 17:04:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-14 17:04:26,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:26,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-14 17:04:26,225 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-14 17:04:26,225 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-14 17:04:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:26,228 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-14 17:04:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-14 17:04:26,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:26,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:26,229 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-14 17:04:26,229 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-14 17:04:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:26,232 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-14 17:04:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-14 17:04:26,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:26,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:26,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:26,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:04:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-11-14 17:04:26,235 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 55 [2018-11-14 17:04:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:26,236 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-11-14 17:04:26,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:04:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-14 17:04:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:04:26,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:26,237 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:26,238 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:26,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:26,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1970250622, now seen corresponding path program 1 times [2018-11-14 17:04:26,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:26,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:26,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:26,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2018-11-14 17:04:26,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {1685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1685#true} is VALID [2018-11-14 17:04:26,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 17:04:26,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #163#return; {1685#true} is VALID [2018-11-14 17:04:26,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret31 := main(); {1685#true} is VALID [2018-11-14 17:04:26,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {1685#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1685#true} is VALID [2018-11-14 17:04:26,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {1685#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,377 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} ~i~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,378 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,381 INFO L273 TraceCheckUtils]: 19: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,384 INFO L273 TraceCheckUtils]: 20: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,385 INFO L273 TraceCheckUtils]: 21: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} ~i~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,394 INFO L273 TraceCheckUtils]: 28: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,401 INFO L273 TraceCheckUtils]: 29: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,401 INFO L273 TraceCheckUtils]: 30: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} ~i~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,412 INFO L273 TraceCheckUtils]: 33: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,412 INFO L273 TraceCheckUtils]: 34: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,413 INFO L273 TraceCheckUtils]: 35: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} ~i~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,416 INFO L273 TraceCheckUtils]: 40: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,417 INFO L273 TraceCheckUtils]: 41: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:04:26,421 INFO L273 TraceCheckUtils]: 42: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {1686#false} is VALID [2018-11-14 17:04:26,421 INFO L273 TraceCheckUtils]: 43: Hoare triple {1686#false} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {1686#false} is VALID [2018-11-14 17:04:26,422 INFO L273 TraceCheckUtils]: 44: Hoare triple {1686#false} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {1686#false} is VALID [2018-11-14 17:04:26,422 INFO L273 TraceCheckUtils]: 45: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 17:04:26,422 INFO L273 TraceCheckUtils]: 46: Hoare triple {1686#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1686#false} is VALID [2018-11-14 17:04:26,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 17:04:26,422 INFO L273 TraceCheckUtils]: 48: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 17:04:26,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {1686#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {1686#false} is VALID [2018-11-14 17:04:26,423 INFO L273 TraceCheckUtils]: 50: Hoare triple {1686#false} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {1686#false} is VALID [2018-11-14 17:04:26,423 INFO L256 TraceCheckUtils]: 51: Hoare triple {1686#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {1686#false} is VALID [2018-11-14 17:04:26,424 INFO L273 TraceCheckUtils]: 52: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2018-11-14 17:04:26,424 INFO L273 TraceCheckUtils]: 53: Hoare triple {1686#false} assume ~cond == 0; {1686#false} is VALID [2018-11-14 17:04:26,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2018-11-14 17:04:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:04:26,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:26,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:04:26,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-14 17:04:26,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:26,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:04:26,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:26,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:04:26,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:04:26,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:04:26,535 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 3 states. [2018-11-14 17:04:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:26,800 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2018-11-14 17:04:26,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:04:26,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-14 17:04:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:04:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-14 17:04:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:04:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-14 17:04:26,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2018-11-14 17:04:27,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:27,054 INFO L225 Difference]: With dead ends: 88 [2018-11-14 17:04:27,054 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 17:04:27,055 INFO L604 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-14 17:04:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 17:04:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-14 17:04:27,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:27,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-14 17:04:27,167 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-14 17:04:27,167 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-14 17:04:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:27,170 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-14 17:04:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-14 17:04:27,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:27,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:27,172 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-14 17:04:27,172 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-14 17:04:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:27,176 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-14 17:04:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-14 17:04:27,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:27,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:27,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:27,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:04:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-11-14 17:04:27,180 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 55 [2018-11-14 17:04:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:27,180 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-11-14 17:04:27,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:04:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-14 17:04:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:04:27,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:27,181 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:27,184 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:27,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1383444608, now seen corresponding path program 1 times [2018-11-14 17:04:27,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:27,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:27,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:27,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:27,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:28,262 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2018-11-14 17:04:29,320 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2018-11-14 17:04:31,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2018-11-14 17:04:31,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {2017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2017#true} is VALID [2018-11-14 17:04:31,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2018-11-14 17:04:31,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #163#return; {2017#true} is VALID [2018-11-14 17:04:31,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret31 := main(); {2017#true} is VALID [2018-11-14 17:04:31,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {2017#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2017#true} is VALID [2018-11-14 17:04:31,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {2017#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2019#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} is VALID [2018-11-14 17:04:31,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {2019#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} is VALID [2018-11-14 17:04:31,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} assume true; {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} is VALID [2018-11-14 17:04:31,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} is VALID [2018-11-14 17:04:31,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 17:04:31,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 17:04:31,207 INFO L273 TraceCheckUtils]: 12: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2022#(and (or (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,208 INFO L273 TraceCheckUtils]: 13: Hoare triple {2022#(and (or (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} assume true; {2022#(and (or (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {2022#(and (or (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2023#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:04:31,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {2023#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 1; {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 17:04:31,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} assume true; {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 17:04:31,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 17:04:31,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 17:04:31,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 17:04:31,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2024#(and (or (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:04:31,222 INFO L273 TraceCheckUtils]: 21: Hoare triple {2024#(and (or (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {2024#(and (or (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:04:31,223 INFO L273 TraceCheckUtils]: 22: Hoare triple {2024#(and (or (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2025#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20)))))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {2025#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20)))))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2026#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))))))} is VALID [2018-11-14 17:04:31,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {2026#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))))))} assume true; {2026#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))))))} is VALID [2018-11-14 17:04:31,234 INFO L273 TraceCheckUtils]: 25: Hoare triple {2026#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,236 INFO L273 TraceCheckUtils]: 26: Hoare triple {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,237 INFO L273 TraceCheckUtils]: 27: Hoare triple {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,238 INFO L273 TraceCheckUtils]: 28: Hoare triple {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2028#(and (or (and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5))) (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {2028#(and (or (and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5))) (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} assume true; {2028#(and (or (and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5))) (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,280 INFO L273 TraceCheckUtils]: 30: Hoare triple {2028#(and (or (and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5))) (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2029#(and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,295 INFO L273 TraceCheckUtils]: 31: Hoare triple {2029#(and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,311 INFO L273 TraceCheckUtils]: 32: Hoare triple {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} assume true; {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,327 INFO L273 TraceCheckUtils]: 33: Hoare triple {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,341 INFO L273 TraceCheckUtils]: 34: Hoare triple {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,351 INFO L273 TraceCheckUtils]: 35: Hoare triple {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,365 INFO L273 TraceCheckUtils]: 36: Hoare triple {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2031#(and (or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,379 INFO L273 TraceCheckUtils]: 37: Hoare triple {2031#(and (or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} assume true; {2031#(and (or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:31,393 INFO L273 TraceCheckUtils]: 38: Hoare triple {2031#(and (or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:04:31,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 1; {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:04:31,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume true; {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:04:31,423 INFO L273 TraceCheckUtils]: 41: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:04:31,424 INFO L273 TraceCheckUtils]: 42: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:04:31,425 INFO L273 TraceCheckUtils]: 43: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:04:31,429 INFO L273 TraceCheckUtils]: 44: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:04:31,429 INFO L273 TraceCheckUtils]: 45: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume true; {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:04:31,430 INFO L273 TraceCheckUtils]: 46: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:04:31,430 INFO L273 TraceCheckUtils]: 47: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 0; {2033#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))} is VALID [2018-11-14 17:04:31,431 INFO L273 TraceCheckUtils]: 48: Hoare triple {2033#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))} assume true; {2033#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))} is VALID [2018-11-14 17:04:31,432 INFO L273 TraceCheckUtils]: 49: Hoare triple {2033#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2034#(and (= |main_~#volArray~0.offset| 0) |main_#t~short30| (= main_~i~0 0))} is VALID [2018-11-14 17:04:31,432 INFO L273 TraceCheckUtils]: 50: Hoare triple {2034#(and (= |main_~#volArray~0.offset| 0) |main_#t~short30| (= main_~i~0 0))} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {2018#false} is VALID [2018-11-14 17:04:31,433 INFO L256 TraceCheckUtils]: 51: Hoare triple {2018#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2018#false} is VALID [2018-11-14 17:04:31,433 INFO L273 TraceCheckUtils]: 52: Hoare triple {2018#false} ~cond := #in~cond; {2018#false} is VALID [2018-11-14 17:04:31,433 INFO L273 TraceCheckUtils]: 53: Hoare triple {2018#false} assume ~cond == 0; {2018#false} is VALID [2018-11-14 17:04:31,434 INFO L273 TraceCheckUtils]: 54: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2018-11-14 17:04:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:04:31,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:04:31,463 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-14 17:04:31,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:31,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:04:31,749 INFO L477 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 16 treesize of output 13 [2018-11-14 17:04:31,769 INFO L477 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 13 treesize of output 12 [2018-11-14 17:04:31,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:31,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:31,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:31,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-14 17:04:31,804 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:32,094 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:04:32,095 INFO L477 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 181 treesize of output 284 [2018-11-14 17:04:32,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 101 [2018-11-14 17:04:32,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-11-14 17:04:32,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,345 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 47 [2018-11-14 17:04:32,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-14 17:04:32,408 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,416 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,421 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,436 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:187, output treesize:14 [2018-11-14 17:04:32,531 INFO L477 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 24 treesize of output 19 [2018-11-14 17:04:32,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-14 17:04:32,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2018-11-14 17:04:32,566 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:32,585 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:04:32,588 INFO L477 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 271 treesize of output 464 [2018-11-14 17:04:32,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 165 [2018-11-14 17:04:32,747 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,749 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 138 [2018-11-14 17:04:32,851 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 108 [2018-11-14 17:04:32,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 59 [2018-11-14 17:04:32,903 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,916 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:32,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:32,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 98 [2018-11-14 17:04:33,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,012 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 68 [2018-11-14 17:04:33,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-11-14 17:04:33,095 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,102 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,105 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,112 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,126 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:280, output treesize:14 [2018-11-14 17:04:33,132 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:33,163 INFO L477 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 24 treesize of output 19 [2018-11-14 17:04:33,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-14 17:04:33,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2018-11-14 17:04:33,199 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:33,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:04:33,219 INFO L477 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 271 treesize of output 464 [2018-11-14 17:04:33,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,411 INFO L303 Elim1Store]: Index analysis took 152 ms [2018-11-14 17:04:33,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 165 [2018-11-14 17:04:33,491 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 104 [2018-11-14 17:04:33,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 68 [2018-11-14 17:04:33,697 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-11-14 17:04:33,702 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,709 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 143 [2018-11-14 17:04:33,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,804 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,806 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 113 [2018-11-14 17:04:33,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 64 [2018-11-14 17:04:33,866 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,894 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,900 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:04:33,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,928 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:280, output treesize:14 [2018-11-14 17:04:33,932 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:33,963 INFO L477 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 24 treesize of output 19 [2018-11-14 17:04:33,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:33,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-14 17:04:33,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:33,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2018-11-14 17:04:33,996 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:34,018 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:04:34,020 INFO L477 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 271 treesize of output 464 [2018-11-14 17:04:34,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 165 [2018-11-14 17:04:34,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 104 [2018-11-14 17:04:34,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 68 [2018-11-14 17:04:34,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-11-14 17:04:34,220 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,226 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 98 [2018-11-14 17:04:34,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 68 [2018-11-14 17:04:34,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-11-14 17:04:34,313 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,320 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,322 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,341 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:280, output treesize:14 [2018-11-14 17:04:34,345 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:34,389 INFO L477 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 24 treesize of output 19 [2018-11-14 17:04:34,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 37 [2018-11-14 17:04:34,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-14 17:04:34,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:04:34,489 INFO L477 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 283 treesize of output 474 [2018-11-14 17:04:34,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 210 [2018-11-14 17:04:34,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,615 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 158 [2018-11-14 17:04:34,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,715 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 128 [2018-11-14 17:04:34,835 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:34,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 81 [2018-11-14 17:04:34,853 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,871 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:34,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:04:34,912 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:292, output treesize:29 [2018-11-14 17:04:35,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2018-11-14 17:04:35,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {2017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2017#true} is VALID [2018-11-14 17:04:35,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2018-11-14 17:04:35,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #163#return; {2017#true} is VALID [2018-11-14 17:04:35,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret31 := main(); {2017#true} is VALID [2018-11-14 17:04:35,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {2017#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2017#true} is VALID [2018-11-14 17:04:35,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {2017#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2056#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 17:04:35,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {2056#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 17:04:35,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} assume true; {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 17:04:35,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 17:04:35,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {2070#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {2070#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= |main_~#volArray~0.offset| 0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,336 INFO L273 TraceCheckUtils]: 12: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,401 INFO L273 TraceCheckUtils]: 31: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,402 INFO L273 TraceCheckUtils]: 33: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,404 INFO L273 TraceCheckUtils]: 34: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,405 INFO L273 TraceCheckUtils]: 35: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,406 INFO L273 TraceCheckUtils]: 36: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,412 INFO L273 TraceCheckUtils]: 42: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {2169#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,414 INFO L273 TraceCheckUtils]: 43: Hoare triple {2169#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,415 INFO L273 TraceCheckUtils]: 44: Hoare triple {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:35,418 INFO L273 TraceCheckUtils]: 47: Hoare triple {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {2186#(and (exists ((v_prenex_4 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_4) (- 4)))) (<= 1 v_prenex_4))) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:04:35,419 INFO L273 TraceCheckUtils]: 48: Hoare triple {2186#(and (exists ((v_prenex_4 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_4) (- 4)))) (<= 1 v_prenex_4))) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume true; {2186#(and (exists ((v_prenex_4 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_4) (- 4)))) (<= 1 v_prenex_4))) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:04:35,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {2186#(and (exists ((v_prenex_4 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_4) (- 4)))) (<= 1 v_prenex_4))) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2193#|main_#t~short30|} is VALID [2018-11-14 17:04:35,422 INFO L273 TraceCheckUtils]: 50: Hoare triple {2193#|main_#t~short30|} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {2018#false} is VALID [2018-11-14 17:04:35,422 INFO L256 TraceCheckUtils]: 51: Hoare triple {2018#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2018#false} is VALID [2018-11-14 17:04:35,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {2018#false} ~cond := #in~cond; {2018#false} is VALID [2018-11-14 17:04:35,423 INFO L273 TraceCheckUtils]: 53: Hoare triple {2018#false} assume ~cond == 0; {2018#false} is VALID [2018-11-14 17:04:35,423 INFO L273 TraceCheckUtils]: 54: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2018-11-14 17:04:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:04:35,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:04:35,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2018-11-14 17:04:35,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2018-11-14 17:04:35,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:35,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 17:04:35,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:35,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 17:04:35,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 17:04:35,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:04:35,687 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 27 states. [2018-11-14 17:04:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:41,279 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2018-11-14 17:04:41,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:04:41,279 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2018-11-14 17:04:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:04:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 160 transitions. [2018-11-14 17:04:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:04:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 160 transitions. [2018-11-14 17:04:41,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 160 transitions. [2018-11-14 17:04:41,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:41,588 INFO L225 Difference]: With dead ends: 150 [2018-11-14 17:04:41,588 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 17:04:41,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=401, Invalid=1239, Unknown=0, NotChecked=0, Total=1640 [2018-11-14 17:04:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 17:04:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2018-11-14 17:04:41,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:41,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 68 states. [2018-11-14 17:04:41,748 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 68 states. [2018-11-14 17:04:41,748 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 68 states. [2018-11-14 17:04:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:41,754 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-14 17:04:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-14 17:04:41,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:41,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:41,755 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 95 states. [2018-11-14 17:04:41,755 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 95 states. [2018-11-14 17:04:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:41,760 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-14 17:04:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-14 17:04:41,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:41,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:41,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:41,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:04:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-11-14 17:04:41,764 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 55 [2018-11-14 17:04:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:41,765 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-11-14 17:04:41,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 17:04:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-11-14 17:04:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-14 17:04:41,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:41,766 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:41,766 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:41,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:41,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1855390773, now seen corresponding path program 1 times [2018-11-14 17:04:41,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:41,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:41,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:41,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:41,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:42,373 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-11-14 17:04:42,865 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2018-11-14 17:04:43,997 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2018-11-14 17:04:44,958 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-14 17:04:45,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {2702#true} call ULTIMATE.init(); {2702#true} is VALID [2018-11-14 17:04:45,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {2702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2702#true} is VALID [2018-11-14 17:04:45,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {2702#true} assume true; {2702#true} is VALID [2018-11-14 17:04:45,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2702#true} {2702#true} #163#return; {2702#true} is VALID [2018-11-14 17:04:45,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {2702#true} call #t~ret31 := main(); {2702#true} is VALID [2018-11-14 17:04:45,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {2702#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2702#true} is VALID [2018-11-14 17:04:45,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {2702#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2704#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:45,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {2704#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:45,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} assume true; {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:45,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:45,903 INFO L273 TraceCheckUtils]: 10: Hoare triple {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:45,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:45,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2706#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0) (<= (* 5 main_~i~0) 10)) (<= (+ (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:04:45,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {2706#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0) (<= (* 5 main_~i~0) 10)) (<= (+ (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {2706#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0) (<= (* 5 main_~i~0) 10)) (<= (+ (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:04:45,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {2706#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0) (<= (* 5 main_~i~0) 10)) (<= (+ (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2707#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {2707#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,912 INFO L273 TraceCheckUtils]: 16: Hoare triple {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {2709#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= (+ main_~MINVAL~0 3) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))))))} is VALID [2018-11-14 17:04:45,917 INFO L273 TraceCheckUtils]: 19: Hoare triple {2709#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= (+ main_~MINVAL~0 3) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))))))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {2709#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= (+ main_~MINVAL~0 3) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))))))} is VALID [2018-11-14 17:04:45,920 INFO L273 TraceCheckUtils]: 20: Hoare triple {2709#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= (+ main_~MINVAL~0 3) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))))))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2710#(and (<= (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) (div (+ ~CELLCOUNT~0 3) 5)) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {2710#(and (<= (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) (div (+ ~CELLCOUNT~0 3) 5)) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {2710#(and (<= (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) (div (+ ~CELLCOUNT~0 3) 5)) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {2710#(and (<= (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) (div (+ ~CELLCOUNT~0 3) 5)) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2711#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))))))} is VALID [2018-11-14 17:04:45,926 INFO L273 TraceCheckUtils]: 23: Hoare triple {2711#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))))))} ~i~0 := 1; {2712#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ (* 5 main_~i~0) 2) ~CELLCOUNT~0)) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,931 INFO L273 TraceCheckUtils]: 24: Hoare triple {2712#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ (* 5 main_~i~0) 2) ~CELLCOUNT~0)) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {2712#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ (* 5 main_~i~0) 2) ~CELLCOUNT~0)) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,934 INFO L273 TraceCheckUtils]: 25: Hoare triple {2712#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ (* 5 main_~i~0) 2) ~CELLCOUNT~0)) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 17:04:45,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 17:04:45,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 17:04:45,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2714#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (= (+ (* 20 (div ~CELLCOUNT~0 5)) 20) (* 20 main_~i~0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 20) (div ~CELLCOUNT~0 5)) (- 16))))) (<= (+ main_~i~0 1) (* 2 (div ~CELLCOUNT~0 5))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} is VALID [2018-11-14 17:04:45,938 INFO L273 TraceCheckUtils]: 29: Hoare triple {2714#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (= (+ (* 20 (div ~CELLCOUNT~0 5)) 20) (* 20 main_~i~0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 20) (div ~CELLCOUNT~0 5)) (- 16))))) (<= (+ main_~i~0 1) (* 2 (div ~CELLCOUNT~0 5))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} assume true; {2714#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (= (+ (* 20 (div ~CELLCOUNT~0 5)) 20) (* 20 main_~i~0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 20) (div ~CELLCOUNT~0 5)) (- 16))))) (<= (+ main_~i~0 1) (* 2 (div ~CELLCOUNT~0 5))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} is VALID [2018-11-14 17:04:45,941 INFO L273 TraceCheckUtils]: 30: Hoare triple {2714#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (= (+ (* 20 (div ~CELLCOUNT~0 5)) 20) (* 20 main_~i~0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 20) (div ~CELLCOUNT~0 5)) (- 16))))) (<= (+ main_~i~0 1) (* 2 (div ~CELLCOUNT~0 5))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,942 INFO L273 TraceCheckUtils]: 31: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} assume true; {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,945 INFO L273 TraceCheckUtils]: 34: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,947 INFO L273 TraceCheckUtils]: 35: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,950 INFO L273 TraceCheckUtils]: 37: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} assume true; {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:04:45,952 INFO L273 TraceCheckUtils]: 39: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 17:04:45,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} assume true; {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 17:04:45,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 17:04:45,960 INFO L273 TraceCheckUtils]: 42: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 17:04:45,961 INFO L273 TraceCheckUtils]: 43: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 17:04:45,967 INFO L273 TraceCheckUtils]: 44: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {2716#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16)))))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} is VALID [2018-11-14 17:04:45,969 INFO L273 TraceCheckUtils]: 45: Hoare triple {2716#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16)))))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} assume true; {2716#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16)))))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} is VALID [2018-11-14 17:04:45,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {2716#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16)))))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2717#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))))} is VALID [2018-11-14 17:04:45,971 INFO L273 TraceCheckUtils]: 47: Hoare triple {2717#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))))} ~i~0 := 0; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 17:04:45,973 INFO L273 TraceCheckUtils]: 48: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume true; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 17:04:45,973 INFO L273 TraceCheckUtils]: 49: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 17:04:45,975 INFO L273 TraceCheckUtils]: 50: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume #t~short30; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 17:04:45,975 INFO L256 TraceCheckUtils]: 51: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2702#true} is VALID [2018-11-14 17:04:45,975 INFO L273 TraceCheckUtils]: 52: Hoare triple {2702#true} ~cond := #in~cond; {2702#true} is VALID [2018-11-14 17:04:45,975 INFO L273 TraceCheckUtils]: 53: Hoare triple {2702#true} assume !(~cond == 0); {2702#true} is VALID [2018-11-14 17:04:45,976 INFO L273 TraceCheckUtils]: 54: Hoare triple {2702#true} assume true; {2702#true} is VALID [2018-11-14 17:04:45,982 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2702#true} {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} #167#return; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 17:04:45,985 INFO L273 TraceCheckUtils]: 56: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} havoc #t~short30;havoc #t~mem28;havoc #t~mem29; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 17:04:45,988 INFO L273 TraceCheckUtils]: 57: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {2719#(<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-14 17:04:45,991 INFO L273 TraceCheckUtils]: 58: Hoare triple {2719#(<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0))))} assume true; {2719#(<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-14 17:04:45,993 INFO L273 TraceCheckUtils]: 59: Hoare triple {2719#(<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2720#|main_#t~short30|} is VALID [2018-11-14 17:04:45,996 INFO L273 TraceCheckUtils]: 60: Hoare triple {2720#|main_#t~short30|} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {2703#false} is VALID [2018-11-14 17:04:45,996 INFO L256 TraceCheckUtils]: 61: Hoare triple {2703#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2703#false} is VALID [2018-11-14 17:04:45,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {2703#false} ~cond := #in~cond; {2703#false} is VALID [2018-11-14 17:04:45,996 INFO L273 TraceCheckUtils]: 63: Hoare triple {2703#false} assume ~cond == 0; {2703#false} is VALID [2018-11-14 17:04:45,996 INFO L273 TraceCheckUtils]: 64: Hoare triple {2703#false} assume !false; {2703#false} is VALID [2018-11-14 17:04:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:04:46,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:04:46,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:04:46,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:46,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:04:46,194 INFO L477 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 16 treesize of output 13 [2018-11-14 17:04:46,199 INFO L477 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 13 treesize of output 12 [2018-11-14 17:04:46,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-14 17:04:46,219 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:46,279 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:04:46,281 INFO L477 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 151 treesize of output 222 [2018-11-14 17:04:46,498 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-11-14 17:04:46,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,633 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 101 [2018-11-14 17:04:46,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 71 [2018-11-14 17:04:46,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-11-14 17:04:46,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-11-14 17:04:46,708 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,730 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:157, output treesize:16 [2018-11-14 17:04:46,849 INFO L477 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 26 treesize of output 21 [2018-11-14 17:04:46,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-14 17:04:46,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:46,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-14 17:04:46,884 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:46,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:04:46,906 INFO L477 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 273 treesize of output 466 [2018-11-14 17:04:46,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 153 [2018-11-14 17:04:46,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:46,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 111 [2018-11-14 17:04:47,545 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-14 17:04:47,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 80 [2018-11-14 17:04:47,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-11-14 17:04:47,577 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:47,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:47,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 119 [2018-11-14 17:04:47,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,638 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 68 [2018-11-14 17:04:47,649 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:47,661 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:47,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:04:47,680 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:47,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:47,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:47,694 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:282, output treesize:16 [2018-11-14 17:04:47,697 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:47,731 INFO L477 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 26 treesize of output 21 [2018-11-14 17:04:47,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-14 17:04:47,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:47,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:47,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:47,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-14 17:04:47,765 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:47,945 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:04:47,946 INFO L477 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 273 treesize of output 466 [2018-11-14 17:04:47,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:47,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 153 [2018-11-14 17:04:48,016 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 96 [2018-11-14 17:04:48,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 74 [2018-11-14 17:04:48,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-11-14 17:04:48,086 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,102 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,114 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:282, output treesize:16 [2018-11-14 17:04:48,117 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:48,147 INFO L477 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 26 treesize of output 21 [2018-11-14 17:04:48,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 43 [2018-11-14 17:04:48,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-14 17:04:48,242 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:04:48,243 INFO L477 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 285 treesize of output 476 [2018-11-14 17:04:48,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 217 [2018-11-14 17:04:48,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,336 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,340 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,345 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 156 [2018-11-14 17:04:48,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 138 [2018-11-14 17:04:48,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:04:48,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 89 [2018-11-14 17:04:48,455 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,471 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:48,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:04:48,505 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:294, output treesize:31 [2018-11-14 17:04:49,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {2702#true} call ULTIMATE.init(); {2702#true} is VALID [2018-11-14 17:04:49,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {2702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2702#true} is VALID [2018-11-14 17:04:49,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {2702#true} assume true; {2702#true} is VALID [2018-11-14 17:04:49,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2702#true} {2702#true} #163#return; {2702#true} is VALID [2018-11-14 17:04:49,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {2702#true} call #t~ret31 := main(); {2702#true} is VALID [2018-11-14 17:04:49,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {2702#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2702#true} is VALID [2018-11-14 17:04:49,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {2702#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,009 INFO L273 TraceCheckUtils]: 7: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume true; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume true; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} ~i~0 := 1; {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume true; {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 17:04:49,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {2780#(and (<= main_~MINVAL~0 2) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {2780#(and (<= main_~MINVAL~0 2) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,021 INFO L273 TraceCheckUtils]: 21: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,021 INFO L273 TraceCheckUtils]: 22: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,024 INFO L273 TraceCheckUtils]: 26: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,025 INFO L273 TraceCheckUtils]: 27: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,026 INFO L273 TraceCheckUtils]: 28: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,027 INFO L273 TraceCheckUtils]: 29: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,028 INFO L273 TraceCheckUtils]: 30: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,029 INFO L273 TraceCheckUtils]: 31: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,029 INFO L273 TraceCheckUtils]: 32: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,030 INFO L273 TraceCheckUtils]: 33: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,032 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,033 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,033 INFO L273 TraceCheckUtils]: 36: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,034 INFO L273 TraceCheckUtils]: 37: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,035 INFO L273 TraceCheckUtils]: 38: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,036 INFO L273 TraceCheckUtils]: 39: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,036 INFO L273 TraceCheckUtils]: 40: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,037 INFO L273 TraceCheckUtils]: 41: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,039 INFO L273 TraceCheckUtils]: 42: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {2855#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,040 INFO L273 TraceCheckUtils]: 43: Hoare triple {2855#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (= |main_~#volArray~0.offset| 0))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,041 INFO L273 TraceCheckUtils]: 44: Hoare triple {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,042 INFO L273 TraceCheckUtils]: 45: Hoare triple {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} assume true; {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:04:49,045 INFO L273 TraceCheckUtils]: 47: Hoare triple {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 17:04:49,046 INFO L273 TraceCheckUtils]: 48: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} assume true; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 17:04:49,048 INFO L273 TraceCheckUtils]: 49: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 17:04:49,049 INFO L273 TraceCheckUtils]: 50: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} assume #t~short30; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 17:04:49,051 INFO L256 TraceCheckUtils]: 51: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} is VALID [2018-11-14 17:04:49,051 INFO L273 TraceCheckUtils]: 52: Hoare triple {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} ~cond := #in~cond; {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} is VALID [2018-11-14 17:04:49,052 INFO L273 TraceCheckUtils]: 53: Hoare triple {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} assume !(~cond == 0); {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} is VALID [2018-11-14 17:04:49,053 INFO L273 TraceCheckUtils]: 54: Hoare triple {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} assume true; {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} is VALID [2018-11-14 17:04:49,054 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} #167#return; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 17:04:49,058 INFO L273 TraceCheckUtils]: 56: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} havoc #t~short30;havoc #t~mem28;havoc #t~mem29; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 17:04:49,059 INFO L273 TraceCheckUtils]: 57: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {2904#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 17:04:49,060 INFO L273 TraceCheckUtils]: 58: Hoare triple {2904#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} assume true; {2904#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 17:04:49,061 INFO L273 TraceCheckUtils]: 59: Hoare triple {2904#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2720#|main_#t~short30|} is VALID [2018-11-14 17:04:49,061 INFO L273 TraceCheckUtils]: 60: Hoare triple {2720#|main_#t~short30|} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {2703#false} is VALID [2018-11-14 17:04:49,061 INFO L256 TraceCheckUtils]: 61: Hoare triple {2703#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2703#false} is VALID [2018-11-14 17:04:49,061 INFO L273 TraceCheckUtils]: 62: Hoare triple {2703#false} ~cond := #in~cond; {2703#false} is VALID [2018-11-14 17:04:49,061 INFO L273 TraceCheckUtils]: 63: Hoare triple {2703#false} assume ~cond == 0; {2703#false} is VALID [2018-11-14 17:04:49,061 INFO L273 TraceCheckUtils]: 64: Hoare triple {2703#false} assume !false; {2703#false} is VALID [2018-11-14 17:04:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:04:49,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:04:49,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 29 [2018-11-14 17:04:49,100 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-14 17:04:49,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:49,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 17:04:49,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:49,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 17:04:49,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 17:04:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:04:49,482 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 29 states. [2018-11-14 17:04:50,395 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-11-14 17:04:51,083 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 35 [2018-11-14 17:04:52,047 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2018-11-14 17:04:55,302 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 39 [2018-11-14 17:04:55,841 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 36 [2018-11-14 17:04:57,524 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 41 [2018-11-14 17:04:58,870 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2018-11-14 17:05:00,951 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2018-11-14 17:05:02,554 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 42 [2018-11-14 17:05:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:03,746 INFO L93 Difference]: Finished difference Result 183 states and 219 transitions. [2018-11-14 17:05:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 17:05:03,746 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-14 17:05:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:05:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 211 transitions. [2018-11-14 17:05:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:05:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 211 transitions. [2018-11-14 17:05:03,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 211 transitions. [2018-11-14 17:05:04,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:04,268 INFO L225 Difference]: With dead ends: 183 [2018-11-14 17:05:04,268 INFO L226 Difference]: Without dead ends: 166 [2018-11-14 17:05:04,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 56 SyntacticMatches, 15 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=882, Invalid=2778, Unknown=0, NotChecked=0, Total=3660 [2018-11-14 17:05:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-14 17:05:04,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 74. [2018-11-14 17:05:04,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:04,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 74 states. [2018-11-14 17:05:04,447 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 74 states. [2018-11-14 17:05:04,447 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 74 states. [2018-11-14 17:05:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:04,455 INFO L93 Difference]: Finished difference Result 166 states and 199 transitions. [2018-11-14 17:05:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2018-11-14 17:05:04,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:04,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:04,456 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 166 states. [2018-11-14 17:05:04,456 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 166 states. [2018-11-14 17:05:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:04,463 INFO L93 Difference]: Finished difference Result 166 states and 199 transitions. [2018-11-14 17:05:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2018-11-14 17:05:04,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:04,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:04,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:04,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 17:05:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-11-14 17:05:04,467 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 65 [2018-11-14 17:05:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:04,468 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-14 17:05:04,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 17:05:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-14 17:05:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 17:05:04,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:04,469 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:05:04,469 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:04,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1678056106, now seen corresponding path program 2 times [2018-11-14 17:05:04,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:04,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:04,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:04,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:04,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:05,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {3655#true} call ULTIMATE.init(); {3655#true} is VALID [2018-11-14 17:05:05,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {3655#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3655#true} is VALID [2018-11-14 17:05:05,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2018-11-14 17:05:05,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #163#return; {3655#true} is VALID [2018-11-14 17:05:05,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {3655#true} call #t~ret31 := main(); {3655#true} is VALID [2018-11-14 17:05:05,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {3655#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3655#true} is VALID [2018-11-14 17:05:05,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {3655#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {3657#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 17:05:05,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {3657#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 17:05:05,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} assume true; {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 17:05:05,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 17:05:05,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,760 INFO L273 TraceCheckUtils]: 19: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,762 INFO L273 TraceCheckUtils]: 21: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,763 INFO L273 TraceCheckUtils]: 22: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 17:05:05,764 INFO L273 TraceCheckUtils]: 23: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {3660#(and (or (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= 0 ~CELLCOUNT~0)) (or (and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {3660#(and (or (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= 0 ~CELLCOUNT~0)) (or (and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} assume true; {3660#(and (or (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= 0 ~CELLCOUNT~0)) (or (and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,766 INFO L273 TraceCheckUtils]: 25: Hoare triple {3660#(and (or (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= 0 ~CELLCOUNT~0)) (or (and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3661#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {3661#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {3662#(and (= |main_~#volArray~0.offset| 0) (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))))} is VALID [2018-11-14 17:05:05,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {3662#(and (= |main_~#volArray~0.offset| 0) (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {3662#(and (= |main_~#volArray~0.offset| 0) (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))))} is VALID [2018-11-14 17:05:05,771 INFO L273 TraceCheckUtils]: 28: Hoare triple {3662#(and (= |main_~#volArray~0.offset| 0) (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {3663#(and (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39))))} is VALID [2018-11-14 17:05:05,772 INFO L273 TraceCheckUtils]: 29: Hoare triple {3663#(and (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39))))} assume true; {3663#(and (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39))))} is VALID [2018-11-14 17:05:05,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {3663#(and (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,775 INFO L273 TraceCheckUtils]: 32: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume true; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,777 INFO L273 TraceCheckUtils]: 34: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,778 INFO L273 TraceCheckUtils]: 35: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,778 INFO L273 TraceCheckUtils]: 36: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,779 INFO L273 TraceCheckUtils]: 37: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume true; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,780 INFO L273 TraceCheckUtils]: 38: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,780 INFO L273 TraceCheckUtils]: 39: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume true; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,783 INFO L273 TraceCheckUtils]: 41: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,797 INFO L273 TraceCheckUtils]: 42: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,798 INFO L273 TraceCheckUtils]: 43: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,798 INFO L273 TraceCheckUtils]: 44: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,799 INFO L273 TraceCheckUtils]: 45: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume true; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,799 INFO L273 TraceCheckUtils]: 46: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,800 INFO L273 TraceCheckUtils]: 47: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:05,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume true; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:05,801 INFO L273 TraceCheckUtils]: 49: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:05,802 INFO L273 TraceCheckUtils]: 50: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume #t~short30; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:05,802 INFO L256 TraceCheckUtils]: 51: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3655#true} is VALID [2018-11-14 17:05:05,802 INFO L273 TraceCheckUtils]: 52: Hoare triple {3655#true} ~cond := #in~cond; {3655#true} is VALID [2018-11-14 17:05:05,802 INFO L273 TraceCheckUtils]: 53: Hoare triple {3655#true} assume !(~cond == 0); {3655#true} is VALID [2018-11-14 17:05:05,802 INFO L273 TraceCheckUtils]: 54: Hoare triple {3655#true} assume true; {3655#true} is VALID [2018-11-14 17:05:05,804 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {3655#true} {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #167#return; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:05,804 INFO L273 TraceCheckUtils]: 56: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} havoc #t~short30;havoc #t~mem28;havoc #t~mem29; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:05,805 INFO L273 TraceCheckUtils]: 57: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 17:05:05,806 INFO L273 TraceCheckUtils]: 58: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} assume true; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 17:05:05,807 INFO L273 TraceCheckUtils]: 59: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 17:05:05,808 INFO L273 TraceCheckUtils]: 60: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} assume #t~short30; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 17:05:05,808 INFO L256 TraceCheckUtils]: 61: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3655#true} is VALID [2018-11-14 17:05:05,808 INFO L273 TraceCheckUtils]: 62: Hoare triple {3655#true} ~cond := #in~cond; {3655#true} is VALID [2018-11-14 17:05:05,808 INFO L273 TraceCheckUtils]: 63: Hoare triple {3655#true} assume !(~cond == 0); {3655#true} is VALID [2018-11-14 17:05:05,808 INFO L273 TraceCheckUtils]: 64: Hoare triple {3655#true} assume true; {3655#true} is VALID [2018-11-14 17:05:05,809 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {3655#true} {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} #167#return; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 17:05:05,810 INFO L273 TraceCheckUtils]: 66: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} havoc #t~short30;havoc #t~mem28;havoc #t~mem29; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 17:05:05,811 INFO L273 TraceCheckUtils]: 67: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {3667#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,812 INFO L273 TraceCheckUtils]: 68: Hoare triple {3667#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= |main_~#volArray~0.offset| 0))} assume true; {3667#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:05,813 INFO L273 TraceCheckUtils]: 69: Hoare triple {3667#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3668#(and (= |main_~#volArray~0.offset| 0) |main_#t~short30|)} is VALID [2018-11-14 17:05:05,814 INFO L273 TraceCheckUtils]: 70: Hoare triple {3668#(and (= |main_~#volArray~0.offset| 0) |main_#t~short30|)} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {3656#false} is VALID [2018-11-14 17:05:05,814 INFO L256 TraceCheckUtils]: 71: Hoare triple {3656#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3656#false} is VALID [2018-11-14 17:05:05,814 INFO L273 TraceCheckUtils]: 72: Hoare triple {3656#false} ~cond := #in~cond; {3656#false} is VALID [2018-11-14 17:05:05,814 INFO L273 TraceCheckUtils]: 73: Hoare triple {3656#false} assume ~cond == 0; {3656#false} is VALID [2018-11-14 17:05:05,814 INFO L273 TraceCheckUtils]: 74: Hoare triple {3656#false} assume !false; {3656#false} is VALID [2018-11-14 17:05:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:05:05,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:05:05,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:05:05,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:05:05,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:05:05,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:05:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:05,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:05:06,030 INFO L477 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 16 treesize of output 13 [2018-11-14 17:05:06,037 INFO L477 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 13 treesize of output 12 [2018-11-14 17:05:06,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-14 17:05:06,058 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:06,099 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:05:06,100 INFO L477 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 151 treesize of output 222 [2018-11-14 17:05:06,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 101 [2018-11-14 17:05:06,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 71 [2018-11-14 17:05:06,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-11-14 17:05:06,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-11-14 17:05:06,251 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,265 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,271 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,286 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:157, output treesize:16 [2018-11-14 17:05:06,493 INFO L477 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 26 treesize of output 21 [2018-11-14 17:05:06,498 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-14 17:05:06,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-14 17:05:06,524 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:06,544 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:05:06,545 INFO L477 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 273 treesize of output 466 [2018-11-14 17:05:06,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,572 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,573 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 164 [2018-11-14 17:05:06,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 93 [2018-11-14 17:05:06,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 81 [2018-11-14 17:05:06,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2018-11-14 17:05:06,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-11-14 17:05:06,736 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,745 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,750 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,765 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:282, output treesize:16 [2018-11-14 17:05:06,770 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:06,820 INFO L477 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 26 treesize of output 21 [2018-11-14 17:05:06,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 43 [2018-11-14 17:05:06,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:06,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-14 17:05:06,913 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:05:06,915 INFO L477 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 285 treesize of output 476 [2018-11-14 17:05:06,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:06,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 228 [2018-11-14 17:05:07,007 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,010 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,012 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,016 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 157 [2018-11-14 17:05:07,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,066 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 141 [2018-11-14 17:05:07,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 135 [2018-11-14 17:05:07,135 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:07,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:07,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 89 [2018-11-14 17:05:07,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:07,216 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:07,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:07,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:07,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:07,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:05:07,249 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:294, output treesize:31 [2018-11-14 17:05:07,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {3655#true} call ULTIMATE.init(); {3655#true} is VALID [2018-11-14 17:05:07,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {3655#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3655#true} is VALID [2018-11-14 17:05:07,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2018-11-14 17:05:07,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #163#return; {3655#true} is VALID [2018-11-14 17:05:07,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {3655#true} call #t~ret31 := main(); {3655#true} is VALID [2018-11-14 17:05:07,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {3655#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3655#true} is VALID [2018-11-14 17:05:07,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {3655#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume true; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,928 INFO L273 TraceCheckUtils]: 13: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume true; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,929 INFO L273 TraceCheckUtils]: 15: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} ~i~0 := 1; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume true; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,931 INFO L273 TraceCheckUtils]: 19: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,931 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume true; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} ~i~0 := 1; {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume true; {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:07,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {3752#(and (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:07,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {3752#(and (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,939 INFO L273 TraceCheckUtils]: 29: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,940 INFO L273 TraceCheckUtils]: 30: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,940 INFO L273 TraceCheckUtils]: 31: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} ~i~0 := 1; {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,941 INFO L273 TraceCheckUtils]: 32: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,942 INFO L273 TraceCheckUtils]: 33: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,943 INFO L273 TraceCheckUtils]: 34: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,944 INFO L273 TraceCheckUtils]: 35: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,945 INFO L273 TraceCheckUtils]: 36: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,947 INFO L273 TraceCheckUtils]: 38: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,948 INFO L273 TraceCheckUtils]: 39: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} ~i~0 := 1; {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,948 INFO L273 TraceCheckUtils]: 40: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,949 INFO L273 TraceCheckUtils]: 41: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,951 INFO L273 TraceCheckUtils]: 42: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {3803#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,952 INFO L273 TraceCheckUtils]: 43: Hoare triple {3803#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,953 INFO L273 TraceCheckUtils]: 44: Hoare triple {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,954 INFO L273 TraceCheckUtils]: 45: Hoare triple {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,955 INFO L273 TraceCheckUtils]: 46: Hoare triple {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,957 INFO L273 TraceCheckUtils]: 47: Hoare triple {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} ~i~0 := 0; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:07,958 INFO L273 TraceCheckUtils]: 48: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} assume true; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:07,959 INFO L273 TraceCheckUtils]: 49: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:07,960 INFO L273 TraceCheckUtils]: 50: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} assume #t~short30; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:07,962 INFO L256 TraceCheckUtils]: 51: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 17:05:07,963 INFO L273 TraceCheckUtils]: 52: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} ~cond := #in~cond; {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 17:05:07,963 INFO L273 TraceCheckUtils]: 53: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} assume !(~cond == 0); {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 17:05:07,964 INFO L273 TraceCheckUtils]: 54: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} assume true; {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 17:05:07,965 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} #167#return; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:07,966 INFO L273 TraceCheckUtils]: 56: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} havoc #t~short30;havoc #t~mem28;havoc #t~mem29; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:07,968 INFO L273 TraceCheckUtils]: 57: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,970 INFO L273 TraceCheckUtils]: 59: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,971 INFO L273 TraceCheckUtils]: 60: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume #t~short30; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,973 INFO L256 TraceCheckUtils]: 61: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 17:05:07,973 INFO L273 TraceCheckUtils]: 62: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} ~cond := #in~cond; {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 17:05:07,974 INFO L273 TraceCheckUtils]: 63: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} assume !(~cond == 0); {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 17:05:07,974 INFO L273 TraceCheckUtils]: 64: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} assume true; {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 17:05:07,975 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} #167#return; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,976 INFO L273 TraceCheckUtils]: 66: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} havoc #t~short30;havoc #t~mem28;havoc #t~mem29; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,978 INFO L273 TraceCheckUtils]: 67: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {3883#(and (= main_~i~0 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,979 INFO L273 TraceCheckUtils]: 68: Hoare triple {3883#(and (= main_~i~0 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3883#(and (= main_~i~0 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 17:05:07,980 INFO L273 TraceCheckUtils]: 69: Hoare triple {3883#(and (= main_~i~0 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3890#|main_#t~short30|} is VALID [2018-11-14 17:05:07,981 INFO L273 TraceCheckUtils]: 70: Hoare triple {3890#|main_#t~short30|} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {3656#false} is VALID [2018-11-14 17:05:07,981 INFO L256 TraceCheckUtils]: 71: Hoare triple {3656#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3656#false} is VALID [2018-11-14 17:05:07,981 INFO L273 TraceCheckUtils]: 72: Hoare triple {3656#false} ~cond := #in~cond; {3656#false} is VALID [2018-11-14 17:05:07,981 INFO L273 TraceCheckUtils]: 73: Hoare triple {3656#false} assume ~cond == 0; {3656#false} is VALID [2018-11-14 17:05:07,981 INFO L273 TraceCheckUtils]: 74: Hoare triple {3656#false} assume !false; {3656#false} is VALID [2018-11-14 17:05:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:05:08,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:05:08,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-14 17:05:08,029 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-11-14 17:05:08,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:08,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:05:08,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:08,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:05:08,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:05:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:05:08,203 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 26 states. [2018-11-14 17:05:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:14,365 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2018-11-14 17:05:14,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 17:05:14,365 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-11-14 17:05:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:05:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 169 transitions. [2018-11-14 17:05:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:05:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 169 transitions. [2018-11-14 17:05:14,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 169 transitions. [2018-11-14 17:05:14,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:14,702 INFO L225 Difference]: With dead ends: 165 [2018-11-14 17:05:14,702 INFO L226 Difference]: Without dead ends: 117 [2018-11-14 17:05:14,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=406, Invalid=1400, Unknown=0, NotChecked=0, Total=1806 [2018-11-14 17:05:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-14 17:05:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 80. [2018-11-14 17:05:14,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:14,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 80 states. [2018-11-14 17:05:14,969 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 80 states. [2018-11-14 17:05:14,969 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 80 states. [2018-11-14 17:05:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:14,975 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2018-11-14 17:05:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2018-11-14 17:05:14,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:14,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:14,976 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 117 states. [2018-11-14 17:05:14,976 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 117 states. [2018-11-14 17:05:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:14,980 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2018-11-14 17:05:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2018-11-14 17:05:14,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:14,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:14,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:14,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 17:05:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-11-14 17:05:14,983 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 75 [2018-11-14 17:05:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:14,983 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-11-14 17:05:14,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:05:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-11-14 17:05:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 17:05:14,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:14,985 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:05:14,985 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:14,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1680514337, now seen corresponding path program 3 times [2018-11-14 17:05:14,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:14,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:14,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:14,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:05:14,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:15,805 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2018-11-14 17:05:16,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {4483#true} call ULTIMATE.init(); {4483#true} is VALID [2018-11-14 17:05:16,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {4483#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {4483#true} is VALID [2018-11-14 17:05:16,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {4483#true} assume true; {4483#true} is VALID [2018-11-14 17:05:16,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4483#true} {4483#true} #163#return; {4483#true} is VALID [2018-11-14 17:05:16,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {4483#true} call #t~ret31 := main(); {4483#true} is VALID [2018-11-14 17:05:16,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {4483#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {4483#true} is VALID [2018-11-14 17:05:16,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {4483#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {4485#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:05:16,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {4485#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:05:16,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} assume true; {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:05:16,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:05:16,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:05:16,704 INFO L273 TraceCheckUtils]: 11: Hoare triple {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:05:16,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4487#(and (or (and (<= (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) (div (+ ~CELLCOUNT~0 3) 5)) (or (and (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0) (= 20 (* 20 (div (+ ~CELLCOUNT~0 3) 5)))) (<= (+ (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is INVALID [2018-11-14 17:05:16,707 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: invalid Hoare triple in Craig at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 17:05:16,711 INFO L168 Benchmark]: Toolchain (without parser) took 58533.16 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -353.1 MB). Peak memory consumption was 927.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:05:16,711 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-14 17:05:16,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.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-14 17:05:16,712 INFO L168 Benchmark]: Boogie Preprocessor took 166.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:05:16,712 INFO L168 Benchmark]: RCFGBuilder took 1331.76 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:05:16,713 INFO L168 Benchmark]: TraceAbstraction took 56584.74 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 530.1 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 392.8 MB). Peak memory consumption was 922.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:05:16,715 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 445.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 Preprocessor took 166.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1331.76 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56584.74 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 530.1 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 392.8 MB). Peak memory consumption was 922.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: invalid Hoare triple in Craig de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: invalid Hoare triple in Craig: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...