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/pr4_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:11:59,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:11:59,582 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:11:59,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:11:59,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:11:59,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:11:59,603 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:11:59,606 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:11:59,608 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:11:59,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:11:59,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:11:59,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:11:59,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:11:59,612 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:11:59,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:11:59,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:11:59,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:11:59,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:11:59,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:11:59,620 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:11:59,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:11:59,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:11:59,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:11:59,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:11:59,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:11:59,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:11:59,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:11:59,627 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:11:59,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:11:59,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:11:59,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:11:59,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:11:59,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:11:59,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:11:59,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:11:59,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:11:59,632 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-18 23:11:59,651 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:11:59,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:11:59,652 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:11:59,655 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:11:59,656 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:11:59,656 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:11:59,656 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:11:59,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:11:59,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:11:59,657 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:11:59,658 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:11:59,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:11:59,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:11:59,658 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:11:59,658 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:11:59,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:11:59,659 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:11:59,659 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:11:59,659 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:11:59,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:11:59,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:11:59,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:11:59,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:11:59,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:11:59,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:11:59,661 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:11:59,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:11:59,662 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:11:59,662 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:11:59,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:11:59,662 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:11:59,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:11:59,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:11:59,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:11:59,749 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:11:59,749 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:11:59,750 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr4_true-unreach-call.i [2018-11-18 23:11:59,815 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27354b44/8748cfcde4a64c91bfdd40765f78bdea/FLAG041a972de [2018-11-18 23:12:00,289 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:12:00,290 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr4_true-unreach-call.i [2018-11-18 23:12:00,297 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27354b44/8748cfcde4a64c91bfdd40765f78bdea/FLAG041a972de [2018-11-18 23:12:00,627 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27354b44/8748cfcde4a64c91bfdd40765f78bdea [2018-11-18 23:12:00,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:12:00,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:12:00,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:12:00,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:12:00,645 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:12:00,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:12:00" (1/1) ... [2018-11-18 23:12:00,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88b6059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:00, skipping insertion in model container [2018-11-18 23:12:00,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:12:00" (1/1) ... [2018-11-18 23:12:00,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:12:00,689 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:12:00,973 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:12:00,979 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:12:01,025 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:12:01,058 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:12:01,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:01 WrapperNode [2018-11-18 23:12:01,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:12:01,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:12:01,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:12:01,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:12:01,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:01" (1/1) ... [2018-11-18 23:12:01,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:01" (1/1) ... [2018-11-18 23:12:01,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:01" (1/1) ... [2018-11-18 23:12:01,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:01" (1/1) ... [2018-11-18 23:12:01,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:01" (1/1) ... [2018-11-18 23:12:01,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:01" (1/1) ... [2018-11-18 23:12:01,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:01" (1/1) ... [2018-11-18 23:12:01,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:12:01,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:12:01,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:12:01,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:12:01,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:01" (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-18 23:12:01,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:12:01,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:12:01,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:12:01,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:12:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:12:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 23:12:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:12:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:12:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:12:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:12:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:12:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:12:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:12:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:12:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:12:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:12:02,055 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:12:02,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:12:02 BoogieIcfgContainer [2018-11-18 23:12:02,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:12:02,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:12:02,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:12:02,060 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:12:02,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:12:00" (1/3) ... [2018-11-18 23:12:02,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c35c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:12:02, skipping insertion in model container [2018-11-18 23:12:02,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:01" (2/3) ... [2018-11-18 23:12:02,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c35c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:12:02, skipping insertion in model container [2018-11-18 23:12:02,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:12:02" (3/3) ... [2018-11-18 23:12:02,064 INFO L112 eAbstractionObserver]: Analyzing ICFG pr4_true-unreach-call.i [2018-11-18 23:12:02,074 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:12:02,082 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:12:02,100 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:12:02,132 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:12:02,133 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:12:02,133 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:12:02,133 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:12:02,134 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:12:02,134 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:12:02,134 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:12:02,134 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:12:02,135 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:12:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-18 23:12:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:12:02,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:02,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:12:02,161 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:02,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:02,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1675708158, now seen corresponding path program 1 times [2018-11-18 23:12:02,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:02,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:02,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:02,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:02,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:02,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-18 23:12:02,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {37#true} is VALID [2018-11-18 23:12:02,378 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-18 23:12:02,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #91#return; {37#true} is VALID [2018-11-18 23:12:02,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret7 := main(); {37#true} is VALID [2018-11-18 23:12:02,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2018-11-18 23:12:02,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {37#true} is VALID [2018-11-18 23:12:02,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {37#true} is VALID [2018-11-18 23:12:02,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-18 23:12:02,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-18 23:12:02,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-18 23:12:02,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {38#false} is VALID [2018-11-18 23:12:02,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {38#false} is VALID [2018-11-18 23:12:02,382 INFO L256 TraceCheckUtils]: 13: Hoare triple {38#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {38#false} is VALID [2018-11-18 23:12:02,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-18 23:12:02,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2018-11-18 23:12:02,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-18 23:12:02,387 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-18 23:12:02,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:12:02,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:12:02,396 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:12:02,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:02,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:12:02,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:02,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:12:02,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:12:02,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:12:02,614 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-18 23:12:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:02,751 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2018-11-18 23:12:02,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:12:02,751 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:12:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:12:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2018-11-18 23:12:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:12:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2018-11-18 23:12:02,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2018-11-18 23:12:03,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:03,036 INFO L225 Difference]: With dead ends: 53 [2018-11-18 23:12:03,037 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 23:12:03,040 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-18 23:12:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 23:12:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-18 23:12:03,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:03,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-18 23:12:03,088 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 23:12:03,088 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 23:12:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:03,093 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-18 23:12:03,093 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-18 23:12:03,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:03,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:03,094 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 23:12:03,095 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 23:12:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:03,099 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-18 23:12:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-18 23:12:03,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:03,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:03,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:03,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 23:12:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-18 23:12:03,106 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 17 [2018-11-18 23:12:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:03,107 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-18 23:12:03,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:12:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-18 23:12:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:12:03,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:03,109 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:12:03,109 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:03,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:03,110 INFO L82 PathProgramCache]: Analyzing trace with hash -391908819, now seen corresponding path program 1 times [2018-11-18 23:12:03,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:03,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:03,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:03,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:03,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:03,463 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2018-11-18 23:12:03,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2018-11-18 23:12:03,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {197#true} is VALID [2018-11-18 23:12:03,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#true} assume true; {197#true} is VALID [2018-11-18 23:12:03,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} #91#return; {197#true} is VALID [2018-11-18 23:12:03,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {197#true} call #t~ret7 := main(); {197#true} is VALID [2018-11-18 23:12:03,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {197#true} is VALID [2018-11-18 23:12:03,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {199#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-18 23:12:03,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {199#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {200#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-18 23:12:03,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {200#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume true; {200#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-18 23:12:03,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {200#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {198#false} is VALID [2018-11-18 23:12:03,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#false} ~i~0 := 0; {198#false} is VALID [2018-11-18 23:12:03,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#false} assume true; {198#false} is VALID [2018-11-18 23:12:03,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {198#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {198#false} is VALID [2018-11-18 23:12:03,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {198#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {198#false} is VALID [2018-11-18 23:12:03,486 INFO L256 TraceCheckUtils]: 14: Hoare triple {198#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {198#false} is VALID [2018-11-18 23:12:03,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {198#false} ~cond := #in~cond; {198#false} is VALID [2018-11-18 23:12:03,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#false} assume 0 == ~cond; {198#false} is VALID [2018-11-18 23:12:03,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#false} assume !false; {198#false} is VALID [2018-11-18 23:12:03,490 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-18 23:12:03,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:12:03,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:12:03,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 23:12:03,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:03,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:12:03,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:03,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:12:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:12:03,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:12:03,647 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2018-11-18 23:12:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:04,205 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2018-11-18 23:12:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:12:04,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 23:12:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:12:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-18 23:12:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:12:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-18 23:12:04,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-18 23:12:04,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:04,339 INFO L225 Difference]: With dead ends: 48 [2018-11-18 23:12:04,339 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 23:12:04,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:12:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 23:12:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-11-18 23:12:04,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:04,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2018-11-18 23:12:04,358 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2018-11-18 23:12:04,358 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2018-11-18 23:12:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:04,361 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2018-11-18 23:12:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2018-11-18 23:12:04,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:04,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:04,363 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2018-11-18 23:12:04,363 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2018-11-18 23:12:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:04,366 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2018-11-18 23:12:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2018-11-18 23:12:04,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:04,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:04,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:04,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:04,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 23:12:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-18 23:12:04,374 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2018-11-18 23:12:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:04,374 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-18 23:12:04,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:12:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-18 23:12:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:12:04,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:04,379 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] [2018-11-18 23:12:04,379 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:04,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:04,380 INFO L82 PathProgramCache]: Analyzing trace with hash 721099660, now seen corresponding path program 1 times [2018-11-18 23:12:04,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:04,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:04,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:04,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:04,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:04,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {372#true} call ULTIMATE.init(); {372#true} is VALID [2018-11-18 23:12:04,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {372#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {372#true} is VALID [2018-11-18 23:12:04,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {372#true} assume true; {372#true} is VALID [2018-11-18 23:12:04,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {372#true} {372#true} #91#return; {372#true} is VALID [2018-11-18 23:12:04,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {372#true} call #t~ret7 := main(); {372#true} is VALID [2018-11-18 23:12:04,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {372#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {372#true} is VALID [2018-11-18 23:12:04,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {372#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} is VALID [2018-11-18 23:12:04,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} is VALID [2018-11-18 23:12:04,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} assume true; {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} is VALID [2018-11-18 23:12:04,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} is VALID [2018-11-18 23:12:04,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {375#(<= (+ main_~MINVAL~0 2) main_~CCCELVOL3~0)} is VALID [2018-11-18 23:12:04,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#(<= (+ main_~MINVAL~0 2) main_~CCCELVOL3~0)} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {373#false} is VALID [2018-11-18 23:12:04,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {373#false} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {373#false} is VALID [2018-11-18 23:12:04,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {373#false} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {373#false} is VALID [2018-11-18 23:12:04,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {373#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {373#false} is VALID [2018-11-18 23:12:04,569 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#false} assume true; {373#false} is VALID [2018-11-18 23:12:04,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {373#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {373#false} is VALID [2018-11-18 23:12:04,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {373#false} ~i~0 := 0; {373#false} is VALID [2018-11-18 23:12:04,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {373#false} assume true; {373#false} is VALID [2018-11-18 23:12:04,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {373#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {373#false} is VALID [2018-11-18 23:12:04,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {373#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {373#false} is VALID [2018-11-18 23:12:04,571 INFO L256 TraceCheckUtils]: 21: Hoare triple {373#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {373#false} is VALID [2018-11-18 23:12:04,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {373#false} ~cond := #in~cond; {373#false} is VALID [2018-11-18 23:12:04,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {373#false} assume 0 == ~cond; {373#false} is VALID [2018-11-18 23:12:04,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {373#false} assume !false; {373#false} is VALID [2018-11-18 23:12:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:04,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:12:04,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:12:04,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:12:04,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:04,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:12:04,621 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-18 23:12:04,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:12:04,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:12:04,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:12:04,622 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 4 states. [2018-11-18 23:12:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:04,937 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2018-11-18 23:12:04,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:12:04,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:12:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:12:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-18 23:12:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:12:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-18 23:12:04,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2018-11-18 23:12:05,119 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-18 23:12:05,122 INFO L225 Difference]: With dead ends: 64 [2018-11-18 23:12:05,123 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 23:12:05,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:12:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 23:12:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-18 23:12:05,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:05,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 37 states. [2018-11-18 23:12:05,174 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 37 states. [2018-11-18 23:12:05,175 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 37 states. [2018-11-18 23:12:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:05,179 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-18 23:12:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-18 23:12:05,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:05,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:05,180 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 44 states. [2018-11-18 23:12:05,181 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 44 states. [2018-11-18 23:12:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:05,184 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-18 23:12:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-18 23:12:05,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:05,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:05,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:05,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 23:12:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-18 23:12:05,188 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 25 [2018-11-18 23:12:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:05,188 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-18 23:12:05,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:12:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-18 23:12:05,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:12:05,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:05,190 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] [2018-11-18 23:12:05,190 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:05,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:05,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1732216910, now seen corresponding path program 1 times [2018-11-18 23:12:05,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:05,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:05,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:05,808 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2018-11-18 23:12:06,144 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-18 23:12:06,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2018-11-18 23:12:06,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {595#true} is VALID [2018-11-18 23:12:06,318 INFO L273 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2018-11-18 23:12:06,318 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #91#return; {595#true} is VALID [2018-11-18 23:12:06,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret7 := main(); {595#true} is VALID [2018-11-18 23:12:06,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {595#true} is VALID [2018-11-18 23:12:06,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {595#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {597#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:06,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {597#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-18 23:12:06,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume true; {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-18 23:12:06,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-18 23:12:06,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-18 23:12:06,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-18 23:12:06,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-18 23:12:06,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-18 23:12:06,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {600#(and (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:06,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#(and (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {600#(and (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:06,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {600#(and (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-18 23:12:06,340 INFO L273 TraceCheckUtils]: 17: Hoare triple {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 0; {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:06,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume true; {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:06,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {603#(and |main_#t~short6| (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:06,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {603#(and |main_#t~short6| (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {596#false} is VALID [2018-11-18 23:12:06,344 INFO L256 TraceCheckUtils]: 21: Hoare triple {596#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {596#false} is VALID [2018-11-18 23:12:06,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {596#false} ~cond := #in~cond; {596#false} is VALID [2018-11-18 23:12:06,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {596#false} assume 0 == ~cond; {596#false} is VALID [2018-11-18 23:12:06,346 INFO L273 TraceCheckUtils]: 24: Hoare triple {596#false} assume !false; {596#false} is VALID [2018-11-18 23:12:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:06,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:12:06,353 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-18 23:12:06,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:06,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:12:06,650 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-18 23:12:06,662 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-18 23:12:06,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:06,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:06,687 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-18 23:12:06,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-18 23:12:06,691 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:06,862 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 29 treesize of output 24 [2018-11-18 23:12:06,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:06,883 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 24 treesize of output 39 [2018-11-18 23:12:06,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:06,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:06,919 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-18 23:12:06,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-18 23:12:06,923 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:06,972 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 29 treesize of output 24 [2018-11-18 23:12:06,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:06,984 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 24 treesize of output 39 [2018-11-18 23:12:06,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:07,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:07,016 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-18 23:12:07,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-18 23:12:07,020 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:07,054 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 21 treesize of output 16 [2018-11-18 23:12:07,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:07,071 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 16 treesize of output 23 [2018-11-18 23:12:07,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:07,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:07,094 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-18 23:12:07,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-11-18 23:12:07,098 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:07,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2018-11-18 23:12:07,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {595#true} is VALID [2018-11-18 23:12:07,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2018-11-18 23:12:07,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #91#return; {595#true} is VALID [2018-11-18 23:12:07,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret7 := main(); {595#true} is VALID [2018-11-18 23:12:07,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {595#true} is VALID [2018-11-18 23:12:07,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {595#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {625#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-18 23:12:07,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {625#(= |main_~#volArray~0.offset| 0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:07,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:07,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:07,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:07,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:07,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= 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 + 4 * (4 * ~i~0 - 2), 4); {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:07,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-18 23:12:07,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-18 23:12:07,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume true; {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-18 23:12:07,267 INFO L273 TraceCheckUtils]: 16: Hoare triple {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-18 23:12:07,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 0; {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:07,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume true; {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:07,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {667#|main_#t~short6|} is VALID [2018-11-18 23:12:07,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {667#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {596#false} is VALID [2018-11-18 23:12:07,271 INFO L256 TraceCheckUtils]: 21: Hoare triple {596#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {596#false} is VALID [2018-11-18 23:12:07,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {596#false} ~cond := #in~cond; {596#false} is VALID [2018-11-18 23:12:07,272 INFO L273 TraceCheckUtils]: 23: Hoare triple {596#false} assume 0 == ~cond; {596#false} is VALID [2018-11-18 23:12:07,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {596#false} assume !false; {596#false} is VALID [2018-11-18 23:12:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:07,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:12:07,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-11-18 23:12:07,297 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-18 23:12:07,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:07,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 23:12:07,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:07,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 23:12:07,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 23:12:07,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:12:07,371 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 13 states. [2018-11-18 23:12:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:09,692 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-11-18 23:12:09,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 23:12:09,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-18 23:12:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:12:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-18 23:12:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:12:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-18 23:12:09,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2018-11-18 23:12:09,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:09,960 INFO L225 Difference]: With dead ends: 90 [2018-11-18 23:12:09,960 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 23:12:09,961 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-11-18 23:12:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 23:12:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2018-11-18 23:12:10,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:10,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 49 states. [2018-11-18 23:12:10,226 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 49 states. [2018-11-18 23:12:10,227 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 49 states. [2018-11-18 23:12:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:10,235 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2018-11-18 23:12:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2018-11-18 23:12:10,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:10,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:10,237 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 78 states. [2018-11-18 23:12:10,238 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 78 states. [2018-11-18 23:12:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:10,249 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2018-11-18 23:12:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2018-11-18 23:12:10,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:10,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:10,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:10,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 23:12:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-11-18 23:12:10,259 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 25 [2018-11-18 23:12:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:10,262 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-18 23:12:10,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 23:12:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-11-18 23:12:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:12:10,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:10,263 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] [2018-11-18 23:12:10,264 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:10,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:10,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1730369868, now seen corresponding path program 1 times [2018-11-18 23:12:10,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:10,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:10,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:10,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:10,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {1030#true} call ULTIMATE.init(); {1030#true} is VALID [2018-11-18 23:12:10,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {1030#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1030#true} is VALID [2018-11-18 23:12:10,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-18 23:12:10,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1030#true} {1030#true} #91#return; {1030#true} is VALID [2018-11-18 23:12:10,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {1030#true} call #t~ret7 := main(); {1030#true} is VALID [2018-11-18 23:12:10,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {1030#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1030#true} is VALID [2018-11-18 23:12:10,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {1030#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1030#true} is VALID [2018-11-18 23:12:10,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {1030#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1030#true} is VALID [2018-11-18 23:12:10,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-18 23:12:10,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {1030#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1030#true} is VALID [2018-11-18 23:12:10,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {1030#true} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {1030#true} is VALID [2018-11-18 23:12:10,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {1030#true} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {1030#true} is VALID [2018-11-18 23:12:10,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {1030#true} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {1030#true} is VALID [2018-11-18 23:12:10,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {1030#true} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {1030#true} is VALID [2018-11-18 23:12:10,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {1030#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1030#true} is VALID [2018-11-18 23:12:10,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-18 23:12:10,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {1030#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1030#true} is VALID [2018-11-18 23:12:10,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {1030#true} ~i~0 := 0; {1030#true} is VALID [2018-11-18 23:12:10,399 INFO L273 TraceCheckUtils]: 18: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-18 23:12:10,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {1030#true} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {1030#true} is VALID [2018-11-18 23:12:10,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {1030#true} assume #t~short6; {1032#|main_#t~short6|} is VALID [2018-11-18 23:12:10,414 INFO L256 TraceCheckUtils]: 21: Hoare triple {1032#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {1033#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-18 23:12:10,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {1033#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1034#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-18 23:12:10,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {1034#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1031#false} is VALID [2018-11-18 23:12:10,417 INFO L273 TraceCheckUtils]: 24: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2018-11-18 23:12:10,418 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-18 23:12:10,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:12:10,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:12:10,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-18 23:12:10,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:10,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:12:10,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:10,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:12:10,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:12:10,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:12:10,523 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 5 states. [2018-11-18 23:12:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:11,124 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-18 23:12:11,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:12:11,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-18 23:12:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:12:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-18 23:12:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:12:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-18 23:12:11,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-18 23:12:11,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:11,174 INFO L225 Difference]: With dead ends: 57 [2018-11-18 23:12:11,174 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 23:12:11,175 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-18 23:12:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 23:12:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-18 23:12:11,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:11,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-18 23:12:11,225 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-18 23:12:11,225 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-18 23:12:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:11,228 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-18 23:12:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2018-11-18 23:12:11,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:11,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:11,228 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-18 23:12:11,229 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-18 23:12:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:11,231 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-18 23:12:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2018-11-18 23:12:11,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:11,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:11,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:11,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 23:12:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2018-11-18 23:12:11,235 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 25 [2018-11-18 23:12:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:11,235 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-11-18 23:12:11,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:12:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2018-11-18 23:12:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:12:11,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:11,236 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] [2018-11-18 23:12:11,237 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:11,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:11,237 INFO L82 PathProgramCache]: Analyzing trace with hash -558764018, now seen corresponding path program 1 times [2018-11-18 23:12:11,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:11,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:11,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:11,335 INFO L256 TraceCheckUtils]: 0: Hoare triple {1288#true} call ULTIMATE.init(); {1288#true} is VALID [2018-11-18 23:12:11,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {1288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1288#true} is VALID [2018-11-18 23:12:11,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-18 23:12:11,336 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1288#true} {1288#true} #91#return; {1288#true} is VALID [2018-11-18 23:12:11,336 INFO L256 TraceCheckUtils]: 4: Hoare triple {1288#true} call #t~ret7 := main(); {1288#true} is VALID [2018-11-18 23:12:11,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {1288#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1288#true} is VALID [2018-11-18 23:12:11,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {1288#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} is VALID [2018-11-18 23:12:11,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} is VALID [2018-11-18 23:12:11,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} assume true; {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} is VALID [2018-11-18 23:12:11,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} is VALID [2018-11-18 23:12:11,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} is VALID [2018-11-18 23:12:11,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} is VALID [2018-11-18 23:12:11,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} is VALID [2018-11-18 23:12:11,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {1289#false} is VALID [2018-11-18 23:12:11,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {1289#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1289#false} is VALID [2018-11-18 23:12:11,343 INFO L273 TraceCheckUtils]: 15: Hoare triple {1289#false} assume true; {1289#false} is VALID [2018-11-18 23:12:11,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {1289#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1289#false} is VALID [2018-11-18 23:12:11,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {1289#false} ~i~0 := 0; {1289#false} is VALID [2018-11-18 23:12:11,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {1289#false} assume true; {1289#false} is VALID [2018-11-18 23:12:11,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {1289#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {1289#false} is VALID [2018-11-18 23:12:11,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {1289#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {1289#false} is VALID [2018-11-18 23:12:11,345 INFO L256 TraceCheckUtils]: 21: Hoare triple {1289#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {1289#false} is VALID [2018-11-18 23:12:11,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {1289#false} ~cond := #in~cond; {1289#false} is VALID [2018-11-18 23:12:11,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {1289#false} assume 0 == ~cond; {1289#false} is VALID [2018-11-18 23:12:11,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {1289#false} assume !false; {1289#false} is VALID [2018-11-18 23:12:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:11,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:12:11,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:12:11,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:12:11,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:11,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:12:11,372 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-18 23:12:11,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:12:11,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:12:11,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:12:11,373 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 4 states. [2018-11-18 23:12:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:11,603 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2018-11-18 23:12:11,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:12:11,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:12:11,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:12:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-18 23:12:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:12:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-18 23:12:11,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 80 transitions. [2018-11-18 23:12:11,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:11,751 INFO L225 Difference]: With dead ends: 93 [2018-11-18 23:12:11,751 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 23:12:11,752 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:12:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 23:12:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-18 23:12:11,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:11,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 54 states. [2018-11-18 23:12:11,861 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 54 states. [2018-11-18 23:12:11,861 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 54 states. [2018-11-18 23:12:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:11,865 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-18 23:12:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2018-11-18 23:12:11,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:11,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:11,866 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 61 states. [2018-11-18 23:12:11,866 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 61 states. [2018-11-18 23:12:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:11,869 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-18 23:12:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2018-11-18 23:12:11,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:11,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:11,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:11,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 23:12:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2018-11-18 23:12:11,873 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 25 [2018-11-18 23:12:11,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:11,873 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-18 23:12:11,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:12:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2018-11-18 23:12:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:12:11,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:11,874 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] [2018-11-18 23:12:11,875 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:11,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:11,875 INFO L82 PathProgramCache]: Analyzing trace with hash -300598580, now seen corresponding path program 1 times [2018-11-18 23:12:11,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:11,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:11,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:11,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:11,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:11,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {1603#true} call ULTIMATE.init(); {1603#true} is VALID [2018-11-18 23:12:11,954 INFO L273 TraceCheckUtils]: 1: Hoare triple {1603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1603#true} is VALID [2018-11-18 23:12:11,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {1603#true} assume true; {1603#true} is VALID [2018-11-18 23:12:11,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1603#true} {1603#true} #91#return; {1603#true} is VALID [2018-11-18 23:12:11,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {1603#true} call #t~ret7 := main(); {1603#true} is VALID [2018-11-18 23:12:11,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {1603#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1603#true} is VALID [2018-11-18 23:12:11,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {1603#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} is VALID [2018-11-18 23:12:11,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} is VALID [2018-11-18 23:12:11,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} assume true; {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} is VALID [2018-11-18 23:12:11,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} is VALID [2018-11-18 23:12:11,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {1606#(<= (+ main_~CCCELVOL2~0 3) main_~MINVAL~0)} is VALID [2018-11-18 23:12:11,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {1606#(<= (+ main_~CCCELVOL2~0 3) main_~MINVAL~0)} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {1606#(<= (+ main_~CCCELVOL2~0 3) main_~MINVAL~0)} is VALID [2018-11-18 23:12:11,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {1606#(<= (+ main_~CCCELVOL2~0 3) main_~MINVAL~0)} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {1604#false} is VALID [2018-11-18 23:12:11,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {1604#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {1604#false} is VALID [2018-11-18 23:12:11,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {1604#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1604#false} is VALID [2018-11-18 23:12:11,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {1604#false} assume true; {1604#false} is VALID [2018-11-18 23:12:11,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {1604#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1604#false} is VALID [2018-11-18 23:12:11,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {1604#false} ~i~0 := 0; {1604#false} is VALID [2018-11-18 23:12:11,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {1604#false} assume true; {1604#false} is VALID [2018-11-18 23:12:11,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {1604#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {1604#false} is VALID [2018-11-18 23:12:11,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {1604#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {1604#false} is VALID [2018-11-18 23:12:11,962 INFO L256 TraceCheckUtils]: 21: Hoare triple {1604#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {1604#false} is VALID [2018-11-18 23:12:11,962 INFO L273 TraceCheckUtils]: 22: Hoare triple {1604#false} ~cond := #in~cond; {1604#false} is VALID [2018-11-18 23:12:11,963 INFO L273 TraceCheckUtils]: 23: Hoare triple {1604#false} assume 0 == ~cond; {1604#false} is VALID [2018-11-18 23:12:11,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {1604#false} assume !false; {1604#false} is VALID [2018-11-18 23:12:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:11,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:12:11,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:12:11,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:12:11,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:11,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:12:12,014 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-18 23:12:12,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:12:12,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:12:12,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:12:12,015 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand 4 states. [2018-11-18 23:12:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:12,412 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-11-18 23:12:12,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:12:12,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:12:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:12:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-18 23:12:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:12:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-18 23:12:12,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-18 23:12:12,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:12,514 INFO L225 Difference]: With dead ends: 93 [2018-11-18 23:12:12,514 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 23:12:12,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:12:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 23:12:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-18 23:12:12,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:12,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 54 states. [2018-11-18 23:12:12,580 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 54 states. [2018-11-18 23:12:12,581 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 54 states. [2018-11-18 23:12:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:12,584 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-18 23:12:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-11-18 23:12:12,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:12,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:12,585 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 61 states. [2018-11-18 23:12:12,585 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 61 states. [2018-11-18 23:12:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:12,589 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-18 23:12:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-11-18 23:12:12,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:12,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:12,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:12,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 23:12:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-11-18 23:12:12,592 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 25 [2018-11-18 23:12:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:12,592 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-11-18 23:12:12,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:12:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-18 23:12:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:12:12,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:12,593 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] [2018-11-18 23:12:12,593 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:12,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:12,594 INFO L82 PathProgramCache]: Analyzing trace with hash -887404594, now seen corresponding path program 1 times [2018-11-18 23:12:12,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:12,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:12,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:12,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:12,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:13,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {1918#true} call ULTIMATE.init(); {1918#true} is VALID [2018-11-18 23:12:13,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {1918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1918#true} is VALID [2018-11-18 23:12:13,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {1918#true} assume true; {1918#true} is VALID [2018-11-18 23:12:13,529 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1918#true} {1918#true} #91#return; {1918#true} is VALID [2018-11-18 23:12:13,529 INFO L256 TraceCheckUtils]: 4: Hoare triple {1918#true} call #t~ret7 := main(); {1918#true} is VALID [2018-11-18 23:12:13,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {1918#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1918#true} is VALID [2018-11-18 23:12:13,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {1918#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1920#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:13,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {1920#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:13,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:13,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:13,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:13,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:13,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:13,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:13,541 INFO L273 TraceCheckUtils]: 14: Hoare triple {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1923#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:13,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {1923#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {1923#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:13,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {1923#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1924#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:13,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {1924#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:13,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume true; {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:13,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:13,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {1926#|main_#t~short6|} is VALID [2018-11-18 23:12:13,553 INFO L256 TraceCheckUtils]: 21: Hoare triple {1926#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {1927#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-18 23:12:13,554 INFO L273 TraceCheckUtils]: 22: Hoare triple {1927#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1928#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-18 23:12:13,554 INFO L273 TraceCheckUtils]: 23: Hoare triple {1928#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1919#false} is VALID [2018-11-18 23:12:13,554 INFO L273 TraceCheckUtils]: 24: Hoare triple {1919#false} assume !false; {1919#false} is VALID [2018-11-18 23:12:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:13,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:12:13,557 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-18 23:12:13,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:13,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:12:13,673 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-18 23:12:13,677 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-18 23:12:13,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-18 23:12:13,732 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 29 treesize of output 24 [2018-11-18 23:12:13,743 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:13,744 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 24 treesize of output 39 [2018-11-18 23:12:13,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-18 23:12:13,807 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 41 treesize of output 34 [2018-11-18 23:12:13,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:13,815 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:13,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:13,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 79 [2018-11-18 23:12:13,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-18 23:12:13,895 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 39 treesize of output 30 [2018-11-18 23:12:13,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:13,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:13,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:13,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:13,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:13,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:13,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-11-18 23:12:13,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:13,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-11-18 23:12:14,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {1918#true} call ULTIMATE.init(); {1918#true} is VALID [2018-11-18 23:12:14,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {1918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1918#true} is VALID [2018-11-18 23:12:14,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {1918#true} assume true; {1918#true} is VALID [2018-11-18 23:12:14,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1918#true} {1918#true} #91#return; {1918#true} is VALID [2018-11-18 23:12:14,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {1918#true} call #t~ret7 := main(); {1918#true} is VALID [2018-11-18 23:12:14,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {1918#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1918#true} is VALID [2018-11-18 23:12:14,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {1918#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1950#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-18 23:12:14,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {1950#(= |main_~#volArray~0.offset| 0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:14,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:14,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:14,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {1964#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:14,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {1964#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {1968#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} is VALID [2018-11-18 23:12:14,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {1968#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {1972#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} is VALID [2018-11-18 23:12:14,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {1972#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} is VALID [2018-11-18 23:12:14,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} is VALID [2018-11-18 23:12:14,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} assume true; {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} is VALID [2018-11-18 23:12:14,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} is VALID [2018-11-18 23:12:14,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} ~i~0 := 0; {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:14,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} assume true; {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:14,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:14,162 INFO L273 TraceCheckUtils]: 20: Hoare triple {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {1926#|main_#t~short6|} is VALID [2018-11-18 23:12:14,163 INFO L256 TraceCheckUtils]: 21: Hoare triple {1926#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {2002#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:12:14,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {2002#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2006#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:12:14,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {2006#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1919#false} is VALID [2018-11-18 23:12:14,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {1919#false} assume !false; {1919#false} is VALID [2018-11-18 23:12:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:14,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:12:14,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-11-18 23:12:14,188 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2018-11-18 23:12:14,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:14,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 23:12:14,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:14,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 23:12:14,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 23:12:14,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-11-18 23:12:14,244 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 20 states. [2018-11-18 23:12:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:17,669 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2018-11-18 23:12:17,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 23:12:17,669 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2018-11-18 23:12:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 23:12:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 138 transitions. [2018-11-18 23:12:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 23:12:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 138 transitions. [2018-11-18 23:12:17,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 138 transitions. [2018-11-18 23:12:17,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:17,905 INFO L225 Difference]: With dead ends: 126 [2018-11-18 23:12:17,905 INFO L226 Difference]: Without dead ends: 124 [2018-11-18 23:12:17,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 23:12:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-18 23:12:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 72. [2018-11-18 23:12:18,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:18,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 72 states. [2018-11-18 23:12:18,094 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 72 states. [2018-11-18 23:12:18,094 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 72 states. [2018-11-18 23:12:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:18,100 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-18 23:12:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2018-11-18 23:12:18,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:18,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:18,101 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 124 states. [2018-11-18 23:12:18,101 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 124 states. [2018-11-18 23:12:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:18,106 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-18 23:12:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2018-11-18 23:12:18,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:18,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:18,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:18,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 23:12:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2018-11-18 23:12:18,110 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 25 [2018-11-18 23:12:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:18,111 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2018-11-18 23:12:18,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 23:12:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2018-11-18 23:12:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 23:12:18,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:18,112 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 23:12:18,112 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:18,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1219897167, now seen corresponding path program 1 times [2018-11-18 23:12:18,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:18,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:18,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:18,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:18,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:18,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {2546#true} call ULTIMATE.init(); {2546#true} is VALID [2018-11-18 23:12:18,187 INFO L273 TraceCheckUtils]: 1: Hoare triple {2546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2546#true} is VALID [2018-11-18 23:12:18,187 INFO L273 TraceCheckUtils]: 2: Hoare triple {2546#true} assume true; {2546#true} is VALID [2018-11-18 23:12:18,187 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2546#true} {2546#true} #91#return; {2546#true} is VALID [2018-11-18 23:12:18,187 INFO L256 TraceCheckUtils]: 4: Hoare triple {2546#true} call #t~ret7 := main(); {2546#true} is VALID [2018-11-18 23:12:18,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {2546#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2546#true} is VALID [2018-11-18 23:12:18,188 INFO L273 TraceCheckUtils]: 6: Hoare triple {2546#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2546#true} is VALID [2018-11-18 23:12:18,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {2546#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {2546#true} is VALID [2018-11-18 23:12:18,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {2546#true} assume true; {2546#true} is VALID [2018-11-18 23:12:18,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {2546#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {2546#true} is VALID [2018-11-18 23:12:18,195 INFO L273 TraceCheckUtils]: 10: Hoare triple {2546#true} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-18 23:12:18,195 INFO L273 TraceCheckUtils]: 11: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-18 23:12:18,196 INFO L273 TraceCheckUtils]: 12: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-18 23:12:18,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-18 23:12:18,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-18 23:12:18,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume true; {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-18 23:12:18,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-18 23:12:18,198 INFO L273 TraceCheckUtils]: 17: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {2547#false} is VALID [2018-11-18 23:12:18,198 INFO L273 TraceCheckUtils]: 18: Hoare triple {2547#false} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {2547#false} is VALID [2018-11-18 23:12:18,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {2547#false} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {2547#false} is VALID [2018-11-18 23:12:18,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {2547#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {2547#false} is VALID [2018-11-18 23:12:18,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {2547#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2547#false} is VALID [2018-11-18 23:12:18,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {2547#false} assume true; {2547#false} is VALID [2018-11-18 23:12:18,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {2547#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {2547#false} is VALID [2018-11-18 23:12:18,200 INFO L273 TraceCheckUtils]: 24: Hoare triple {2547#false} ~i~0 := 0; {2547#false} is VALID [2018-11-18 23:12:18,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {2547#false} assume true; {2547#false} is VALID [2018-11-18 23:12:18,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {2547#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {2547#false} is VALID [2018-11-18 23:12:18,201 INFO L273 TraceCheckUtils]: 27: Hoare triple {2547#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {2547#false} is VALID [2018-11-18 23:12:18,202 INFO L256 TraceCheckUtils]: 28: Hoare triple {2547#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {2547#false} is VALID [2018-11-18 23:12:18,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {2547#false} ~cond := #in~cond; {2547#false} is VALID [2018-11-18 23:12:18,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {2547#false} assume 0 == ~cond; {2547#false} is VALID [2018-11-18 23:12:18,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {2547#false} assume !false; {2547#false} is VALID [2018-11-18 23:12:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:18,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:12:18,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:12:18,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 23:12:18,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:18,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:12:18,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:18,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:12:18,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:12:18,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:12:18,273 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 3 states. [2018-11-18 23:12:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:18,518 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-11-18 23:12:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:12:18,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 23:12:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:12:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-18 23:12:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:12:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-18 23:12:18,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-18 23:12:18,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:18,614 INFO L225 Difference]: With dead ends: 104 [2018-11-18 23:12:18,614 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 23:12:18,615 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-18 23:12:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 23:12:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2018-11-18 23:12:18,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:18,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 72 states. [2018-11-18 23:12:18,747 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 72 states. [2018-11-18 23:12:18,747 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 72 states. [2018-11-18 23:12:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:18,751 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2018-11-18 23:12:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-11-18 23:12:18,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:18,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:18,752 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 79 states. [2018-11-18 23:12:18,752 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 79 states. [2018-11-18 23:12:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:18,753 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2018-11-18 23:12:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-11-18 23:12:18,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:18,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:18,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:18,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 23:12:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2018-11-18 23:12:18,756 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 32 [2018-11-18 23:12:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:18,756 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2018-11-18 23:12:18,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:12:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-11-18 23:12:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 23:12:18,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:18,757 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 23:12:18,757 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:18,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:18,758 INFO L82 PathProgramCache]: Analyzing trace with hash 634725197, now seen corresponding path program 1 times [2018-11-18 23:12:18,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:18,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:18,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:18,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:18,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:18,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {2930#true} call ULTIMATE.init(); {2930#true} is VALID [2018-11-18 23:12:18,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {2930#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2930#true} is VALID [2018-11-18 23:12:18,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {2930#true} assume true; {2930#true} is VALID [2018-11-18 23:12:18,832 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2930#true} {2930#true} #91#return; {2930#true} is VALID [2018-11-18 23:12:18,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {2930#true} call #t~ret7 := main(); {2930#true} is VALID [2018-11-18 23:12:18,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {2930#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2930#true} is VALID [2018-11-18 23:12:18,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {2930#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2930#true} is VALID [2018-11-18 23:12:18,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {2930#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {2930#true} is VALID [2018-11-18 23:12:18,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {2930#true} assume true; {2930#true} is VALID [2018-11-18 23:12:18,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {2930#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {2930#true} is VALID [2018-11-18 23:12:18,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {2930#true} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:18,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:18,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:18,842 INFO L273 TraceCheckUtils]: 13: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:18,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:18,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume true; {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:18,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:18,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {2931#false} is VALID [2018-11-18 23:12:18,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {2931#false} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {2931#false} is VALID [2018-11-18 23:12:18,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {2931#false} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {2931#false} is VALID [2018-11-18 23:12:18,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {2931#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {2931#false} is VALID [2018-11-18 23:12:18,846 INFO L273 TraceCheckUtils]: 21: Hoare triple {2931#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2931#false} is VALID [2018-11-18 23:12:18,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {2931#false} assume true; {2931#false} is VALID [2018-11-18 23:12:18,847 INFO L273 TraceCheckUtils]: 23: Hoare triple {2931#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {2931#false} is VALID [2018-11-18 23:12:18,847 INFO L273 TraceCheckUtils]: 24: Hoare triple {2931#false} ~i~0 := 0; {2931#false} is VALID [2018-11-18 23:12:18,847 INFO L273 TraceCheckUtils]: 25: Hoare triple {2931#false} assume true; {2931#false} is VALID [2018-11-18 23:12:18,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {2931#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {2931#false} is VALID [2018-11-18 23:12:18,848 INFO L273 TraceCheckUtils]: 27: Hoare triple {2931#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {2931#false} is VALID [2018-11-18 23:12:18,848 INFO L256 TraceCheckUtils]: 28: Hoare triple {2931#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {2931#false} is VALID [2018-11-18 23:12:18,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {2931#false} ~cond := #in~cond; {2931#false} is VALID [2018-11-18 23:12:18,848 INFO L273 TraceCheckUtils]: 30: Hoare triple {2931#false} assume 0 == ~cond; {2931#false} is VALID [2018-11-18 23:12:18,849 INFO L273 TraceCheckUtils]: 31: Hoare triple {2931#false} assume !false; {2931#false} is VALID [2018-11-18 23:12:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:18,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:12:18,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:12:18,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 23:12:18,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:18,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:12:18,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:18,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:12:18,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:12:18,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:12:18,893 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 3 states. [2018-11-18 23:12:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:19,226 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2018-11-18 23:12:19,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:12:19,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 23:12:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:12:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-18 23:12:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:12:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-18 23:12:19,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-18 23:12:19,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:19,370 INFO L225 Difference]: With dead ends: 96 [2018-11-18 23:12:19,370 INFO L226 Difference]: Without dead ends: 71 [2018-11-18 23:12:19,371 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-18 23:12:19,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-18 23:12:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-11-18 23:12:19,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:19,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 64 states. [2018-11-18 23:12:19,763 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 64 states. [2018-11-18 23:12:19,763 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 64 states. [2018-11-18 23:12:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:19,768 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-18 23:12:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2018-11-18 23:12:19,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:19,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:19,768 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 71 states. [2018-11-18 23:12:19,768 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 71 states. [2018-11-18 23:12:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:19,770 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-18 23:12:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2018-11-18 23:12:19,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:19,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:19,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:19,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 23:12:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-11-18 23:12:19,772 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 32 [2018-11-18 23:12:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:19,773 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-18 23:12:19,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:12:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-11-18 23:12:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 23:12:19,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:19,774 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] [2018-11-18 23:12:19,774 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:19,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash -500679399, now seen corresponding path program 1 times [2018-11-18 23:12:19,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:19,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:19,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:19,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:19,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:20,739 INFO L256 TraceCheckUtils]: 0: Hoare triple {3280#true} call ULTIMATE.init(); {3280#true} is VALID [2018-11-18 23:12:20,739 INFO L273 TraceCheckUtils]: 1: Hoare triple {3280#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3280#true} is VALID [2018-11-18 23:12:20,740 INFO L273 TraceCheckUtils]: 2: Hoare triple {3280#true} assume true; {3280#true} is VALID [2018-11-18 23:12:20,740 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3280#true} {3280#true} #91#return; {3280#true} is VALID [2018-11-18 23:12:20,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {3280#true} call #t~ret7 := main(); {3280#true} is VALID [2018-11-18 23:12:20,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {3280#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3280#true} is VALID [2018-11-18 23:12:20,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {3280#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {3282#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0))} is VALID [2018-11-18 23:12:20,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {3282#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:20,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:20,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:20,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:20,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {3284#(and (= main_~i~0 1) (<= (+ main_~CCCELVOL1~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:20,756 INFO L273 TraceCheckUtils]: 12: Hoare triple {3284#(and (= main_~i~0 1) (<= (+ main_~CCCELVOL1~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {3284#(and (= main_~i~0 1) (<= (+ main_~CCCELVOL1~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:20,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {3284#(and (= main_~i~0 1) (<= (+ main_~CCCELVOL1~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {3285#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:20,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {3285#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3286#(and (or (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4)))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:20,759 INFO L273 TraceCheckUtils]: 15: Hoare triple {3286#(and (or (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4)))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {3286#(and (or (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4)))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:20,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {3286#(and (or (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4)))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {3287#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))} is VALID [2018-11-18 23:12:20,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {3287#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))} ~i~0 := 0; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:20,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume true; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:20,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:20,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume #t~short6; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:20,765 INFO L256 TraceCheckUtils]: 21: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {3280#true} is VALID [2018-11-18 23:12:20,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2018-11-18 23:12:20,765 INFO L273 TraceCheckUtils]: 23: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2018-11-18 23:12:20,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {3280#true} assume true; {3280#true} is VALID [2018-11-18 23:12:20,767 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3280#true} {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} #95#return; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:20,767 INFO L273 TraceCheckUtils]: 26: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:20,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3289#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:12:20,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {3289#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {3289#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:12:20,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {3289#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {3290#|main_#t~short6|} is VALID [2018-11-18 23:12:20,771 INFO L273 TraceCheckUtils]: 30: Hoare triple {3290#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {3281#false} is VALID [2018-11-18 23:12:20,771 INFO L256 TraceCheckUtils]: 31: Hoare triple {3281#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {3281#false} is VALID [2018-11-18 23:12:20,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {3281#false} ~cond := #in~cond; {3281#false} is VALID [2018-11-18 23:12:20,772 INFO L273 TraceCheckUtils]: 33: Hoare triple {3281#false} assume 0 == ~cond; {3281#false} is VALID [2018-11-18 23:12:20,772 INFO L273 TraceCheckUtils]: 34: Hoare triple {3281#false} assume !false; {3281#false} is VALID [2018-11-18 23:12:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:20,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:12:20,776 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-18 23:12:20,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:20,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:12:21,112 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-18 23:12:21,117 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-18 23:12:21,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:21,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:21,140 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-18 23:12:21,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-18 23:12:21,144 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:21,190 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 29 treesize of output 24 [2018-11-18 23:12:21,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:21,197 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 24 treesize of output 39 [2018-11-18 23:12:21,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:21,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:21,220 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-18 23:12:21,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-18 23:12:21,225 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:21,242 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 23 treesize of output 18 [2018-11-18 23:12:21,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:21,254 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 18 treesize of output 27 [2018-11-18 23:12:21,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:21,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:21,271 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-18 23:12:21,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-11-18 23:12:21,275 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:21,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {3280#true} call ULTIMATE.init(); {3280#true} is VALID [2018-11-18 23:12:21,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {3280#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3280#true} is VALID [2018-11-18 23:12:21,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {3280#true} assume true; {3280#true} is VALID [2018-11-18 23:12:21,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3280#true} {3280#true} #91#return; {3280#true} is VALID [2018-11-18 23:12:21,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {3280#true} call #t~ret7 := main(); {3280#true} is VALID [2018-11-18 23:12:21,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {3280#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3280#true} is VALID [2018-11-18 23:12:21,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {3280#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {3312#(and (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} is VALID [2018-11-18 23:12:21,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {3312#(and (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} is VALID [2018-11-18 23:12:21,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} assume true; {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} is VALID [2018-11-18 23:12:21,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} is VALID [2018-11-18 23:12:21,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {3326#(and (<= main_~MINVAL~0 5) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-18 23:12:21,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {3326#(and (<= main_~MINVAL~0 5) (= 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 + 4 * (4 * ~i~0 - 3), 4); {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:21,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= 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 + 4 * (4 * ~i~0 - 2), 4); {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:21,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:21,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:21,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} assume true; {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:21,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:21,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:21,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume true; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:21,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:21,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume #t~short6; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:21,526 INFO L256 TraceCheckUtils]: 21: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-18 23:12:21,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} ~cond := #in~cond; {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-18 23:12:21,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} assume !(0 == ~cond); {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-18 23:12:21,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} assume true; {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-18 23:12:21,529 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #95#return; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:21,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:21,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:21,532 INFO L273 TraceCheckUtils]: 28: Hoare triple {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:21,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {3290#|main_#t~short6|} is VALID [2018-11-18 23:12:21,534 INFO L273 TraceCheckUtils]: 30: Hoare triple {3290#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {3281#false} is VALID [2018-11-18 23:12:21,534 INFO L256 TraceCheckUtils]: 31: Hoare triple {3281#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {3281#false} is VALID [2018-11-18 23:12:21,534 INFO L273 TraceCheckUtils]: 32: Hoare triple {3281#false} ~cond := #in~cond; {3281#false} is VALID [2018-11-18 23:12:21,534 INFO L273 TraceCheckUtils]: 33: Hoare triple {3281#false} assume 0 == ~cond; {3281#false} is VALID [2018-11-18 23:12:21,534 INFO L273 TraceCheckUtils]: 34: Hoare triple {3281#false} assume !false; {3281#false} is VALID [2018-11-18 23:12:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:21,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:12:21,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-11-18 23:12:21,570 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-11-18 23:12:21,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:21,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 23:12:21,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:21,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 23:12:21,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 23:12:21,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-18 23:12:21,847 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 18 states. [2018-11-18 23:12:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:40,143 INFO L93 Difference]: Finished difference Result 169 states and 205 transitions. [2018-11-18 23:12:40,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 23:12:40,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-11-18 23:12:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:12:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 161 transitions. [2018-11-18 23:12:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:12:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 161 transitions. [2018-11-18 23:12:40,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 161 transitions. [2018-11-18 23:12:40,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:40,434 INFO L225 Difference]: With dead ends: 169 [2018-11-18 23:12:40,434 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 23:12:40,435 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=342, Invalid=1218, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 23:12:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 23:12:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 97. [2018-11-18 23:12:40,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:40,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 97 states. [2018-11-18 23:12:40,708 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 97 states. [2018-11-18 23:12:40,708 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 97 states. [2018-11-18 23:12:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:40,713 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2018-11-18 23:12:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 185 transitions. [2018-11-18 23:12:40,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:40,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:40,714 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 152 states. [2018-11-18 23:12:40,715 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 152 states. [2018-11-18 23:12:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:40,719 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2018-11-18 23:12:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 185 transitions. [2018-11-18 23:12:40,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:40,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:40,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:40,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-18 23:12:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2018-11-18 23:12:40,723 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 35 [2018-11-18 23:12:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:40,724 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2018-11-18 23:12:40,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 23:12:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-11-18 23:12:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 23:12:40,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:40,725 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 23:12:40,725 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:40,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:40,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1068389213, now seen corresponding path program 1 times [2018-11-18 23:12:40,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:40,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:40,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:40,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:41,477 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-11-18 23:12:42,127 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2018-11-18 23:12:42,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {4088#true} call ULTIMATE.init(); {4088#true} is VALID [2018-11-18 23:12:42,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {4088#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {4088#true} is VALID [2018-11-18 23:12:42,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {4088#true} assume true; {4088#true} is VALID [2018-11-18 23:12:42,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4088#true} {4088#true} #91#return; {4088#true} is VALID [2018-11-18 23:12:42,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {4088#true} call #t~ret7 := main(); {4088#true} is VALID [2018-11-18 23:12:42,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {4088#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {4088#true} is VALID [2018-11-18 23:12:42,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {4088#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {4090#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-18 23:12:42,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {4090#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:42,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:42,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:42,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:42,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:42,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:42,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:12:42,310 INFO L273 TraceCheckUtils]: 14: Hoare triple {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4093#(and (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))))} is VALID [2018-11-18 23:12:42,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {4093#(and (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))))} assume true; {4093#(and (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))))} is VALID [2018-11-18 23:12:42,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {4093#(and (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {4094#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))} is VALID [2018-11-18 23:12:42,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {4094#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))} ~i~0 := 0; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:42,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume true; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:42,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:42,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:42,319 INFO L256 TraceCheckUtils]: 21: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {4088#true} is VALID [2018-11-18 23:12:42,319 INFO L273 TraceCheckUtils]: 22: Hoare triple {4088#true} ~cond := #in~cond; {4088#true} is VALID [2018-11-18 23:12:42,320 INFO L273 TraceCheckUtils]: 23: Hoare triple {4088#true} assume !(0 == ~cond); {4088#true} is VALID [2018-11-18 23:12:42,320 INFO L273 TraceCheckUtils]: 24: Hoare triple {4088#true} assume true; {4088#true} is VALID [2018-11-18 23:12:42,321 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {4088#true} {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} #95#return; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:42,322 INFO L273 TraceCheckUtils]: 26: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-18 23:12:42,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4096#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:12:42,323 INFO L273 TraceCheckUtils]: 28: Hoare triple {4096#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {4096#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:12:42,324 INFO L273 TraceCheckUtils]: 29: Hoare triple {4096#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {4097#|main_#t~short6|} is VALID [2018-11-18 23:12:42,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {4097#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {4089#false} is VALID [2018-11-18 23:12:42,325 INFO L256 TraceCheckUtils]: 31: Hoare triple {4089#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {4089#false} is VALID [2018-11-18 23:12:42,325 INFO L273 TraceCheckUtils]: 32: Hoare triple {4089#false} ~cond := #in~cond; {4089#false} is VALID [2018-11-18 23:12:42,325 INFO L273 TraceCheckUtils]: 33: Hoare triple {4089#false} assume 0 == ~cond; {4089#false} is VALID [2018-11-18 23:12:42,326 INFO L273 TraceCheckUtils]: 34: Hoare triple {4089#false} assume !false; {4089#false} is VALID [2018-11-18 23:12:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:42,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:12:42,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:12:42,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:42,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:12:42,521 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-18 23:12:42,526 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-18 23:12:42,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:42,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:42,544 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-18 23:12:42,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-18 23:12:42,548 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:42,583 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 29 treesize of output 24 [2018-11-18 23:12:42,589 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:42,594 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 24 treesize of output 39 [2018-11-18 23:12:42,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:42,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:42,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:42,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-18 23:12:42,720 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 32 treesize of output 25 [2018-11-18 23:12:42,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:42,735 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:42,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:42,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-18 23:12:42,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:42,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:42,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:42,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-18 23:12:43,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {4088#true} call ULTIMATE.init(); {4088#true} is VALID [2018-11-18 23:12:43,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {4088#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {4088#true} is VALID [2018-11-18 23:12:43,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {4088#true} assume true; {4088#true} is VALID [2018-11-18 23:12:43,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4088#true} {4088#true} #91#return; {4088#true} is VALID [2018-11-18 23:12:43,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {4088#true} call #t~ret7 := main(); {4088#true} is VALID [2018-11-18 23:12:43,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {4088#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {4088#true} is VALID [2018-11-18 23:12:43,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {4088#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {4119#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-18 23:12:43,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {4119#(= |main_~#volArray~0.offset| 0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:43,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:43,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:43,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:43,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {4136#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:43,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {4136#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {4140#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:43,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {4140#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:12:43,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:12:43,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume true; {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:12:43,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:12:43,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} ~i~0 := 0; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:43,227 INFO L273 TraceCheckUtils]: 18: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume true; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:43,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:43,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:43,231 INFO L256 TraceCheckUtils]: 21: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} is VALID [2018-11-18 23:12:43,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} ~cond := #in~cond; {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} is VALID [2018-11-18 23:12:43,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} assume !(0 == ~cond); {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} is VALID [2018-11-18 23:12:43,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} assume true; {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} is VALID [2018-11-18 23:12:43,270 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} #95#return; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:43,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:12:43,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4189#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:12:43,272 INFO L273 TraceCheckUtils]: 28: Hoare triple {4189#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume true; {4189#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:12:43,272 INFO L273 TraceCheckUtils]: 29: Hoare triple {4189#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {4097#|main_#t~short6|} is VALID [2018-11-18 23:12:43,273 INFO L273 TraceCheckUtils]: 30: Hoare triple {4097#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {4089#false} is VALID [2018-11-18 23:12:43,273 INFO L256 TraceCheckUtils]: 31: Hoare triple {4089#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {4089#false} is VALID [2018-11-18 23:12:43,273 INFO L273 TraceCheckUtils]: 32: Hoare triple {4089#false} ~cond := #in~cond; {4089#false} is VALID [2018-11-18 23:12:43,273 INFO L273 TraceCheckUtils]: 33: Hoare triple {4089#false} assume 0 == ~cond; {4089#false} is VALID [2018-11-18 23:12:43,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {4089#false} assume !false; {4089#false} is VALID [2018-11-18 23:12:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:12:43,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:12:43,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-11-18 23:12:43,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-11-18 23:12:43,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:43,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 23:12:43,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:43,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 23:12:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 23:12:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-11-18 23:12:43,381 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 18 states. [2018-11-18 23:12:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:48,105 INFO L93 Difference]: Finished difference Result 209 states and 250 transitions. [2018-11-18 23:12:48,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 23:12:48,106 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-11-18 23:12:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:12:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 170 transitions. [2018-11-18 23:12:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:12:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 170 transitions. [2018-11-18 23:12:48,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 170 transitions. [2018-11-18 23:12:49,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:49,110 INFO L225 Difference]: With dead ends: 209 [2018-11-18 23:12:49,111 INFO L226 Difference]: Without dead ends: 192 [2018-11-18 23:12:49,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 23:12:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-18 23:12:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 123. [2018-11-18 23:12:49,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:49,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 123 states. [2018-11-18 23:12:49,646 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 123 states. [2018-11-18 23:12:49,646 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 123 states. [2018-11-18 23:12:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:49,652 INFO L93 Difference]: Finished difference Result 192 states and 231 transitions. [2018-11-18 23:12:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2018-11-18 23:12:49,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:49,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:49,653 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 192 states. [2018-11-18 23:12:49,654 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 192 states. [2018-11-18 23:12:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:49,659 INFO L93 Difference]: Finished difference Result 192 states and 231 transitions. [2018-11-18 23:12:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2018-11-18 23:12:49,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:49,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:49,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:49,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 23:12:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2018-11-18 23:12:49,664 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 35 [2018-11-18 23:12:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:49,664 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2018-11-18 23:12:49,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 23:12:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2018-11-18 23:12:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 23:12:49,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:49,665 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 23:12:49,665 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:49,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:49,666 INFO L82 PathProgramCache]: Analyzing trace with hash -907357220, now seen corresponding path program 1 times [2018-11-18 23:12:49,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:49,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:49,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:49,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {5055#true} call ULTIMATE.init(); {5055#true} is VALID [2018-11-18 23:12:49,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {5055#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {5055#true} is VALID [2018-11-18 23:12:49,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {5055#true} assume true; {5055#true} is VALID [2018-11-18 23:12:49,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5055#true} {5055#true} #91#return; {5055#true} is VALID [2018-11-18 23:12:49,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {5055#true} call #t~ret7 := main(); {5055#true} is VALID [2018-11-18 23:12:49,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {5055#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {5055#true} is VALID [2018-11-18 23:12:49,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {5055#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {5055#true} is VALID [2018-11-18 23:12:49,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {5055#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {5055#true} is VALID [2018-11-18 23:12:49,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {5055#true} assume true; {5055#true} is VALID [2018-11-18 23:12:49,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {5055#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {5055#true} is VALID [2018-11-18 23:12:49,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {5055#true} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {5055#true} is VALID [2018-11-18 23:12:49,892 INFO L273 TraceCheckUtils]: 11: Hoare triple {5055#true} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:49,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:49,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:49,931 INFO L273 TraceCheckUtils]: 14: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:49,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume true; {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:49,956 INFO L273 TraceCheckUtils]: 16: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:49,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:12:49,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {5056#false} is VALID [2018-11-18 23:12:49,982 INFO L273 TraceCheckUtils]: 19: Hoare triple {5056#false} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {5056#false} is VALID [2018-11-18 23:12:49,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {5056#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {5056#false} is VALID [2018-11-18 23:12:49,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {5056#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5056#false} is VALID [2018-11-18 23:12:49,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {5056#false} assume true; {5056#false} is VALID [2018-11-18 23:12:49,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {5056#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {5056#false} is VALID [2018-11-18 23:12:49,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {5056#false} ~i~0 := 0; {5056#false} is VALID [2018-11-18 23:12:49,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {5056#false} assume true; {5056#false} is VALID [2018-11-18 23:12:49,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {5056#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {5056#false} is VALID [2018-11-18 23:12:49,984 INFO L273 TraceCheckUtils]: 27: Hoare triple {5056#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {5056#false} is VALID [2018-11-18 23:12:49,984 INFO L256 TraceCheckUtils]: 28: Hoare triple {5056#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {5055#true} is VALID [2018-11-18 23:12:49,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {5055#true} ~cond := #in~cond; {5055#true} is VALID [2018-11-18 23:12:49,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {5055#true} assume !(0 == ~cond); {5055#true} is VALID [2018-11-18 23:12:49,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {5055#true} assume true; {5055#true} is VALID [2018-11-18 23:12:49,985 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {5055#true} {5056#false} #95#return; {5056#false} is VALID [2018-11-18 23:12:49,985 INFO L273 TraceCheckUtils]: 33: Hoare triple {5056#false} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {5056#false} is VALID [2018-11-18 23:12:49,985 INFO L273 TraceCheckUtils]: 34: Hoare triple {5056#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5056#false} is VALID [2018-11-18 23:12:49,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {5056#false} assume true; {5056#false} is VALID [2018-11-18 23:12:49,985 INFO L273 TraceCheckUtils]: 36: Hoare triple {5056#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {5056#false} is VALID [2018-11-18 23:12:49,986 INFO L273 TraceCheckUtils]: 37: Hoare triple {5056#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {5056#false} is VALID [2018-11-18 23:12:49,986 INFO L256 TraceCheckUtils]: 38: Hoare triple {5056#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {5056#false} is VALID [2018-11-18 23:12:49,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {5056#false} ~cond := #in~cond; {5056#false} is VALID [2018-11-18 23:12:49,986 INFO L273 TraceCheckUtils]: 40: Hoare triple {5056#false} assume 0 == ~cond; {5056#false} is VALID [2018-11-18 23:12:49,986 INFO L273 TraceCheckUtils]: 41: Hoare triple {5056#false} assume !false; {5056#false} is VALID [2018-11-18 23:12:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:12:49,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:12:49,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:12:49,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-18 23:12:49,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:49,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:12:50,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:50,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:12:50,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:12:50,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:12:50,355 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand 3 states. [2018-11-18 23:12:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:50,924 INFO L93 Difference]: Finished difference Result 169 states and 200 transitions. [2018-11-18 23:12:50,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:12:50,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-18 23:12:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:12:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-18 23:12:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:12:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-18 23:12:50,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-18 23:12:51,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:51,711 INFO L225 Difference]: With dead ends: 169 [2018-11-18 23:12:51,711 INFO L226 Difference]: Without dead ends: 115 [2018-11-18 23:12:51,712 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-18 23:12:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-18 23:12:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-18 23:12:52,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:52,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 115 states. [2018-11-18 23:12:52,210 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-18 23:12:52,211 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-18 23:12:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:52,215 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-11-18 23:12:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2018-11-18 23:12:52,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:52,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:52,216 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-18 23:12:52,216 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-18 23:12:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:52,221 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-11-18 23:12:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2018-11-18 23:12:52,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:52,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:52,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:52,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 23:12:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2018-11-18 23:12:52,226 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 42 [2018-11-18 23:12:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:52,227 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2018-11-18 23:12:52,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:12:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2018-11-18 23:12:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 23:12:52,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:52,228 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 23:12:52,228 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:52,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:52,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1742970600, now seen corresponding path program 2 times [2018-11-18 23:12:52,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:52,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:52,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:52,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:12:52,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:52,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {5652#true} call ULTIMATE.init(); {5652#true} is VALID [2018-11-18 23:12:52,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {5652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {5652#true} is VALID [2018-11-18 23:12:52,465 INFO L273 TraceCheckUtils]: 2: Hoare triple {5652#true} assume true; {5652#true} is VALID [2018-11-18 23:12:52,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5652#true} {5652#true} #91#return; {5652#true} is VALID [2018-11-18 23:12:52,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {5652#true} call #t~ret7 := main(); {5652#true} is VALID [2018-11-18 23:12:52,466 INFO L273 TraceCheckUtils]: 5: Hoare triple {5652#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {5652#true} is VALID [2018-11-18 23:12:52,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {5652#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {5652#true} is VALID [2018-11-18 23:12:52,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {5652#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {5652#true} is VALID [2018-11-18 23:12:52,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {5652#true} assume true; {5652#true} is VALID [2018-11-18 23:12:52,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {5652#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {5652#true} is VALID [2018-11-18 23:12:52,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {5652#true} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {5652#true} is VALID [2018-11-18 23:12:52,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {5652#true} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-18 23:12:52,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-18 23:12:52,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-18 23:12:52,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-18 23:12:52,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume true; {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-18 23:12:52,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-18 23:12:52,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-18 23:12:52,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {5653#false} is VALID [2018-11-18 23:12:52,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {5653#false} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {5653#false} is VALID [2018-11-18 23:12:52,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {5653#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {5653#false} is VALID [2018-11-18 23:12:52,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {5653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5653#false} is VALID [2018-11-18 23:12:52,565 INFO L273 TraceCheckUtils]: 22: Hoare triple {5653#false} assume true; {5653#false} is VALID [2018-11-18 23:12:52,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {5653#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {5653#false} is VALID [2018-11-18 23:12:52,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {5653#false} ~i~0 := 0; {5653#false} is VALID [2018-11-18 23:12:52,565 INFO L273 TraceCheckUtils]: 25: Hoare triple {5653#false} assume true; {5653#false} is VALID [2018-11-18 23:12:52,566 INFO L273 TraceCheckUtils]: 26: Hoare triple {5653#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {5653#false} is VALID [2018-11-18 23:12:52,566 INFO L273 TraceCheckUtils]: 27: Hoare triple {5653#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {5653#false} is VALID [2018-11-18 23:12:52,566 INFO L256 TraceCheckUtils]: 28: Hoare triple {5653#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {5652#true} is VALID [2018-11-18 23:12:52,566 INFO L273 TraceCheckUtils]: 29: Hoare triple {5652#true} ~cond := #in~cond; {5652#true} is VALID [2018-11-18 23:12:52,566 INFO L273 TraceCheckUtils]: 30: Hoare triple {5652#true} assume !(0 == ~cond); {5652#true} is VALID [2018-11-18 23:12:52,566 INFO L273 TraceCheckUtils]: 31: Hoare triple {5652#true} assume true; {5652#true} is VALID [2018-11-18 23:12:52,567 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {5652#true} {5653#false} #95#return; {5653#false} is VALID [2018-11-18 23:12:52,567 INFO L273 TraceCheckUtils]: 33: Hoare triple {5653#false} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {5653#false} is VALID [2018-11-18 23:12:52,567 INFO L273 TraceCheckUtils]: 34: Hoare triple {5653#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5653#false} is VALID [2018-11-18 23:12:52,567 INFO L273 TraceCheckUtils]: 35: Hoare triple {5653#false} assume true; {5653#false} is VALID [2018-11-18 23:12:52,567 INFO L273 TraceCheckUtils]: 36: Hoare triple {5653#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {5653#false} is VALID [2018-11-18 23:12:52,568 INFO L273 TraceCheckUtils]: 37: Hoare triple {5653#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {5653#false} is VALID [2018-11-18 23:12:52,568 INFO L256 TraceCheckUtils]: 38: Hoare triple {5653#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {5653#false} is VALID [2018-11-18 23:12:52,568 INFO L273 TraceCheckUtils]: 39: Hoare triple {5653#false} ~cond := #in~cond; {5653#false} is VALID [2018-11-18 23:12:52,568 INFO L273 TraceCheckUtils]: 40: Hoare triple {5653#false} assume 0 == ~cond; {5653#false} is VALID [2018-11-18 23:12:52,568 INFO L273 TraceCheckUtils]: 41: Hoare triple {5653#false} assume !false; {5653#false} is VALID [2018-11-18 23:12:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:12:52,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:12:52,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:12:52,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-18 23:12:52,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:52,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:12:52,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:52,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:12:52,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:12:52,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:12:52,618 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand 3 states. [2018-11-18 23:12:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:53,285 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-11-18 23:12:53,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:12:53,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-18 23:12:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:12:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:12:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-18 23:12:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:12:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-18 23:12:53,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-18 23:12:53,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:53,946 INFO L225 Difference]: With dead ends: 118 [2018-11-18 23:12:53,946 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 23:12:53,947 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:12:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 23:12:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-18 23:12:54,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:12:54,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-18 23:12:54,410 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-18 23:12:54,410 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-18 23:12:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:54,413 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-11-18 23:12:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2018-11-18 23:12:54,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:54,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:54,414 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-18 23:12:54,414 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-18 23:12:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:12:54,418 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-11-18 23:12:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2018-11-18 23:12:54,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:12:54,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:12:54,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:12:54,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:12:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-18 23:12:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2018-11-18 23:12:54,423 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 42 [2018-11-18 23:12:54,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:12:54,423 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-11-18 23:12:54,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:12:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2018-11-18 23:12:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 23:12:54,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:12:54,424 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-18 23:12:54,424 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:12:54,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:12:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1172721628, now seen corresponding path program 2 times [2018-11-18 23:12:54,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:12:54,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:12:54,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:54,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:12:54,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:12:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:54,840 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-18 23:12:55,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {6101#true} call ULTIMATE.init(); {6101#true} is VALID [2018-11-18 23:12:55,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {6101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {6101#true} is VALID [2018-11-18 23:12:55,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {6101#true} assume true; {6101#true} is VALID [2018-11-18 23:12:55,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6101#true} {6101#true} #91#return; {6101#true} is VALID [2018-11-18 23:12:55,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {6101#true} call #t~ret7 := main(); {6101#true} is VALID [2018-11-18 23:12:55,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {6101#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {6101#true} is VALID [2018-11-18 23:12:55,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {6101#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {6103#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-18 23:12:55,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {6103#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-18 23:12:55,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume true; {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-18 23:12:55,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-18 23:12:55,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-18 23:12:55,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-18 23:12:55,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {6105#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (+ main_~CCCELVOL1~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) main_~CCCELVOL1~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {6105#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (+ main_~CCCELVOL1~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) main_~CCCELVOL1~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {6106#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {6106#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6107#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,570 INFO L273 TraceCheckUtils]: 15: Hoare triple {6107#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume true; {6107#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {6107#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {6108#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {6108#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} ~i~0 := 0; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,574 INFO L273 TraceCheckUtils]: 18: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,576 INFO L256 TraceCheckUtils]: 21: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6101#true} is VALID [2018-11-18 23:12:55,577 INFO L273 TraceCheckUtils]: 22: Hoare triple {6101#true} ~cond := #in~cond; {6101#true} is VALID [2018-11-18 23:12:55,577 INFO L273 TraceCheckUtils]: 23: Hoare triple {6101#true} assume !(0 == ~cond); {6101#true} is VALID [2018-11-18 23:12:55,577 INFO L273 TraceCheckUtils]: 24: Hoare triple {6101#true} assume true; {6101#true} is VALID [2018-11-18 23:12:55,578 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {6101#true} {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,579 INFO L273 TraceCheckUtils]: 26: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,580 INFO L273 TraceCheckUtils]: 27: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,581 INFO L273 TraceCheckUtils]: 28: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,582 INFO L273 TraceCheckUtils]: 29: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,583 INFO L273 TraceCheckUtils]: 30: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,584 INFO L256 TraceCheckUtils]: 31: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6101#true} is VALID [2018-11-18 23:12:55,584 INFO L273 TraceCheckUtils]: 32: Hoare triple {6101#true} ~cond := #in~cond; {6101#true} is VALID [2018-11-18 23:12:55,584 INFO L273 TraceCheckUtils]: 33: Hoare triple {6101#true} assume !(0 == ~cond); {6101#true} is VALID [2018-11-18 23:12:55,584 INFO L273 TraceCheckUtils]: 34: Hoare triple {6101#true} assume true; {6101#true} is VALID [2018-11-18 23:12:55,585 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {6101#true} {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,586 INFO L273 TraceCheckUtils]: 36: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:12:55,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6111#(<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:12:55,588 INFO L273 TraceCheckUtils]: 38: Hoare triple {6111#(<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {6111#(<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:12:55,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {6111#(<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6112#|main_#t~short6|} is VALID [2018-11-18 23:12:55,590 INFO L273 TraceCheckUtils]: 40: Hoare triple {6112#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {6102#false} is VALID [2018-11-18 23:12:55,590 INFO L256 TraceCheckUtils]: 41: Hoare triple {6102#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6102#false} is VALID [2018-11-18 23:12:55,590 INFO L273 TraceCheckUtils]: 42: Hoare triple {6102#false} ~cond := #in~cond; {6102#false} is VALID [2018-11-18 23:12:55,590 INFO L273 TraceCheckUtils]: 43: Hoare triple {6102#false} assume 0 == ~cond; {6102#false} is VALID [2018-11-18 23:12:55,591 INFO L273 TraceCheckUtils]: 44: Hoare triple {6102#false} assume !false; {6102#false} is VALID [2018-11-18 23:12:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:12:55,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:12:55,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:12:55,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:12:55,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:12:55,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:12:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:12:55,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:12:55,736 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-18 23:12:55,741 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-18 23:12:55,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:55,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:55,762 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-18 23:12:55,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-18 23:12:55,767 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:55,823 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 23 treesize of output 18 [2018-11-18 23:12:55,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:55,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:12:55,834 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 18 treesize of output 37 [2018-11-18 23:12:55,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:12:55,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:12:55,864 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-18 23:12:55,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2018-11-18 23:12:55,868 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:12:56,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {6101#true} call ULTIMATE.init(); {6101#true} is VALID [2018-11-18 23:12:56,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {6101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {6101#true} is VALID [2018-11-18 23:12:56,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {6101#true} assume true; {6101#true} is VALID [2018-11-18 23:12:56,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6101#true} {6101#true} #91#return; {6101#true} is VALID [2018-11-18 23:12:56,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {6101#true} call #t~ret7 := main(); {6101#true} is VALID [2018-11-18 23:12:56,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {6101#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {6101#true} is VALID [2018-11-18 23:12:56,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {6101#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {6134#(and (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:56,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {6134#(and (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:56,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume true; {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:56,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:56,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:56,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:56,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {6154#(and (<= main_~CCCELVOL1~0 1) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:12:56,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {6154#(and (<= main_~CCCELVOL1~0 1) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume true; {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} ~i~0 := 0; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,504 INFO L273 TraceCheckUtils]: 18: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume true; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,505 INFO L273 TraceCheckUtils]: 19: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume #t~short6; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,508 INFO L256 TraceCheckUtils]: 21: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-18 23:12:56,509 INFO L273 TraceCheckUtils]: 22: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} ~cond := #in~cond; {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-18 23:12:56,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} assume !(0 == ~cond); {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-18 23:12:56,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} assume true; {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-18 23:12:56,512 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} #95#return; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,514 INFO L273 TraceCheckUtils]: 27: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume true; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,517 INFO L273 TraceCheckUtils]: 30: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume #t~short6; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,520 INFO L256 TraceCheckUtils]: 31: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-18 23:12:56,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} ~cond := #in~cond; {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-18 23:12:56,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} assume !(0 == ~cond); {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-18 23:12:56,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} assume true; {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-18 23:12:56,523 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} #95#return; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,525 INFO L273 TraceCheckUtils]: 37: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6234#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {6234#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume true; {6234#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-18 23:12:56,528 INFO L273 TraceCheckUtils]: 39: Hoare triple {6234#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6112#|main_#t~short6|} is VALID [2018-11-18 23:12:56,528 INFO L273 TraceCheckUtils]: 40: Hoare triple {6112#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {6102#false} is VALID [2018-11-18 23:12:56,529 INFO L256 TraceCheckUtils]: 41: Hoare triple {6102#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6102#false} is VALID [2018-11-18 23:12:56,529 INFO L273 TraceCheckUtils]: 42: Hoare triple {6102#false} ~cond := #in~cond; {6102#false} is VALID [2018-11-18 23:12:56,529 INFO L273 TraceCheckUtils]: 43: Hoare triple {6102#false} assume 0 == ~cond; {6102#false} is VALID [2018-11-18 23:12:56,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {6102#false} assume !false; {6102#false} is VALID [2018-11-18 23:12:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:12:56,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:12:56,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-18 23:12:56,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-18 23:12:56,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:12:56,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 23:12:56,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:12:56,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 23:12:56,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 23:12:56,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-18 23:12:56,669 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 20 states. [2018-11-18 23:13:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:03,559 INFO L93 Difference]: Finished difference Result 246 states and 297 transitions. [2018-11-18 23:13:03,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 23:13:03,560 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-18 23:13:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:13:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 23:13:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 191 transitions. [2018-11-18 23:13:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 23:13:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 191 transitions. [2018-11-18 23:13:03,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 191 transitions. [2018-11-18 23:13:04,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:04,360 INFO L225 Difference]: With dead ends: 246 [2018-11-18 23:13:04,361 INFO L226 Difference]: Without dead ends: 212 [2018-11-18 23:13:04,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=399, Invalid=1581, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 23:13:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-18 23:13:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 145. [2018-11-18 23:13:05,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:13:05,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 145 states. [2018-11-18 23:13:05,160 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 145 states. [2018-11-18 23:13:05,160 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 145 states. [2018-11-18 23:13:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:05,169 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2018-11-18 23:13:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 254 transitions. [2018-11-18 23:13:05,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:05,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:05,170 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 212 states. [2018-11-18 23:13:05,170 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 212 states. [2018-11-18 23:13:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:05,179 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2018-11-18 23:13:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 254 transitions. [2018-11-18 23:13:05,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:05,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:05,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:13:05,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:13:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 23:13:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 173 transitions. [2018-11-18 23:13:05,185 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 173 transitions. Word has length 45 [2018-11-18 23:13:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:13:05,186 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 173 transitions. [2018-11-18 23:13:05,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 23:13:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 173 transitions. [2018-11-18 23:13:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 23:13:05,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:13:05,187 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-18 23:13:05,187 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:13:05,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:13:05,188 INFO L82 PathProgramCache]: Analyzing trace with hash -897962014, now seen corresponding path program 1 times [2018-11-18 23:13:05,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:13:05,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:13:05,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:05,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:13:05,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:05,489 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2018-11-18 23:13:06,274 WARN L180 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-11-18 23:13:06,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {7224#true} call ULTIMATE.init(); {7224#true} is VALID [2018-11-18 23:13:06,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {7224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {7224#true} is VALID [2018-11-18 23:13:06,846 INFO L273 TraceCheckUtils]: 2: Hoare triple {7224#true} assume true; {7224#true} is VALID [2018-11-18 23:13:06,846 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7224#true} {7224#true} #91#return; {7224#true} is VALID [2018-11-18 23:13:06,846 INFO L256 TraceCheckUtils]: 4: Hoare triple {7224#true} call #t~ret7 := main(); {7224#true} is VALID [2018-11-18 23:13:06,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {7224#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {7224#true} is VALID [2018-11-18 23:13:06,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {7224#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {7226#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-18 23:13:06,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {7226#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume true; {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {7228#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))))} is VALID [2018-11-18 23:13:06,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {7228#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {7228#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))))} is VALID [2018-11-18 23:13:06,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {7228#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7229#(and (or (<= (* 4 main_~i~0) 7) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {7229#(and (or (<= (* 4 main_~i~0) 7) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume true; {7229#(and (or (<= (* 4 main_~i~0) 7) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {7229#(and (or (<= (* 4 main_~i~0) 7) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {7230#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {7230#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} ~i~0 := 0; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,862 INFO L273 TraceCheckUtils]: 19: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,864 INFO L256 TraceCheckUtils]: 21: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7224#true} is VALID [2018-11-18 23:13:06,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {7224#true} ~cond := #in~cond; {7224#true} is VALID [2018-11-18 23:13:06,864 INFO L273 TraceCheckUtils]: 23: Hoare triple {7224#true} assume !(0 == ~cond); {7224#true} is VALID [2018-11-18 23:13:06,864 INFO L273 TraceCheckUtils]: 24: Hoare triple {7224#true} assume true; {7224#true} is VALID [2018-11-18 23:13:06,865 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {7224#true} {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,866 INFO L273 TraceCheckUtils]: 26: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,867 INFO L273 TraceCheckUtils]: 27: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,867 INFO L273 TraceCheckUtils]: 28: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,868 INFO L273 TraceCheckUtils]: 29: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,869 INFO L273 TraceCheckUtils]: 30: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,869 INFO L256 TraceCheckUtils]: 31: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7224#true} is VALID [2018-11-18 23:13:06,869 INFO L273 TraceCheckUtils]: 32: Hoare triple {7224#true} ~cond := #in~cond; {7224#true} is VALID [2018-11-18 23:13:06,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {7224#true} assume !(0 == ~cond); {7224#true} is VALID [2018-11-18 23:13:06,870 INFO L273 TraceCheckUtils]: 34: Hoare triple {7224#true} assume true; {7224#true} is VALID [2018-11-18 23:13:06,871 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {7224#true} {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,871 INFO L273 TraceCheckUtils]: 36: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:06,873 INFO L273 TraceCheckUtils]: 37: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7233#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:13:06,873 INFO L273 TraceCheckUtils]: 38: Hoare triple {7233#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {7233#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:13:06,874 INFO L273 TraceCheckUtils]: 39: Hoare triple {7233#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7234#|main_#t~short6|} is VALID [2018-11-18 23:13:06,875 INFO L273 TraceCheckUtils]: 40: Hoare triple {7234#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {7225#false} is VALID [2018-11-18 23:13:06,875 INFO L256 TraceCheckUtils]: 41: Hoare triple {7225#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7225#false} is VALID [2018-11-18 23:13:06,875 INFO L273 TraceCheckUtils]: 42: Hoare triple {7225#false} ~cond := #in~cond; {7225#false} is VALID [2018-11-18 23:13:06,875 INFO L273 TraceCheckUtils]: 43: Hoare triple {7225#false} assume 0 == ~cond; {7225#false} is VALID [2018-11-18 23:13:06,876 INFO L273 TraceCheckUtils]: 44: Hoare triple {7225#false} assume !false; {7225#false} is VALID [2018-11-18 23:13:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:13:06,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:13:06,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:13:06,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:13:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:06,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:13:06,997 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-18 23:13:07,002 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-18 23:13:07,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:07,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:07,019 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-18 23:13:07,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-18 23:13:07,022 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:13:07,055 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 23 treesize of output 18 [2018-11-18 23:13:07,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:07,064 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 18 treesize of output 27 [2018-11-18 23:13:07,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:07,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:07,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:07,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 23:13:07,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {7224#true} call ULTIMATE.init(); {7224#true} is VALID [2018-11-18 23:13:07,614 INFO L273 TraceCheckUtils]: 1: Hoare triple {7224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {7224#true} is VALID [2018-11-18 23:13:07,614 INFO L273 TraceCheckUtils]: 2: Hoare triple {7224#true} assume true; {7224#true} is VALID [2018-11-18 23:13:07,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7224#true} {7224#true} #91#return; {7224#true} is VALID [2018-11-18 23:13:07,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {7224#true} call #t~ret7 := main(); {7224#true} is VALID [2018-11-18 23:13:07,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {7224#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {7224#true} is VALID [2018-11-18 23:13:07,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {7224#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {7256#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-18 23:13:07,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {7256#(= |main_~#volArray~0.offset| 0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {7260#(and (= 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 + 4 * (4 * ~i~0 - 2), 4); {7276#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {7276#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} assume true; {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:07,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume true; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:07,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:07,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume #t~short6; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:07,650 INFO L256 TraceCheckUtils]: 21: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-18 23:13:07,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} ~cond := #in~cond; {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-18 23:13:07,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} assume !(0 == ~cond); {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-18 23:13:07,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} assume true; {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-18 23:13:07,652 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #95#return; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:07,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:07,654 INFO L273 TraceCheckUtils]: 27: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,657 INFO L273 TraceCheckUtils]: 30: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume #t~short6; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,658 INFO L256 TraceCheckUtils]: 31: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-18 23:13:07,659 INFO L273 TraceCheckUtils]: 32: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} ~cond := #in~cond; {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-18 23:13:07,664 INFO L273 TraceCheckUtils]: 33: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} assume !(0 == ~cond); {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-18 23:13:07,665 INFO L273 TraceCheckUtils]: 34: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} assume true; {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-18 23:13:07,665 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #95#return; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,666 INFO L273 TraceCheckUtils]: 37: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7356#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,667 INFO L273 TraceCheckUtils]: 38: Hoare triple {7356#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} assume true; {7356#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:07,668 INFO L273 TraceCheckUtils]: 39: Hoare triple {7356#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7234#|main_#t~short6|} is VALID [2018-11-18 23:13:07,668 INFO L273 TraceCheckUtils]: 40: Hoare triple {7234#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {7225#false} is VALID [2018-11-18 23:13:07,669 INFO L256 TraceCheckUtils]: 41: Hoare triple {7225#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7225#false} is VALID [2018-11-18 23:13:07,669 INFO L273 TraceCheckUtils]: 42: Hoare triple {7225#false} ~cond := #in~cond; {7225#false} is VALID [2018-11-18 23:13:07,669 INFO L273 TraceCheckUtils]: 43: Hoare triple {7225#false} assume 0 == ~cond; {7225#false} is VALID [2018-11-18 23:13:07,669 INFO L273 TraceCheckUtils]: 44: Hoare triple {7225#false} assume !false; {7225#false} is VALID [2018-11-18 23:13:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:13:07,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:13:07,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-18 23:13:07,695 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-18 23:13:07,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:13:07,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 23:13:07,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:07,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 23:13:07,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 23:13:07,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:13:07,790 INFO L87 Difference]: Start difference. First operand 145 states and 173 transitions. Second operand 19 states. [2018-11-18 23:13:11,859 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-11-18 23:13:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:18,193 INFO L93 Difference]: Finished difference Result 370 states and 446 transitions. [2018-11-18 23:13:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-18 23:13:18,194 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-18 23:13:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:13:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 23:13:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 226 transitions. [2018-11-18 23:13:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 23:13:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 226 transitions. [2018-11-18 23:13:18,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 226 transitions. [2018-11-18 23:13:18,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:18,973 INFO L225 Difference]: With dead ends: 370 [2018-11-18 23:13:18,973 INFO L226 Difference]: Without dead ends: 338 [2018-11-18 23:13:18,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=583, Invalid=2497, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 23:13:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-18 23:13:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 174. [2018-11-18 23:13:19,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:13:19,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand 174 states. [2018-11-18 23:13:19,845 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand 174 states. [2018-11-18 23:13:19,845 INFO L87 Difference]: Start difference. First operand 338 states. Second operand 174 states. [2018-11-18 23:13:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:19,857 INFO L93 Difference]: Finished difference Result 338 states and 408 transitions. [2018-11-18 23:13:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 408 transitions. [2018-11-18 23:13:19,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:19,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:19,859 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 338 states. [2018-11-18 23:13:19,859 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 338 states. [2018-11-18 23:13:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:19,871 INFO L93 Difference]: Finished difference Result 338 states and 408 transitions. [2018-11-18 23:13:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 408 transitions. [2018-11-18 23:13:19,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:19,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:19,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:13:19,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:13:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-18 23:13:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2018-11-18 23:13:19,879 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 45 [2018-11-18 23:13:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:13:19,879 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2018-11-18 23:13:19,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 23:13:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2018-11-18 23:13:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 23:13:19,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:13:19,880 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-18 23:13:19,881 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:13:19,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:13:19,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1245108186, now seen corresponding path program 1 times [2018-11-18 23:13:19,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:13:19,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:13:19,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:19,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:13:19,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:20,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {8815#true} call ULTIMATE.init(); {8815#true} is VALID [2018-11-18 23:13:20,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {8815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {8815#true} is VALID [2018-11-18 23:13:20,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {8815#true} assume true; {8815#true} is VALID [2018-11-18 23:13:20,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8815#true} {8815#true} #91#return; {8815#true} is VALID [2018-11-18 23:13:20,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {8815#true} call #t~ret7 := main(); {8815#true} is VALID [2018-11-18 23:13:20,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {8815#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {8815#true} is VALID [2018-11-18 23:13:20,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {8815#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-18 23:13:20,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-18 23:13:20,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume true; {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-18 23:13:20,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-18 23:13:20,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-18 23:13:20,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-18 23:13:20,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {8818#(<= (+ main_~CCCELVOL1~0 3) main_~MINVAL~0)} is VALID [2018-11-18 23:13:20,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {8818#(<= (+ main_~CCCELVOL1~0 3) main_~MINVAL~0)} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {8816#false} is VALID [2018-11-18 23:13:20,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {8816#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8816#false} is VALID [2018-11-18 23:13:20,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {8816#false} assume true; {8816#false} is VALID [2018-11-18 23:13:20,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {8816#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {8816#false} is VALID [2018-11-18 23:13:20,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {8816#false} ~i~0 := 0; {8816#false} is VALID [2018-11-18 23:13:20,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {8816#false} assume true; {8816#false} is VALID [2018-11-18 23:13:20,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {8816#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {8816#false} is VALID [2018-11-18 23:13:20,337 INFO L273 TraceCheckUtils]: 20: Hoare triple {8816#false} assume #t~short6; {8816#false} is VALID [2018-11-18 23:13:20,337 INFO L256 TraceCheckUtils]: 21: Hoare triple {8816#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {8815#true} is VALID [2018-11-18 23:13:20,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {8815#true} ~cond := #in~cond; {8815#true} is VALID [2018-11-18 23:13:20,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {8815#true} assume !(0 == ~cond); {8815#true} is VALID [2018-11-18 23:13:20,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {8815#true} assume true; {8815#true} is VALID [2018-11-18 23:13:20,337 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {8815#true} {8816#false} #95#return; {8816#false} is VALID [2018-11-18 23:13:20,337 INFO L273 TraceCheckUtils]: 26: Hoare triple {8816#false} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {8816#false} is VALID [2018-11-18 23:13:20,337 INFO L273 TraceCheckUtils]: 27: Hoare triple {8816#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8816#false} is VALID [2018-11-18 23:13:20,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {8816#false} assume true; {8816#false} is VALID [2018-11-18 23:13:20,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {8816#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {8816#false} is VALID [2018-11-18 23:13:20,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {8816#false} assume #t~short6; {8816#false} is VALID [2018-11-18 23:13:20,338 INFO L256 TraceCheckUtils]: 31: Hoare triple {8816#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {8815#true} is VALID [2018-11-18 23:13:20,338 INFO L273 TraceCheckUtils]: 32: Hoare triple {8815#true} ~cond := #in~cond; {8815#true} is VALID [2018-11-18 23:13:20,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {8815#true} assume !(0 == ~cond); {8815#true} is VALID [2018-11-18 23:13:20,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {8815#true} assume true; {8815#true} is VALID [2018-11-18 23:13:20,338 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {8815#true} {8816#false} #95#return; {8816#false} is VALID [2018-11-18 23:13:20,339 INFO L273 TraceCheckUtils]: 36: Hoare triple {8816#false} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {8816#false} is VALID [2018-11-18 23:13:20,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {8816#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8816#false} is VALID [2018-11-18 23:13:20,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {8816#false} assume true; {8816#false} is VALID [2018-11-18 23:13:20,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {8816#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {8816#false} is VALID [2018-11-18 23:13:20,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {8816#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {8816#false} is VALID [2018-11-18 23:13:20,339 INFO L256 TraceCheckUtils]: 41: Hoare triple {8816#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {8816#false} is VALID [2018-11-18 23:13:20,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {8816#false} ~cond := #in~cond; {8816#false} is VALID [2018-11-18 23:13:20,339 INFO L273 TraceCheckUtils]: 43: Hoare triple {8816#false} assume 0 == ~cond; {8816#false} is VALID [2018-11-18 23:13:20,340 INFO L273 TraceCheckUtils]: 44: Hoare triple {8816#false} assume !false; {8816#false} is VALID [2018-11-18 23:13:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 23:13:20,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:13:20,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:13:20,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-18 23:13:20,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:13:20,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:13:20,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:20,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:13:20,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:13:20,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:13:20,372 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand 4 states. [2018-11-18 23:13:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:22,215 INFO L93 Difference]: Finished difference Result 280 states and 341 transitions. [2018-11-18 23:13:22,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:13:22,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-18 23:13:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:13:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:13:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-18 23:13:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:13:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-18 23:13:22,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2018-11-18 23:13:22,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:22,385 INFO L225 Difference]: With dead ends: 280 [2018-11-18 23:13:22,385 INFO L226 Difference]: Without dead ends: 200 [2018-11-18 23:13:22,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:13:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-18 23:13:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 173. [2018-11-18 23:13:23,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:13:23,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 173 states. [2018-11-18 23:13:23,830 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 173 states. [2018-11-18 23:13:23,830 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 173 states. [2018-11-18 23:13:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:23,835 INFO L93 Difference]: Finished difference Result 200 states and 242 transitions. [2018-11-18 23:13:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 242 transitions. [2018-11-18 23:13:23,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:23,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:23,837 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 200 states. [2018-11-18 23:13:23,837 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 200 states. [2018-11-18 23:13:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:23,842 INFO L93 Difference]: Finished difference Result 200 states and 242 transitions. [2018-11-18 23:13:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 242 transitions. [2018-11-18 23:13:23,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:23,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:23,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:13:23,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:13:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 23:13:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 210 transitions. [2018-11-18 23:13:23,847 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 210 transitions. Word has length 45 [2018-11-18 23:13:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:13:23,847 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 210 transitions. [2018-11-18 23:13:23,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:13:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 210 transitions. [2018-11-18 23:13:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 23:13:23,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:13:23,848 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-18 23:13:23,849 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:13:23,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:13:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash -970348572, now seen corresponding path program 1 times [2018-11-18 23:13:23,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:13:23,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:13:23,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:23,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:13:23,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:24,432 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-11-18 23:13:24,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {9789#true} call ULTIMATE.init(); {9789#true} is VALID [2018-11-18 23:13:24,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {9789#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {9789#true} is VALID [2018-11-18 23:13:24,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {9789#true} assume true; {9789#true} is VALID [2018-11-18 23:13:24,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9789#true} {9789#true} #91#return; {9789#true} is VALID [2018-11-18 23:13:24,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {9789#true} call #t~ret7 := main(); {9789#true} is VALID [2018-11-18 23:13:24,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {9789#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {9789#true} is VALID [2018-11-18 23:13:24,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {9789#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {9791#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-18 23:13:24,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {9791#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume true; {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {9793#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,665 INFO L273 TraceCheckUtils]: 13: Hoare triple {9793#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (< 0 (div ~CELLCOUNT~0 4)))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {9793#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {9793#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (< 0 (div ~CELLCOUNT~0 4)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9794#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {9794#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume true; {9794#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {9794#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {9795#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {9795#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} ~i~0 := 0; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,672 INFO L256 TraceCheckUtils]: 21: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9789#true} is VALID [2018-11-18 23:13:24,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {9789#true} ~cond := #in~cond; {9789#true} is VALID [2018-11-18 23:13:24,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {9789#true} assume !(0 == ~cond); {9789#true} is VALID [2018-11-18 23:13:24,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {9789#true} assume true; {9789#true} is VALID [2018-11-18 23:13:24,674 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {9789#true} {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,675 INFO L273 TraceCheckUtils]: 26: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,676 INFO L273 TraceCheckUtils]: 27: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,676 INFO L273 TraceCheckUtils]: 28: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,677 INFO L273 TraceCheckUtils]: 29: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,698 INFO L273 TraceCheckUtils]: 30: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,698 INFO L256 TraceCheckUtils]: 31: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9789#true} is VALID [2018-11-18 23:13:24,698 INFO L273 TraceCheckUtils]: 32: Hoare triple {9789#true} ~cond := #in~cond; {9789#true} is VALID [2018-11-18 23:13:24,698 INFO L273 TraceCheckUtils]: 33: Hoare triple {9789#true} assume !(0 == ~cond); {9789#true} is VALID [2018-11-18 23:13:24,699 INFO L273 TraceCheckUtils]: 34: Hoare triple {9789#true} assume true; {9789#true} is VALID [2018-11-18 23:13:24,724 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {9789#true} {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-18 23:13:24,746 INFO L273 TraceCheckUtils]: 37: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:13:24,755 INFO L273 TraceCheckUtils]: 38: Hoare triple {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:13:24,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:13:24,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {9799#|main_#t~short6|} is VALID [2018-11-18 23:13:24,781 INFO L256 TraceCheckUtils]: 41: Hoare triple {9799#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-18 23:13:24,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {9800#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9801#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-18 23:13:24,784 INFO L273 TraceCheckUtils]: 43: Hoare triple {9801#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9790#false} is VALID [2018-11-18 23:13:24,784 INFO L273 TraceCheckUtils]: 44: Hoare triple {9790#false} assume !false; {9790#false} is VALID [2018-11-18 23:13:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:13:24,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:13:24,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:13:24,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:13:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:24,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:13:24,899 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-18 23:13:24,906 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-18 23:13:24,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:24,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:24,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:24,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-18 23:13:25,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 23 treesize of output 18 [2018-11-18 23:13:25,043 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:13:25,044 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 18 treesize of output 27 [2018-11-18 23:13:25,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:25,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:25,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:25,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 23:13:25,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {9789#true} call ULTIMATE.init(); {9789#true} is VALID [2018-11-18 23:13:25,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {9789#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {9789#true} is VALID [2018-11-18 23:13:25,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {9789#true} assume true; {9789#true} is VALID [2018-11-18 23:13:25,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9789#true} {9789#true} #91#return; {9789#true} is VALID [2018-11-18 23:13:25,535 INFO L256 TraceCheckUtils]: 4: Hoare triple {9789#true} call #t~ret7 := main(); {9789#true} is VALID [2018-11-18 23:13:25,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {9789#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {9789#true} is VALID [2018-11-18 23:13:25,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {9789#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {9823#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-18 23:13:25,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {9823#(= |main_~#volArray~0.offset| 0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:25,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:25,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:25,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:25,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:25,539 INFO L273 TraceCheckUtils]: 12: Hoare triple {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {9843#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:25,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {9843#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,541 INFO L273 TraceCheckUtils]: 14: Hoare triple {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume true; {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} ~i~0 := 0; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:25,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume true; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:25,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:25,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume #t~short6; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:25,548 INFO L256 TraceCheckUtils]: 21: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-18 23:13:25,549 INFO L273 TraceCheckUtils]: 22: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} ~cond := #in~cond; {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-18 23:13:25,549 INFO L273 TraceCheckUtils]: 23: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} assume !(0 == ~cond); {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-18 23:13:25,550 INFO L273 TraceCheckUtils]: 24: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} assume true; {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-18 23:13:25,551 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} #95#return; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:25,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:25,553 INFO L273 TraceCheckUtils]: 27: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume true; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume #t~short6; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,557 INFO L256 TraceCheckUtils]: 31: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-18 23:13:25,558 INFO L273 TraceCheckUtils]: 32: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} ~cond := #in~cond; {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-18 23:13:25,558 INFO L273 TraceCheckUtils]: 33: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} assume !(0 == ~cond); {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-18 23:13:25,559 INFO L273 TraceCheckUtils]: 34: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} assume true; {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-18 23:13:25,560 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} #95#return; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,561 INFO L273 TraceCheckUtils]: 36: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,562 INFO L273 TraceCheckUtils]: 37: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume true; {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,564 INFO L273 TraceCheckUtils]: 39: Hoare triple {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-18 23:13:25,565 INFO L273 TraceCheckUtils]: 40: Hoare triple {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {9799#|main_#t~short6|} is VALID [2018-11-18 23:13:25,567 INFO L256 TraceCheckUtils]: 41: Hoare triple {9799#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9936#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:13:25,567 INFO L273 TraceCheckUtils]: 42: Hoare triple {9936#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9940#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:13:25,568 INFO L273 TraceCheckUtils]: 43: Hoare triple {9940#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9790#false} is VALID [2018-11-18 23:13:25,568 INFO L273 TraceCheckUtils]: 44: Hoare triple {9790#false} assume !false; {9790#false} is VALID [2018-11-18 23:13:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:13:25,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:13:25,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-18 23:13:25,597 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-11-18 23:13:25,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:13:25,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 23:13:26,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:26,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 23:13:26,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 23:13:26,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-11-18 23:13:26,171 INFO L87 Difference]: Start difference. First operand 173 states and 210 transitions. Second operand 23 states. [2018-11-18 23:13:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:35,216 INFO L93 Difference]: Finished difference Result 396 states and 486 transitions. [2018-11-18 23:13:35,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 23:13:35,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-11-18 23:13:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:13:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 23:13:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 197 transitions. [2018-11-18 23:13:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 23:13:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 197 transitions. [2018-11-18 23:13:35,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 197 transitions. [2018-11-18 23:13:35,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:35,576 INFO L225 Difference]: With dead ends: 396 [2018-11-18 23:13:35,576 INFO L226 Difference]: Without dead ends: 394 [2018-11-18 23:13:35,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=543, Invalid=2879, Unknown=0, NotChecked=0, Total=3422 [2018-11-18 23:13:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-11-18 23:13:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 259. [2018-11-18 23:13:37,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:13:37,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand 259 states. [2018-11-18 23:13:37,069 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand 259 states. [2018-11-18 23:13:37,069 INFO L87 Difference]: Start difference. First operand 394 states. Second operand 259 states. [2018-11-18 23:13:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:37,082 INFO L93 Difference]: Finished difference Result 394 states and 483 transitions. [2018-11-18 23:13:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 483 transitions. [2018-11-18 23:13:37,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:37,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:37,084 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand 394 states. [2018-11-18 23:13:37,084 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 394 states. [2018-11-18 23:13:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:37,096 INFO L93 Difference]: Finished difference Result 394 states and 483 transitions. [2018-11-18 23:13:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 483 transitions. [2018-11-18 23:13:37,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:37,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:37,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:13:37,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:13:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-18 23:13:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 314 transitions. [2018-11-18 23:13:37,104 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 314 transitions. Word has length 45 [2018-11-18 23:13:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:13:37,105 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 314 transitions. [2018-11-18 23:13:37,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 23:13:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 314 transitions. [2018-11-18 23:13:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 23:13:37,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:13:37,106 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:13:37,106 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:13:37,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:13:37,107 INFO L82 PathProgramCache]: Analyzing trace with hash 988483951, now seen corresponding path program 3 times [2018-11-18 23:13:37,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:13:37,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:13:37,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:37,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:13:37,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:37,847 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-11-18 23:13:38,299 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2018-11-18 23:13:38,564 INFO L256 TraceCheckUtils]: 0: Hoare triple {11642#true} call ULTIMATE.init(); {11642#true} is VALID [2018-11-18 23:13:38,564 INFO L273 TraceCheckUtils]: 1: Hoare triple {11642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {11642#true} is VALID [2018-11-18 23:13:38,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {11642#true} assume true; {11642#true} is VALID [2018-11-18 23:13:38,565 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11642#true} {11642#true} #91#return; {11642#true} is VALID [2018-11-18 23:13:38,565 INFO L256 TraceCheckUtils]: 4: Hoare triple {11642#true} call #t~ret7 := main(); {11642#true} is VALID [2018-11-18 23:13:38,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {11642#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {11642#true} is VALID [2018-11-18 23:13:38,566 INFO L273 TraceCheckUtils]: 6: Hoare triple {11642#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {11644#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-18 23:13:38,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {11644#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:38,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:38,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:38,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:38,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:38,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:38,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {11645#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {11646#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)))))} is VALID [2018-11-18 23:13:38,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {11646#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11647#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 4))))) (<= (* 4 main_~i~0) 7)))} is VALID [2018-11-18 23:13:38,574 INFO L273 TraceCheckUtils]: 15: Hoare triple {11647#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 4))))) (<= (* 4 main_~i~0) 7)))} assume true; {11647#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 4))))) (<= (* 4 main_~i~0) 7)))} is VALID [2018-11-18 23:13:38,575 INFO L273 TraceCheckUtils]: 16: Hoare triple {11647#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 4))))) (<= (* 4 main_~i~0) 7)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {11648#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)))} is VALID [2018-11-18 23:13:38,576 INFO L273 TraceCheckUtils]: 17: Hoare triple {11648#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)))} ~i~0 := 0; {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:38,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} assume true; {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:38,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:38,579 INFO L273 TraceCheckUtils]: 20: Hoare triple {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} assume #t~short6; {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:38,579 INFO L256 TraceCheckUtils]: 21: Hoare triple {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {11642#true} is VALID [2018-11-18 23:13:38,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {11642#true} ~cond := #in~cond; {11642#true} is VALID [2018-11-18 23:13:38,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {11642#true} assume !(0 == ~cond); {11642#true} is VALID [2018-11-18 23:13:38,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {11642#true} assume true; {11642#true} is VALID [2018-11-18 23:13:38,580 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {11642#true} {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} #95#return; {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:38,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} is VALID [2018-11-18 23:13:38,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {11649#(and (<= ~CELLCOUNT~0 4) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 3)) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:38,583 INFO L273 TraceCheckUtils]: 28: Hoare triple {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} assume true; {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:38,584 INFO L273 TraceCheckUtils]: 29: Hoare triple {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:38,585 INFO L273 TraceCheckUtils]: 30: Hoare triple {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} assume #t~short6; {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:38,585 INFO L256 TraceCheckUtils]: 31: Hoare triple {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {11642#true} is VALID [2018-11-18 23:13:38,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {11642#true} ~cond := #in~cond; {11642#true} is VALID [2018-11-18 23:13:38,585 INFO L273 TraceCheckUtils]: 33: Hoare triple {11642#true} assume !(0 == ~cond); {11642#true} is VALID [2018-11-18 23:13:38,586 INFO L273 TraceCheckUtils]: 34: Hoare triple {11642#true} assume true; {11642#true} is VALID [2018-11-18 23:13:38,586 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {11642#true} {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} #95#return; {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:38,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:38,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {11650#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:38,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} assume true; {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:38,590 INFO L273 TraceCheckUtils]: 39: Hoare triple {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:38,591 INFO L273 TraceCheckUtils]: 40: Hoare triple {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} assume #t~short6; {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:38,591 INFO L256 TraceCheckUtils]: 41: Hoare triple {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {11642#true} is VALID [2018-11-18 23:13:38,591 INFO L273 TraceCheckUtils]: 42: Hoare triple {11642#true} ~cond := #in~cond; {11642#true} is VALID [2018-11-18 23:13:38,591 INFO L273 TraceCheckUtils]: 43: Hoare triple {11642#true} assume !(0 == ~cond); {11642#true} is VALID [2018-11-18 23:13:38,592 INFO L273 TraceCheckUtils]: 44: Hoare triple {11642#true} assume true; {11642#true} is VALID [2018-11-18 23:13:38,593 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {11642#true} {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} #95#return; {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:38,593 INFO L273 TraceCheckUtils]: 46: Hoare triple {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:38,595 INFO L273 TraceCheckUtils]: 47: Hoare triple {11651#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11652#(or (<= ~CELLCOUNT~0 main_~i~0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} is VALID [2018-11-18 23:13:38,595 INFO L273 TraceCheckUtils]: 48: Hoare triple {11652#(or (<= ~CELLCOUNT~0 main_~i~0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} assume true; {11652#(or (<= ~CELLCOUNT~0 main_~i~0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} is VALID [2018-11-18 23:13:38,596 INFO L273 TraceCheckUtils]: 49: Hoare triple {11652#(or (<= ~CELLCOUNT~0 main_~i~0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {11653#|main_#t~short6|} is VALID [2018-11-18 23:13:38,596 INFO L273 TraceCheckUtils]: 50: Hoare triple {11653#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {11643#false} is VALID [2018-11-18 23:13:38,597 INFO L256 TraceCheckUtils]: 51: Hoare triple {11643#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {11643#false} is VALID [2018-11-18 23:13:38,597 INFO L273 TraceCheckUtils]: 52: Hoare triple {11643#false} ~cond := #in~cond; {11643#false} is VALID [2018-11-18 23:13:38,597 INFO L273 TraceCheckUtils]: 53: Hoare triple {11643#false} assume 0 == ~cond; {11643#false} is VALID [2018-11-18 23:13:38,597 INFO L273 TraceCheckUtils]: 54: Hoare triple {11643#false} assume !false; {11643#false} is VALID [2018-11-18 23:13:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 23:13:38,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:13:38,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:13:38,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:13:38,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 23:13:38,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:13:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:38,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:13:38,732 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 13 treesize of output 10 [2018-11-18 23:13:38,743 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 10 treesize of output 9 [2018-11-18 23:13:38,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:38,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:38,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:38,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 23:13:39,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {11642#true} call ULTIMATE.init(); {11642#true} is VALID [2018-11-18 23:13:39,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {11642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {11642#true} is VALID [2018-11-18 23:13:39,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {11642#true} assume true; {11642#true} is VALID [2018-11-18 23:13:39,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11642#true} {11642#true} #91#return; {11642#true} is VALID [2018-11-18 23:13:39,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {11642#true} call #t~ret7 := main(); {11642#true} is VALID [2018-11-18 23:13:39,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {11642#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {11642#true} is VALID [2018-11-18 23:13:39,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {11642#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {11675#(= 1 main_~CCCELVOL1~0)} is VALID [2018-11-18 23:13:39,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {11675#(= 1 main_~CCCELVOL1~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} assume true; {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,490 INFO L273 TraceCheckUtils]: 10: Hoare triple {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {11679#(and (= 1 main_~CCCELVOL1~0) (= main_~i~0 1))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {11698#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,492 INFO L273 TraceCheckUtils]: 14: Hoare triple {11698#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11698#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,492 INFO L273 TraceCheckUtils]: 15: Hoare triple {11698#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} assume true; {11698#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,493 INFO L273 TraceCheckUtils]: 16: Hoare triple {11698#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {11698#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {11698#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} ~i~0 := 0; {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} is VALID [2018-11-18 23:13:39,494 INFO L273 TraceCheckUtils]: 18: Hoare triple {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} assume true; {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} is VALID [2018-11-18 23:13:39,495 INFO L273 TraceCheckUtils]: 19: Hoare triple {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} is VALID [2018-11-18 23:13:39,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} assume #t~short6; {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} is VALID [2018-11-18 23:13:39,497 INFO L256 TraceCheckUtils]: 21: Hoare triple {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} ~cond := #in~cond; {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} assume !(0 == ~cond); {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,499 INFO L273 TraceCheckUtils]: 24: Hoare triple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} assume true; {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,500 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} #95#return; {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} is VALID [2018-11-18 23:13:39,500 INFO L273 TraceCheckUtils]: 26: Hoare triple {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} is VALID [2018-11-18 23:13:39,501 INFO L273 TraceCheckUtils]: 27: Hoare triple {11711#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,502 INFO L273 TraceCheckUtils]: 28: Hoare triple {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} assume true; {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} assume #t~short6; {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,505 INFO L256 TraceCheckUtils]: 31: Hoare triple {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} ~cond := #in~cond; {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,506 INFO L273 TraceCheckUtils]: 33: Hoare triple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} assume !(0 == ~cond); {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} assume true; {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,512 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} #95#return; {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} is VALID [2018-11-18 23:13:39,513 INFO L273 TraceCheckUtils]: 37: Hoare triple {11743#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1) (= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} assume true; {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,514 INFO L273 TraceCheckUtils]: 39: Hoare triple {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,514 INFO L273 TraceCheckUtils]: 40: Hoare triple {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} assume #t~short6; {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,516 INFO L256 TraceCheckUtils]: 41: Hoare triple {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,516 INFO L273 TraceCheckUtils]: 42: Hoare triple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} ~cond := #in~cond; {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,517 INFO L273 TraceCheckUtils]: 43: Hoare triple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} assume !(0 == ~cond); {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,517 INFO L273 TraceCheckUtils]: 44: Hoare triple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} assume true; {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} is VALID [2018-11-18 23:13:39,518 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {11724#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_9| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_9| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_9|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_9| 12)) 1))} {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} #95#return; {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,520 INFO L273 TraceCheckUtils]: 47: Hoare triple {11774#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11805#(and (= main_~i~0 3) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,520 INFO L273 TraceCheckUtils]: 48: Hoare triple {11805#(and (= main_~i~0 3) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} assume true; {11805#(and (= main_~i~0 3) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} is VALID [2018-11-18 23:13:39,522 INFO L273 TraceCheckUtils]: 49: Hoare triple {11805#(and (= main_~i~0 3) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 1))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {11812#(and (= main_~i~0 3) |main_#t~short6| (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1))} is VALID [2018-11-18 23:13:39,522 INFO L273 TraceCheckUtils]: 50: Hoare triple {11812#(and (= main_~i~0 3) |main_#t~short6| (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {11643#false} is VALID [2018-11-18 23:13:39,522 INFO L256 TraceCheckUtils]: 51: Hoare triple {11643#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {11643#false} is VALID [2018-11-18 23:13:39,522 INFO L273 TraceCheckUtils]: 52: Hoare triple {11643#false} ~cond := #in~cond; {11643#false} is VALID [2018-11-18 23:13:39,523 INFO L273 TraceCheckUtils]: 53: Hoare triple {11643#false} assume 0 == ~cond; {11643#false} is VALID [2018-11-18 23:13:39,523 INFO L273 TraceCheckUtils]: 54: Hoare triple {11643#false} assume !false; {11643#false} is VALID [2018-11-18 23:13:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 23:13:39,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:13:39,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-18 23:13:39,551 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-11-18 23:13:39,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:13:39,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 23:13:39,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:39,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 23:13:39,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 23:13:39,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-18 23:13:39,654 INFO L87 Difference]: Start difference. First operand 259 states and 314 transitions. Second operand 21 states. [2018-11-18 23:13:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:50,887 INFO L93 Difference]: Finished difference Result 437 states and 520 transitions. [2018-11-18 23:13:50,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 23:13:50,887 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-11-18 23:13:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:13:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 23:13:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 188 transitions. [2018-11-18 23:13:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 23:13:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 188 transitions. [2018-11-18 23:13:50,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 188 transitions. [2018-11-18 23:13:51,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:51,158 INFO L225 Difference]: With dead ends: 437 [2018-11-18 23:13:51,158 INFO L226 Difference]: Without dead ends: 326 [2018-11-18 23:13:51,159 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 23:13:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-18 23:13:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 292. [2018-11-18 23:13:54,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:13:54,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand 292 states. [2018-11-18 23:13:54,354 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand 292 states. [2018-11-18 23:13:54,354 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 292 states. [2018-11-18 23:13:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:54,364 INFO L93 Difference]: Finished difference Result 326 states and 384 transitions. [2018-11-18 23:13:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 384 transitions. [2018-11-18 23:13:54,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:54,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:54,365 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand 326 states. [2018-11-18 23:13:54,365 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 326 states. [2018-11-18 23:13:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:13:54,374 INFO L93 Difference]: Finished difference Result 326 states and 384 transitions. [2018-11-18 23:13:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 384 transitions. [2018-11-18 23:13:54,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:13:54,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:13:54,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:13:54,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:13:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-18 23:13:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 349 transitions. [2018-11-18 23:13:54,383 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 349 transitions. Word has length 55 [2018-11-18 23:13:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:13:54,383 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 349 transitions. [2018-11-18 23:13:54,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 23:13:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 349 transitions. [2018-11-18 23:13:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 23:13:54,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:13:54,385 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:13:54,385 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:13:54,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:13:54,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1236630445, now seen corresponding path program 2 times [2018-11-18 23:13:54,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:13:54,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:13:54,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:54,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:13:54,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:13:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:55,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {13462#true} call ULTIMATE.init(); {13462#true} is VALID [2018-11-18 23:13:55,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {13462#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {13462#true} is VALID [2018-11-18 23:13:55,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {13462#true} assume true; {13462#true} is VALID [2018-11-18 23:13:55,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13462#true} {13462#true} #91#return; {13462#true} is VALID [2018-11-18 23:13:55,081 INFO L256 TraceCheckUtils]: 4: Hoare triple {13462#true} call #t~ret7 := main(); {13462#true} is VALID [2018-11-18 23:13:55,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {13462#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {13462#true} is VALID [2018-11-18 23:13:55,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {13462#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {13464#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-18 23:13:55,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {13464#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:55,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:55,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:55,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:55,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:55,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:55,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {13465#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {13466#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)))))} is VALID [2018-11-18 23:13:55,090 INFO L273 TraceCheckUtils]: 14: Hoare triple {13466#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13467#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 4)))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:55,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {13467#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 4)))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {13467#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 4)))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:13:55,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {13467#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 4)))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {13468#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))))} is VALID [2018-11-18 23:13:55,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {13468#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))))} ~i~0 := 0; {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} assume true; {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} assume #t~short6; {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,096 INFO L256 TraceCheckUtils]: 21: Hoare triple {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {13462#true} is VALID [2018-11-18 23:13:55,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {13462#true} ~cond := #in~cond; {13462#true} is VALID [2018-11-18 23:13:55,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {13462#true} assume !(0 == ~cond); {13462#true} is VALID [2018-11-18 23:13:55,097 INFO L273 TraceCheckUtils]: 24: Hoare triple {13462#true} assume true; {13462#true} is VALID [2018-11-18 23:13:55,098 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {13462#true} {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} #95#return; {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {13469#(and (<= ~CELLCOUNT~0 4) (or (<= ~CELLCOUNT~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4)))))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:55,100 INFO L273 TraceCheckUtils]: 28: Hoare triple {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} assume true; {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:55,100 INFO L273 TraceCheckUtils]: 29: Hoare triple {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:55,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} assume #t~short6; {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:55,101 INFO L256 TraceCheckUtils]: 31: Hoare triple {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {13462#true} is VALID [2018-11-18 23:13:55,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {13462#true} ~cond := #in~cond; {13462#true} is VALID [2018-11-18 23:13:55,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {13462#true} assume !(0 == ~cond); {13462#true} is VALID [2018-11-18 23:13:55,101 INFO L273 TraceCheckUtils]: 34: Hoare triple {13462#true} assume true; {13462#true} is VALID [2018-11-18 23:13:55,102 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {13462#true} {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} #95#return; {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:55,103 INFO L273 TraceCheckUtils]: 36: Hoare triple {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} is VALID [2018-11-18 23:13:55,104 INFO L273 TraceCheckUtils]: 37: Hoare triple {13470#(and (<= ~CELLCOUNT~0 (+ main_~i~0 3)) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 2))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:55,105 INFO L273 TraceCheckUtils]: 38: Hoare triple {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} assume true; {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:55,106 INFO L273 TraceCheckUtils]: 39: Hoare triple {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:55,106 INFO L273 TraceCheckUtils]: 40: Hoare triple {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} assume #t~short6; {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:55,107 INFO L256 TraceCheckUtils]: 41: Hoare triple {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {13462#true} is VALID [2018-11-18 23:13:55,107 INFO L273 TraceCheckUtils]: 42: Hoare triple {13462#true} ~cond := #in~cond; {13462#true} is VALID [2018-11-18 23:13:55,107 INFO L273 TraceCheckUtils]: 43: Hoare triple {13462#true} assume !(0 == ~cond); {13462#true} is VALID [2018-11-18 23:13:55,107 INFO L273 TraceCheckUtils]: 44: Hoare triple {13462#true} assume true; {13462#true} is VALID [2018-11-18 23:13:55,108 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {13462#true} {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} #95#return; {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:55,109 INFO L273 TraceCheckUtils]: 46: Hoare triple {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-18 23:13:55,110 INFO L273 TraceCheckUtils]: 47: Hoare triple {13471#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 ~CELLCOUNT~0) (+ |main_~#volArray~0.offset| (- 4))))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13472#(or (<= ~CELLCOUNT~0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} is VALID [2018-11-18 23:13:55,110 INFO L273 TraceCheckUtils]: 48: Hoare triple {13472#(or (<= ~CELLCOUNT~0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} assume true; {13472#(or (<= ~CELLCOUNT~0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} is VALID [2018-11-18 23:13:55,111 INFO L273 TraceCheckUtils]: 49: Hoare triple {13472#(or (<= ~CELLCOUNT~0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {13473#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:13:55,111 INFO L273 TraceCheckUtils]: 50: Hoare triple {13473#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {13474#|main_#t~short6|} is VALID [2018-11-18 23:13:55,111 INFO L256 TraceCheckUtils]: 51: Hoare triple {13474#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {13475#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-18 23:13:55,112 INFO L273 TraceCheckUtils]: 52: Hoare triple {13475#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13476#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-18 23:13:55,112 INFO L273 TraceCheckUtils]: 53: Hoare triple {13476#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13463#false} is VALID [2018-11-18 23:13:55,112 INFO L273 TraceCheckUtils]: 54: Hoare triple {13463#false} assume !false; {13463#false} is VALID [2018-11-18 23:13:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 23:13:55,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:13:55,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:13:55,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:13:55,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:13:55,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:13:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:13:55,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:13:55,258 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 13 treesize of output 10 [2018-11-18 23:13:55,265 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 10 treesize of output 9 [2018-11-18 23:13:55,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:13:55,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:55,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:13:55,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 23:13:55,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {13462#true} call ULTIMATE.init(); {13462#true} is VALID [2018-11-18 23:13:55,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {13462#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {13462#true} is VALID [2018-11-18 23:13:55,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {13462#true} assume true; {13462#true} is VALID [2018-11-18 23:13:55,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13462#true} {13462#true} #91#return; {13462#true} is VALID [2018-11-18 23:13:55,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {13462#true} call #t~ret7 := main(); {13462#true} is VALID [2018-11-18 23:13:55,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {13462#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {13462#true} is VALID [2018-11-18 23:13:55,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {13462#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {13498#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-18 23:13:55,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {13498#(= |main_~#volArray~0.offset| 0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {13502#(and (= 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 + 4 * (4 * ~i~0 - 2), 4); {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {13502#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {13521#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {13521#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13521#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {13521#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} assume true; {13521#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,740 INFO L273 TraceCheckUtils]: 16: Hoare triple {13521#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {13521#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,741 INFO L273 TraceCheckUtils]: 17: Hoare triple {13521#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,742 INFO L273 TraceCheckUtils]: 18: Hoare triple {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume true; {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,743 INFO L273 TraceCheckUtils]: 19: Hoare triple {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,743 INFO L273 TraceCheckUtils]: 20: Hoare triple {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume #t~short6; {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,745 INFO L256 TraceCheckUtils]: 21: Hoare triple {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} ~cond := #in~cond; {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} assume !(0 == ~cond); {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} assume true; {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,747 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #95#return; {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:13:55,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {13534#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,750 INFO L273 TraceCheckUtils]: 28: Hoare triple {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,751 INFO L273 TraceCheckUtils]: 30: Hoare triple {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume #t~short6; {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,753 INFO L256 TraceCheckUtils]: 31: Hoare triple {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,753 INFO L273 TraceCheckUtils]: 32: Hoare triple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} ~cond := #in~cond; {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} assume !(0 == ~cond); {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,754 INFO L273 TraceCheckUtils]: 34: Hoare triple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} assume true; {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,755 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #95#return; {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,756 INFO L273 TraceCheckUtils]: 36: Hoare triple {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {13566#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,757 INFO L273 TraceCheckUtils]: 38: Hoare triple {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} assume true; {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,758 INFO L273 TraceCheckUtils]: 39: Hoare triple {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,759 INFO L273 TraceCheckUtils]: 40: Hoare triple {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} assume #t~short6; {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,760 INFO L256 TraceCheckUtils]: 41: Hoare triple {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} ~cond := #in~cond; {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,762 INFO L273 TraceCheckUtils]: 43: Hoare triple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} assume !(0 == ~cond); {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,762 INFO L273 TraceCheckUtils]: 44: Hoare triple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} assume true; {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} is VALID [2018-11-18 23:13:55,763 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {13547#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_12|) 12) 0))} {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} #95#return; {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,764 INFO L273 TraceCheckUtils]: 46: Hoare triple {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,765 INFO L273 TraceCheckUtils]: 47: Hoare triple {13597#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13628#(and (= main_~i~0 3) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,766 INFO L273 TraceCheckUtils]: 48: Hoare triple {13628#(and (= main_~i~0 3) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} assume true; {13628#(and (= main_~i~0 3) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,766 INFO L273 TraceCheckUtils]: 49: Hoare triple {13628#(and (= main_~i~0 3) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {13628#(and (= main_~i~0 3) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:13:55,767 INFO L273 TraceCheckUtils]: 50: Hoare triple {13628#(and (= main_~i~0 3) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {13474#|main_#t~short6|} is VALID [2018-11-18 23:13:55,768 INFO L256 TraceCheckUtils]: 51: Hoare triple {13474#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {13641#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:13:55,769 INFO L273 TraceCheckUtils]: 52: Hoare triple {13641#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {13645#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:13:55,769 INFO L273 TraceCheckUtils]: 53: Hoare triple {13645#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13463#false} is VALID [2018-11-18 23:13:55,770 INFO L273 TraceCheckUtils]: 54: Hoare triple {13463#false} assume !false; {13463#false} is VALID [2018-11-18 23:13:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 23:13:55,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:13:55,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2018-11-18 23:13:55,797 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-11-18 23:13:55,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:13:55,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 23:13:55,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:13:55,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 23:13:55,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 23:13:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-11-18 23:13:55,904 INFO L87 Difference]: Start difference. First operand 292 states and 349 transitions. Second operand 25 states. [2018-11-18 23:14:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:06,516 INFO L93 Difference]: Finished difference Result 627 states and 756 transitions. [2018-11-18 23:14:06,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 23:14:06,516 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-11-18 23:14:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:14:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 23:14:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 203 transitions. [2018-11-18 23:14:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 23:14:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 203 transitions. [2018-11-18 23:14:06,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 203 transitions. [2018-11-18 23:14:06,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:14:06,842 INFO L225 Difference]: With dead ends: 627 [2018-11-18 23:14:06,842 INFO L226 Difference]: Without dead ends: 504 [2018-11-18 23:14:06,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=524, Invalid=3016, Unknown=0, NotChecked=0, Total=3540 [2018-11-18 23:14:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-11-18 23:14:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 401. [2018-11-18 23:14:10,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:14:10,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 504 states. Second operand 401 states. [2018-11-18 23:14:10,989 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand 401 states. [2018-11-18 23:14:10,989 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 401 states. [2018-11-18 23:14:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:11,005 INFO L93 Difference]: Finished difference Result 504 states and 591 transitions. [2018-11-18 23:14:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 591 transitions. [2018-11-18 23:14:11,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:14:11,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:14:11,007 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand 504 states. [2018-11-18 23:14:11,008 INFO L87 Difference]: Start difference. First operand 401 states. Second operand 504 states. [2018-11-18 23:14:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:11,025 INFO L93 Difference]: Finished difference Result 504 states and 591 transitions. [2018-11-18 23:14:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 591 transitions. [2018-11-18 23:14:11,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:14:11,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:14:11,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:14:11,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:14:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-11-18 23:14:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 476 transitions. [2018-11-18 23:14:11,041 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 476 transitions. Word has length 55 [2018-11-18 23:14:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:14:11,041 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 476 transitions. [2018-11-18 23:14:11,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 23:14:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 476 transitions. [2018-11-18 23:14:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 23:14:11,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:14:11,043 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:14:11,043 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:14:11,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:14:11,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1157117570, now seen corresponding path program 1 times [2018-11-18 23:14:11,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:14:11,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:14:11,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:14:11,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:14:11,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:14:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:14:11,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {16049#true} call ULTIMATE.init(); {16049#true} is VALID [2018-11-18 23:14:11,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {16049#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {16049#true} is VALID [2018-11-18 23:14:11,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {16049#true} assume true; {16049#true} is VALID [2018-11-18 23:14:11,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16049#true} {16049#true} #91#return; {16049#true} is VALID [2018-11-18 23:14:11,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {16049#true} call #t~ret7 := main(); {16049#true} is VALID [2018-11-18 23:14:11,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {16049#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {16049#true} is VALID [2018-11-18 23:14:11,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {16049#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {16049#true} is VALID [2018-11-18 23:14:11,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {16049#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {16049#true} is VALID [2018-11-18 23:14:11,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {16049#true} assume true; {16049#true} is VALID [2018-11-18 23:14:11,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {16049#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {16049#true} is VALID [2018-11-18 23:14:11,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {16049#true} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {16049#true} is VALID [2018-11-18 23:14:11,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {16049#true} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {16049#true} is VALID [2018-11-18 23:14:11,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {16049#true} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {16049#true} is VALID [2018-11-18 23:14:11,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {16049#true} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:11,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:11,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:11,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:11,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:11,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:11,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:11,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {16051#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {16050#false} is VALID [2018-11-18 23:14:11,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {16050#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16050#false} is VALID [2018-11-18 23:14:11,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {16050#false} assume true; {16050#false} is VALID [2018-11-18 23:14:11,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {16050#false} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {16050#false} is VALID [2018-11-18 23:14:11,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {16050#false} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {16050#false} is VALID [2018-11-18 23:14:11,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {16050#false} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {16050#false} is VALID [2018-11-18 23:14:11,388 INFO L273 TraceCheckUtils]: 26: Hoare triple {16050#false} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {16050#false} is VALID [2018-11-18 23:14:11,388 INFO L273 TraceCheckUtils]: 27: Hoare triple {16050#false} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {16050#false} is VALID [2018-11-18 23:14:11,389 INFO L273 TraceCheckUtils]: 28: Hoare triple {16050#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16050#false} is VALID [2018-11-18 23:14:11,389 INFO L273 TraceCheckUtils]: 29: Hoare triple {16050#false} assume true; {16050#false} is VALID [2018-11-18 23:14:11,389 INFO L273 TraceCheckUtils]: 30: Hoare triple {16050#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {16050#false} is VALID [2018-11-18 23:14:11,389 INFO L273 TraceCheckUtils]: 31: Hoare triple {16050#false} ~i~0 := 0; {16050#false} is VALID [2018-11-18 23:14:11,389 INFO L273 TraceCheckUtils]: 32: Hoare triple {16050#false} assume true; {16050#false} is VALID [2018-11-18 23:14:11,389 INFO L273 TraceCheckUtils]: 33: Hoare triple {16050#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {16050#false} is VALID [2018-11-18 23:14:11,390 INFO L273 TraceCheckUtils]: 34: Hoare triple {16050#false} assume #t~short6; {16050#false} is VALID [2018-11-18 23:14:11,390 INFO L256 TraceCheckUtils]: 35: Hoare triple {16050#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {16049#true} is VALID [2018-11-18 23:14:11,390 INFO L273 TraceCheckUtils]: 36: Hoare triple {16049#true} ~cond := #in~cond; {16049#true} is VALID [2018-11-18 23:14:11,390 INFO L273 TraceCheckUtils]: 37: Hoare triple {16049#true} assume !(0 == ~cond); {16049#true} is VALID [2018-11-18 23:14:11,390 INFO L273 TraceCheckUtils]: 38: Hoare triple {16049#true} assume true; {16049#true} is VALID [2018-11-18 23:14:11,391 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {16049#true} {16050#false} #95#return; {16050#false} is VALID [2018-11-18 23:14:11,391 INFO L273 TraceCheckUtils]: 40: Hoare triple {16050#false} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {16050#false} is VALID [2018-11-18 23:14:11,391 INFO L273 TraceCheckUtils]: 41: Hoare triple {16050#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16050#false} is VALID [2018-11-18 23:14:11,391 INFO L273 TraceCheckUtils]: 42: Hoare triple {16050#false} assume true; {16050#false} is VALID [2018-11-18 23:14:11,391 INFO L273 TraceCheckUtils]: 43: Hoare triple {16050#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {16050#false} is VALID [2018-11-18 23:14:11,392 INFO L273 TraceCheckUtils]: 44: Hoare triple {16050#false} assume #t~short6; {16050#false} is VALID [2018-11-18 23:14:11,392 INFO L256 TraceCheckUtils]: 45: Hoare triple {16050#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {16049#true} is VALID [2018-11-18 23:14:11,392 INFO L273 TraceCheckUtils]: 46: Hoare triple {16049#true} ~cond := #in~cond; {16049#true} is VALID [2018-11-18 23:14:11,392 INFO L273 TraceCheckUtils]: 47: Hoare triple {16049#true} assume !(0 == ~cond); {16049#true} is VALID [2018-11-18 23:14:11,392 INFO L273 TraceCheckUtils]: 48: Hoare triple {16049#true} assume true; {16049#true} is VALID [2018-11-18 23:14:11,392 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {16049#true} {16050#false} #95#return; {16050#false} is VALID [2018-11-18 23:14:11,393 INFO L273 TraceCheckUtils]: 50: Hoare triple {16050#false} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {16050#false} is VALID [2018-11-18 23:14:11,393 INFO L273 TraceCheckUtils]: 51: Hoare triple {16050#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16050#false} is VALID [2018-11-18 23:14:11,393 INFO L273 TraceCheckUtils]: 52: Hoare triple {16050#false} assume true; {16050#false} is VALID [2018-11-18 23:14:11,393 INFO L273 TraceCheckUtils]: 53: Hoare triple {16050#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {16050#false} is VALID [2018-11-18 23:14:11,393 INFO L273 TraceCheckUtils]: 54: Hoare triple {16050#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {16050#false} is VALID [2018-11-18 23:14:11,394 INFO L256 TraceCheckUtils]: 55: Hoare triple {16050#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {16050#false} is VALID [2018-11-18 23:14:11,394 INFO L273 TraceCheckUtils]: 56: Hoare triple {16050#false} ~cond := #in~cond; {16050#false} is VALID [2018-11-18 23:14:11,394 INFO L273 TraceCheckUtils]: 57: Hoare triple {16050#false} assume 0 == ~cond; {16050#false} is VALID [2018-11-18 23:14:11,394 INFO L273 TraceCheckUtils]: 58: Hoare triple {16050#false} assume !false; {16050#false} is VALID [2018-11-18 23:14:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 23:14:11,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:14:11,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:14:11,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-18 23:14:11,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:14:11,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:14:11,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:14:11,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:14:11,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:14:11,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:14:11,791 INFO L87 Difference]: Start difference. First operand 401 states and 476 transitions. Second operand 3 states. [2018-11-18 23:14:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:15,459 INFO L93 Difference]: Finished difference Result 483 states and 575 transitions. [2018-11-18 23:14:15,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:14:15,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-18 23:14:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:14:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:14:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2018-11-18 23:14:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:14:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2018-11-18 23:14:15,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 79 transitions. [2018-11-18 23:14:15,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:14:15,962 INFO L225 Difference]: With dead ends: 483 [2018-11-18 23:14:15,962 INFO L226 Difference]: Without dead ends: 305 [2018-11-18 23:14:15,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:14:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-18 23:14:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 290. [2018-11-18 23:14:19,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:14:19,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand 290 states. [2018-11-18 23:14:19,824 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 290 states. [2018-11-18 23:14:19,824 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 290 states. [2018-11-18 23:14:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:19,832 INFO L93 Difference]: Finished difference Result 305 states and 356 transitions. [2018-11-18 23:14:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 356 transitions. [2018-11-18 23:14:19,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:14:19,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:14:19,833 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand 305 states. [2018-11-18 23:14:19,834 INFO L87 Difference]: Start difference. First operand 290 states. Second operand 305 states. [2018-11-18 23:14:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:19,841 INFO L93 Difference]: Finished difference Result 305 states and 356 transitions. [2018-11-18 23:14:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 356 transitions. [2018-11-18 23:14:19,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:14:19,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:14:19,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:14:19,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:14:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-11-18 23:14:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 337 transitions. [2018-11-18 23:14:19,850 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 337 transitions. Word has length 59 [2018-11-18 23:14:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:14:19,850 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 337 transitions. [2018-11-18 23:14:19,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:14:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 337 transitions. [2018-11-18 23:14:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 23:14:19,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:14:19,852 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:14:19,852 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:14:19,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:14:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash -485876540, now seen corresponding path program 1 times [2018-11-18 23:14:19,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:14:19,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:14:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:14:19,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:14:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:14:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:14:19,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {17661#true} call ULTIMATE.init(); {17661#true} is VALID [2018-11-18 23:14:19,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {17661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {17661#true} is VALID [2018-11-18 23:14:19,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {17661#true} assume true; {17661#true} is VALID [2018-11-18 23:14:19,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17661#true} {17661#true} #91#return; {17661#true} is VALID [2018-11-18 23:14:19,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {17661#true} call #t~ret7 := main(); {17661#true} is VALID [2018-11-18 23:14:19,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {17661#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {17661#true} is VALID [2018-11-18 23:14:19,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {17661#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {17661#true} is VALID [2018-11-18 23:14:19,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {17661#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {17661#true} is VALID [2018-11-18 23:14:19,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {17661#true} assume true; {17661#true} is VALID [2018-11-18 23:14:19,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {17661#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {17661#true} is VALID [2018-11-18 23:14:19,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {17661#true} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {17661#true} is VALID [2018-11-18 23:14:19,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {17661#true} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {17661#true} is VALID [2018-11-18 23:14:19,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {17661#true} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:19,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:19,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:19,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume true; {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:19,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:19,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:19,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:19,996 INFO L273 TraceCheckUtils]: 19: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:19,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:19,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:20,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume true; {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:20,006 INFO L273 TraceCheckUtils]: 23: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:20,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:20,008 INFO L273 TraceCheckUtils]: 25: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} is VALID [2018-11-18 23:14:20,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {17663#(< main_~MINVAL~0 (+ main_~CCCELVOL2~0 1))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {17662#false} is VALID [2018-11-18 23:14:20,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {17662#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {17662#false} is VALID [2018-11-18 23:14:20,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {17662#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17662#false} is VALID [2018-11-18 23:14:20,010 INFO L273 TraceCheckUtils]: 29: Hoare triple {17662#false} assume true; {17662#false} is VALID [2018-11-18 23:14:20,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {17662#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {17662#false} is VALID [2018-11-18 23:14:20,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {17662#false} ~i~0 := 0; {17662#false} is VALID [2018-11-18 23:14:20,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {17662#false} assume true; {17662#false} is VALID [2018-11-18 23:14:20,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {17662#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {17662#false} is VALID [2018-11-18 23:14:20,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {17662#false} assume #t~short6; {17662#false} is VALID [2018-11-18 23:14:20,011 INFO L256 TraceCheckUtils]: 35: Hoare triple {17662#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {17661#true} is VALID [2018-11-18 23:14:20,011 INFO L273 TraceCheckUtils]: 36: Hoare triple {17661#true} ~cond := #in~cond; {17661#true} is VALID [2018-11-18 23:14:20,011 INFO L273 TraceCheckUtils]: 37: Hoare triple {17661#true} assume !(0 == ~cond); {17661#true} is VALID [2018-11-18 23:14:20,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {17661#true} assume true; {17661#true} is VALID [2018-11-18 23:14:20,011 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {17661#true} {17662#false} #95#return; {17662#false} is VALID [2018-11-18 23:14:20,012 INFO L273 TraceCheckUtils]: 40: Hoare triple {17662#false} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {17662#false} is VALID [2018-11-18 23:14:20,012 INFO L273 TraceCheckUtils]: 41: Hoare triple {17662#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17662#false} is VALID [2018-11-18 23:14:20,012 INFO L273 TraceCheckUtils]: 42: Hoare triple {17662#false} assume true; {17662#false} is VALID [2018-11-18 23:14:20,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {17662#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {17662#false} is VALID [2018-11-18 23:14:20,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {17662#false} assume #t~short6; {17662#false} is VALID [2018-11-18 23:14:20,012 INFO L256 TraceCheckUtils]: 45: Hoare triple {17662#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {17661#true} is VALID [2018-11-18 23:14:20,013 INFO L273 TraceCheckUtils]: 46: Hoare triple {17661#true} ~cond := #in~cond; {17661#true} is VALID [2018-11-18 23:14:20,013 INFO L273 TraceCheckUtils]: 47: Hoare triple {17661#true} assume !(0 == ~cond); {17661#true} is VALID [2018-11-18 23:14:20,013 INFO L273 TraceCheckUtils]: 48: Hoare triple {17661#true} assume true; {17661#true} is VALID [2018-11-18 23:14:20,013 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {17661#true} {17662#false} #95#return; {17662#false} is VALID [2018-11-18 23:14:20,013 INFO L273 TraceCheckUtils]: 50: Hoare triple {17662#false} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {17662#false} is VALID [2018-11-18 23:14:20,013 INFO L273 TraceCheckUtils]: 51: Hoare triple {17662#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17662#false} is VALID [2018-11-18 23:14:20,013 INFO L273 TraceCheckUtils]: 52: Hoare triple {17662#false} assume true; {17662#false} is VALID [2018-11-18 23:14:20,013 INFO L273 TraceCheckUtils]: 53: Hoare triple {17662#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {17662#false} is VALID [2018-11-18 23:14:20,014 INFO L273 TraceCheckUtils]: 54: Hoare triple {17662#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {17662#false} is VALID [2018-11-18 23:14:20,014 INFO L256 TraceCheckUtils]: 55: Hoare triple {17662#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {17662#false} is VALID [2018-11-18 23:14:20,014 INFO L273 TraceCheckUtils]: 56: Hoare triple {17662#false} ~cond := #in~cond; {17662#false} is VALID [2018-11-18 23:14:20,014 INFO L273 TraceCheckUtils]: 57: Hoare triple {17662#false} assume 0 == ~cond; {17662#false} is VALID [2018-11-18 23:14:20,014 INFO L273 TraceCheckUtils]: 58: Hoare triple {17662#false} assume !false; {17662#false} is VALID [2018-11-18 23:14:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 23:14:20,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:14:20,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:14:20,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-18 23:14:20,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:14:20,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:14:20,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:14:20,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:14:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:14:20,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:14:20,063 INFO L87 Difference]: Start difference. First operand 290 states and 337 transitions. Second operand 3 states. [2018-11-18 23:14:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:23,981 INFO L93 Difference]: Finished difference Result 457 states and 538 transitions. [2018-11-18 23:14:23,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:14:23,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-18 23:14:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:14:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:14:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-18 23:14:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:14:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-18 23:14:23,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-18 23:14:24,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:14:24,138 INFO L225 Difference]: With dead ends: 457 [2018-11-18 23:14:24,138 INFO L226 Difference]: Without dead ends: 328 [2018-11-18 23:14:24,139 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-18 23:14:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-18 23:14:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 291. [2018-11-18 23:14:28,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:14:28,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand 291 states. [2018-11-18 23:14:28,591 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand 291 states. [2018-11-18 23:14:28,592 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 291 states. [2018-11-18 23:14:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:28,599 INFO L93 Difference]: Finished difference Result 328 states and 383 transitions. [2018-11-18 23:14:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 383 transitions. [2018-11-18 23:14:28,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:14:28,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:14:28,600 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 328 states. [2018-11-18 23:14:28,600 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 328 states. [2018-11-18 23:14:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:28,609 INFO L93 Difference]: Finished difference Result 328 states and 383 transitions. [2018-11-18 23:14:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 383 transitions. [2018-11-18 23:14:28,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:14:28,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:14:28,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:14:28,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:14:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-18 23:14:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 336 transitions. [2018-11-18 23:14:28,618 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 336 transitions. Word has length 59 [2018-11-18 23:14:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:14:28,619 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 336 transitions. [2018-11-18 23:14:28,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:14:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 336 transitions. [2018-11-18 23:14:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 23:14:28,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:14:28,620 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:14:28,621 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:14:28,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:14:28,621 INFO L82 PathProgramCache]: Analyzing trace with hash -766578364, now seen corresponding path program 2 times [2018-11-18 23:14:28,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:14:28,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:14:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:14:28,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:14:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:14:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:14:28,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {19295#true} call ULTIMATE.init(); {19295#true} is VALID [2018-11-18 23:14:28,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {19295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {19295#true} is VALID [2018-11-18 23:14:28,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {19295#true} assume true; {19295#true} is VALID [2018-11-18 23:14:28,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19295#true} {19295#true} #91#return; {19295#true} is VALID [2018-11-18 23:14:28,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {19295#true} call #t~ret7 := main(); {19295#true} is VALID [2018-11-18 23:14:28,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {19295#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {19295#true} is VALID [2018-11-18 23:14:28,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {19295#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {19295#true} is VALID [2018-11-18 23:14:28,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {19295#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {19295#true} is VALID [2018-11-18 23:14:28,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {19295#true} assume true; {19295#true} is VALID [2018-11-18 23:14:28,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {19295#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {19295#true} is VALID [2018-11-18 23:14:28,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {19295#true} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {19295#true} is VALID [2018-11-18 23:14:28,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {19295#true} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {19295#true} is VALID [2018-11-18 23:14:28,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {19295#true} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:28,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:28,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:28,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} assume true; {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:28,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:28,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:28,863 INFO L273 TraceCheckUtils]: 18: Hoare triple {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:14:28,865 INFO L273 TraceCheckUtils]: 19: Hoare triple {19297#(<= (+ main_~CCCELVOL2~0 1) main_~MINVAL~0)} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {19296#false} is VALID [2018-11-18 23:14:28,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {19296#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {19296#false} is VALID [2018-11-18 23:14:28,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {19296#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19296#false} is VALID [2018-11-18 23:14:28,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {19296#false} assume true; {19296#false} is VALID [2018-11-18 23:14:28,865 INFO L273 TraceCheckUtils]: 23: Hoare triple {19296#false} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {19296#false} is VALID [2018-11-18 23:14:28,865 INFO L273 TraceCheckUtils]: 24: Hoare triple {19296#false} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {19296#false} is VALID [2018-11-18 23:14:28,865 INFO L273 TraceCheckUtils]: 25: Hoare triple {19296#false} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {19296#false} is VALID [2018-11-18 23:14:28,866 INFO L273 TraceCheckUtils]: 26: Hoare triple {19296#false} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {19296#false} is VALID [2018-11-18 23:14:28,866 INFO L273 TraceCheckUtils]: 27: Hoare triple {19296#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {19296#false} is VALID [2018-11-18 23:14:28,866 INFO L273 TraceCheckUtils]: 28: Hoare triple {19296#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19296#false} is VALID [2018-11-18 23:14:28,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {19296#false} assume true; {19296#false} is VALID [2018-11-18 23:14:28,866 INFO L273 TraceCheckUtils]: 30: Hoare triple {19296#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {19296#false} is VALID [2018-11-18 23:14:28,866 INFO L273 TraceCheckUtils]: 31: Hoare triple {19296#false} ~i~0 := 0; {19296#false} is VALID [2018-11-18 23:14:28,866 INFO L273 TraceCheckUtils]: 32: Hoare triple {19296#false} assume true; {19296#false} is VALID [2018-11-18 23:14:28,866 INFO L273 TraceCheckUtils]: 33: Hoare triple {19296#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {19296#false} is VALID [2018-11-18 23:14:28,867 INFO L273 TraceCheckUtils]: 34: Hoare triple {19296#false} assume #t~short6; {19296#false} is VALID [2018-11-18 23:14:28,867 INFO L256 TraceCheckUtils]: 35: Hoare triple {19296#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {19295#true} is VALID [2018-11-18 23:14:28,867 INFO L273 TraceCheckUtils]: 36: Hoare triple {19295#true} ~cond := #in~cond; {19295#true} is VALID [2018-11-18 23:14:28,867 INFO L273 TraceCheckUtils]: 37: Hoare triple {19295#true} assume !(0 == ~cond); {19295#true} is VALID [2018-11-18 23:14:28,867 INFO L273 TraceCheckUtils]: 38: Hoare triple {19295#true} assume true; {19295#true} is VALID [2018-11-18 23:14:28,867 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {19295#true} {19296#false} #95#return; {19296#false} is VALID [2018-11-18 23:14:28,867 INFO L273 TraceCheckUtils]: 40: Hoare triple {19296#false} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {19296#false} is VALID [2018-11-18 23:14:28,867 INFO L273 TraceCheckUtils]: 41: Hoare triple {19296#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19296#false} is VALID [2018-11-18 23:14:28,868 INFO L273 TraceCheckUtils]: 42: Hoare triple {19296#false} assume true; {19296#false} is VALID [2018-11-18 23:14:28,868 INFO L273 TraceCheckUtils]: 43: Hoare triple {19296#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {19296#false} is VALID [2018-11-18 23:14:28,868 INFO L273 TraceCheckUtils]: 44: Hoare triple {19296#false} assume #t~short6; {19296#false} is VALID [2018-11-18 23:14:28,868 INFO L256 TraceCheckUtils]: 45: Hoare triple {19296#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {19295#true} is VALID [2018-11-18 23:14:28,868 INFO L273 TraceCheckUtils]: 46: Hoare triple {19295#true} ~cond := #in~cond; {19295#true} is VALID [2018-11-18 23:14:28,868 INFO L273 TraceCheckUtils]: 47: Hoare triple {19295#true} assume !(0 == ~cond); {19295#true} is VALID [2018-11-18 23:14:28,868 INFO L273 TraceCheckUtils]: 48: Hoare triple {19295#true} assume true; {19295#true} is VALID [2018-11-18 23:14:28,868 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {19295#true} {19296#false} #95#return; {19296#false} is VALID [2018-11-18 23:14:28,868 INFO L273 TraceCheckUtils]: 50: Hoare triple {19296#false} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {19296#false} is VALID [2018-11-18 23:14:28,869 INFO L273 TraceCheckUtils]: 51: Hoare triple {19296#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19296#false} is VALID [2018-11-18 23:14:28,869 INFO L273 TraceCheckUtils]: 52: Hoare triple {19296#false} assume true; {19296#false} is VALID [2018-11-18 23:14:28,869 INFO L273 TraceCheckUtils]: 53: Hoare triple {19296#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {19296#false} is VALID [2018-11-18 23:14:28,869 INFO L273 TraceCheckUtils]: 54: Hoare triple {19296#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {19296#false} is VALID [2018-11-18 23:14:28,869 INFO L256 TraceCheckUtils]: 55: Hoare triple {19296#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {19296#false} is VALID [2018-11-18 23:14:28,869 INFO L273 TraceCheckUtils]: 56: Hoare triple {19296#false} ~cond := #in~cond; {19296#false} is VALID [2018-11-18 23:14:28,869 INFO L273 TraceCheckUtils]: 57: Hoare triple {19296#false} assume 0 == ~cond; {19296#false} is VALID [2018-11-18 23:14:28,869 INFO L273 TraceCheckUtils]: 58: Hoare triple {19296#false} assume !false; {19296#false} is VALID [2018-11-18 23:14:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 23:14:28,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:14:28,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:14:28,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-18 23:14:28,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:14:28,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:14:28,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:14:28,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:14:28,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:14:28,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:14:28,910 INFO L87 Difference]: Start difference. First operand 291 states and 336 transitions. Second operand 3 states. [2018-11-18 23:14:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:32,167 INFO L93 Difference]: Finished difference Result 366 states and 421 transitions. [2018-11-18 23:14:32,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:14:32,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-18 23:14:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:14:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:14:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2018-11-18 23:14:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:14:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2018-11-18 23:14:32,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2018-11-18 23:14:32,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:14:32,246 INFO L225 Difference]: With dead ends: 366 [2018-11-18 23:14:32,246 INFO L226 Difference]: Without dead ends: 263 [2018-11-18 23:14:32,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:14:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-18 23:14:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2018-11-18 23:14:36,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:14:36,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand 260 states. [2018-11-18 23:14:36,753 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand 260 states. [2018-11-18 23:14:36,754 INFO L87 Difference]: Start difference. First operand 263 states. Second operand 260 states. [2018-11-18 23:14:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:36,760 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2018-11-18 23:14:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 300 transitions. [2018-11-18 23:14:36,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:14:36,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:14:36,761 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 263 states. [2018-11-18 23:14:36,761 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 263 states. [2018-11-18 23:14:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:36,768 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2018-11-18 23:14:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 300 transitions. [2018-11-18 23:14:36,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:14:36,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:14:36,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:14:36,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:14:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-18 23:14:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 297 transitions. [2018-11-18 23:14:36,775 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 297 transitions. Word has length 59 [2018-11-18 23:14:36,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:14:36,775 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 297 transitions. [2018-11-18 23:14:36,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:14:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 297 transitions. [2018-11-18 23:14:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 23:14:36,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:14:36,777 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:14:36,777 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:14:36,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:14:36,778 INFO L82 PathProgramCache]: Analyzing trace with hash -483125063, now seen corresponding path program 4 times [2018-11-18 23:14:36,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:14:36,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:14:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:14:36,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:14:36,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:14:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:14:37,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {20643#true} call ULTIMATE.init(); {20643#true} is VALID [2018-11-18 23:14:37,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {20643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {20643#true} is VALID [2018-11-18 23:14:37,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {20643#true} assume true; {20643#true} is VALID [2018-11-18 23:14:37,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20643#true} {20643#true} #91#return; {20643#true} is VALID [2018-11-18 23:14:37,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {20643#true} call #t~ret7 := main(); {20643#true} is VALID [2018-11-18 23:14:37,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {20643#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {20643#true} is VALID [2018-11-18 23:14:37,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {20643#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {20643#true} is VALID [2018-11-18 23:14:37,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {20643#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {20645#(= main_~i~0 1)} is VALID [2018-11-18 23:14:37,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {20645#(= main_~i~0 1)} assume true; {20645#(= main_~i~0 1)} is VALID [2018-11-18 23:14:37,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {20645#(= main_~i~0 1)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {20645#(= main_~i~0 1)} is VALID [2018-11-18 23:14:37,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {20645#(= main_~i~0 1)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {20646#(and (= main_~i~0 1) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:37,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {20646#(and (= main_~i~0 1) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {20646#(and (= main_~i~0 1) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:37,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {20646#(and (= main_~i~0 1) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {20646#(and (= main_~i~0 1) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:37,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {20646#(and (= main_~i~0 1) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {20646#(and (= main_~i~0 1) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:37,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {20646#(and (= main_~i~0 1) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20647#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:37,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {20647#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} assume true; {20647#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:37,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {20647#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {20647#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:37,261 INFO L273 TraceCheckUtils]: 17: Hoare triple {20647#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 main_~CCCELVOL4~0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {20648#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {20648#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {20648#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {20648#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {20648#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {20648#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {20648#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {20648#(and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20649#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {20649#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} assume true; {20649#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {20649#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {20649#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {20649#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} ~i~0 := 0; {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:37,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume true; {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:37,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:37,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume #t~short6; {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:37,270 INFO L256 TraceCheckUtils]: 28: Hoare triple {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {20643#true} is VALID [2018-11-18 23:14:37,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {20643#true} ~cond := #in~cond; {20643#true} is VALID [2018-11-18 23:14:37,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {20643#true} assume !(0 == ~cond); {20643#true} is VALID [2018-11-18 23:14:37,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {20643#true} assume true; {20643#true} is VALID [2018-11-18 23:14:37,272 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {20643#true} {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} #95#return; {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:37,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:37,273 INFO L273 TraceCheckUtils]: 34: Hoare triple {20650#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,274 INFO L273 TraceCheckUtils]: 35: Hoare triple {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} assume true; {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,274 INFO L273 TraceCheckUtils]: 36: Hoare triple {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,274 INFO L273 TraceCheckUtils]: 37: Hoare triple {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} assume #t~short6; {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,274 INFO L256 TraceCheckUtils]: 38: Hoare triple {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {20643#true} is VALID [2018-11-18 23:14:37,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {20643#true} ~cond := #in~cond; {20643#true} is VALID [2018-11-18 23:14:37,275 INFO L273 TraceCheckUtils]: 40: Hoare triple {20643#true} assume !(0 == ~cond); {20643#true} is VALID [2018-11-18 23:14:37,275 INFO L273 TraceCheckUtils]: 41: Hoare triple {20643#true} assume true; {20643#true} is VALID [2018-11-18 23:14:37,275 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {20643#true} {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} #95#return; {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,276 INFO L273 TraceCheckUtils]: 43: Hoare triple {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,276 INFO L273 TraceCheckUtils]: 44: Hoare triple {20651#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,277 INFO L273 TraceCheckUtils]: 45: Hoare triple {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} assume true; {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,277 INFO L273 TraceCheckUtils]: 46: Hoare triple {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,278 INFO L273 TraceCheckUtils]: 47: Hoare triple {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} assume #t~short6; {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,278 INFO L256 TraceCheckUtils]: 48: Hoare triple {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {20643#true} is VALID [2018-11-18 23:14:37,278 INFO L273 TraceCheckUtils]: 49: Hoare triple {20643#true} ~cond := #in~cond; {20643#true} is VALID [2018-11-18 23:14:37,279 INFO L273 TraceCheckUtils]: 50: Hoare triple {20643#true} assume !(0 == ~cond); {20643#true} is VALID [2018-11-18 23:14:37,279 INFO L273 TraceCheckUtils]: 51: Hoare triple {20643#true} assume true; {20643#true} is VALID [2018-11-18 23:14:37,280 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {20643#true} {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} #95#return; {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,280 INFO L273 TraceCheckUtils]: 53: Hoare triple {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,281 INFO L273 TraceCheckUtils]: 54: Hoare triple {20652#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,281 INFO L273 TraceCheckUtils]: 55: Hoare triple {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} assume true; {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,282 INFO L273 TraceCheckUtils]: 56: Hoare triple {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,282 INFO L273 TraceCheckUtils]: 57: Hoare triple {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} assume #t~short6; {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,282 INFO L256 TraceCheckUtils]: 58: Hoare triple {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {20643#true} is VALID [2018-11-18 23:14:37,282 INFO L273 TraceCheckUtils]: 59: Hoare triple {20643#true} ~cond := #in~cond; {20643#true} is VALID [2018-11-18 23:14:37,282 INFO L273 TraceCheckUtils]: 60: Hoare triple {20643#true} assume !(0 == ~cond); {20643#true} is VALID [2018-11-18 23:14:37,283 INFO L273 TraceCheckUtils]: 61: Hoare triple {20643#true} assume true; {20643#true} is VALID [2018-11-18 23:14:37,283 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {20643#true} {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} #95#return; {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,284 INFO L273 TraceCheckUtils]: 63: Hoare triple {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:14:37,285 INFO L273 TraceCheckUtils]: 64: Hoare triple {20653#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20654#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:14:37,285 INFO L273 TraceCheckUtils]: 65: Hoare triple {20654#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {20654#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:14:37,286 INFO L273 TraceCheckUtils]: 66: Hoare triple {20654#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {20655#|main_#t~short6|} is VALID [2018-11-18 23:14:37,287 INFO L273 TraceCheckUtils]: 67: Hoare triple {20655#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {20644#false} is VALID [2018-11-18 23:14:37,287 INFO L256 TraceCheckUtils]: 68: Hoare triple {20644#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {20644#false} is VALID [2018-11-18 23:14:37,287 INFO L273 TraceCheckUtils]: 69: Hoare triple {20644#false} ~cond := #in~cond; {20644#false} is VALID [2018-11-18 23:14:37,287 INFO L273 TraceCheckUtils]: 70: Hoare triple {20644#false} assume 0 == ~cond; {20644#false} is VALID [2018-11-18 23:14:37,287 INFO L273 TraceCheckUtils]: 71: Hoare triple {20644#false} assume !false; {20644#false} is VALID [2018-11-18 23:14:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 59 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 23:14:37,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:14:37,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:14:37,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:14:37,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:14:37,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:14:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:14:37,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:14:37,509 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-18 23:14:37,513 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-18 23:14:37,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:14:37,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:14:37,528 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-18 23:14:37,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-18 23:14:37,532 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:14:37,583 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 29 treesize of output 24 [2018-11-18 23:14:37,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:14:37,686 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 24 treesize of output 39 [2018-11-18 23:14:37,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:14:37,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:14:37,976 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-18 23:14:37,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-18 23:14:37,990 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:14:38,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 29 treesize of output 24 [2018-11-18 23:14:38,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:14:38,174 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 24 treesize of output 39 [2018-11-18 23:14:38,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:14:38,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:14:38,196 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-18 23:14:38,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-18 23:14:38,200 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:14:38,338 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 23 treesize of output 18 [2018-11-18 23:14:38,346 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:14:38,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:14:38,349 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 18 treesize of output 37 [2018-11-18 23:14:38,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:14:38,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:14:38,372 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-18 23:14:38,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2018-11-18 23:14:38,376 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:14:39,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {20643#true} call ULTIMATE.init(); {20643#true} is VALID [2018-11-18 23:14:39,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {20643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {20643#true} is VALID [2018-11-18 23:14:39,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {20643#true} assume true; {20643#true} is VALID [2018-11-18 23:14:39,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20643#true} {20643#true} #91#return; {20643#true} is VALID [2018-11-18 23:14:39,132 INFO L256 TraceCheckUtils]: 4: Hoare triple {20643#true} call #t~ret7 := main(); {20643#true} is VALID [2018-11-18 23:14:39,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {20643#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {20643#true} is VALID [2018-11-18 23:14:39,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {20643#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {20677#(and (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {20677#(and (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume true; {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {20681#(and (<= main_~CCCELVOL1~0 1) (= 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 + 4 * (4 * ~i~0 - 4), 4); {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,136 INFO L273 TraceCheckUtils]: 12: Hoare triple {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {20681#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20703#(and (= main_~i~0 2) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {20703#(and (= main_~i~0 2) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume true; {20703#(and (= main_~i~0 2) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {20703#(and (= main_~i~0 2) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {20703#(and (= main_~i~0 2) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-18 23:14:39,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {20703#(and (= main_~i~0 2) (<= main_~CCCELVOL1~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 + 4 * (4 * ~i~0 - 4), 4); {20713#(and (= main_~i~0 2) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:14:39,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {20713#(and (= main_~i~0 2) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {20713#(and (= main_~i~0 2) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:14:39,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {20713#(and (= main_~i~0 2) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {20713#(and (= main_~i~0 2) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:14:39,145 INFO L273 TraceCheckUtils]: 20: Hoare triple {20713#(and (= main_~i~0 2) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (<= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {20723#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {20723#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20723#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,166 INFO L273 TraceCheckUtils]: 22: Hoare triple {20723#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume true; {20723#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {20723#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {20723#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {20723#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} ~i~0 := 0; {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:39,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} assume true; {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:39,202 INFO L273 TraceCheckUtils]: 26: Hoare triple {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:39,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} assume #t~short6; {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:39,203 INFO L256 TraceCheckUtils]: 28: Hoare triple {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,204 INFO L273 TraceCheckUtils]: 29: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} ~cond := #in~cond; {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,204 INFO L273 TraceCheckUtils]: 30: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} assume !(0 == ~cond); {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,204 INFO L273 TraceCheckUtils]: 31: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} assume true; {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,205 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} #95#return; {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:39,205 INFO L273 TraceCheckUtils]: 33: Hoare triple {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-18 23:14:39,206 INFO L273 TraceCheckUtils]: 34: Hoare triple {20736#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,224 INFO L273 TraceCheckUtils]: 35: Hoare triple {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume true; {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,225 INFO L273 TraceCheckUtils]: 36: Hoare triple {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,230 INFO L273 TraceCheckUtils]: 37: Hoare triple {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume #t~short6; {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,231 INFO L256 TraceCheckUtils]: 38: Hoare triple {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,231 INFO L273 TraceCheckUtils]: 39: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} ~cond := #in~cond; {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,232 INFO L273 TraceCheckUtils]: 40: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} assume !(0 == ~cond); {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,232 INFO L273 TraceCheckUtils]: 41: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} assume true; {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,233 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} #95#return; {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,235 INFO L273 TraceCheckUtils]: 44: Hoare triple {20768#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (= main_~i~0 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,236 INFO L273 TraceCheckUtils]: 45: Hoare triple {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume true; {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,238 INFO L273 TraceCheckUtils]: 47: Hoare triple {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume #t~short6; {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,239 INFO L256 TraceCheckUtils]: 48: Hoare triple {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,240 INFO L273 TraceCheckUtils]: 49: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} ~cond := #in~cond; {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,240 INFO L273 TraceCheckUtils]: 50: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} assume !(0 == ~cond); {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,241 INFO L273 TraceCheckUtils]: 51: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} assume true; {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,241 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} #95#return; {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,242 INFO L273 TraceCheckUtils]: 53: Hoare triple {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,243 INFO L273 TraceCheckUtils]: 54: Hoare triple {20799#(and (= main_~i~0 2) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,243 INFO L273 TraceCheckUtils]: 55: Hoare triple {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume true; {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,244 INFO L273 TraceCheckUtils]: 56: Hoare triple {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,245 INFO L273 TraceCheckUtils]: 57: Hoare triple {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} assume #t~short6; {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,246 INFO L256 TraceCheckUtils]: 58: Hoare triple {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,247 INFO L273 TraceCheckUtils]: 59: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} ~cond := #in~cond; {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,247 INFO L273 TraceCheckUtils]: 60: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} assume !(0 == ~cond); {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,248 INFO L273 TraceCheckUtils]: 61: Hoare triple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} assume true; {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} is VALID [2018-11-18 23:14:39,249 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {20749#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_15| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 28) 1) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_15|) 16))))} {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} #95#return; {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,250 INFO L273 TraceCheckUtils]: 63: Hoare triple {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} is VALID [2018-11-18 23:14:39,251 INFO L273 TraceCheckUtils]: 64: Hoare triple {20830#(and (= main_~i~0 3) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20861#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 4))} is VALID [2018-11-18 23:14:39,252 INFO L273 TraceCheckUtils]: 65: Hoare triple {20861#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 4))} assume true; {20861#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 4))} is VALID [2018-11-18 23:14:39,253 INFO L273 TraceCheckUtils]: 66: Hoare triple {20861#(and (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= |main_~#volArray~0.offset| 0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16))) (= main_~i~0 4))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {20655#|main_#t~short6|} is VALID [2018-11-18 23:14:39,253 INFO L273 TraceCheckUtils]: 67: Hoare triple {20655#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {20644#false} is VALID [2018-11-18 23:14:39,253 INFO L256 TraceCheckUtils]: 68: Hoare triple {20644#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {20644#false} is VALID [2018-11-18 23:14:39,254 INFO L273 TraceCheckUtils]: 69: Hoare triple {20644#false} ~cond := #in~cond; {20644#false} is VALID [2018-11-18 23:14:39,254 INFO L273 TraceCheckUtils]: 70: Hoare triple {20644#false} assume 0 == ~cond; {20644#false} is VALID [2018-11-18 23:14:39,254 INFO L273 TraceCheckUtils]: 71: Hoare triple {20644#false} assume !false; {20644#false} is VALID [2018-11-18 23:14:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 59 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 23:14:39,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:14:39,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-11-18 23:14:39,294 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-11-18 23:14:39,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:14:39,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 23:14:39,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:14:39,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 23:14:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 23:14:39,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-11-18 23:14:39,433 INFO L87 Difference]: Start difference. First operand 260 states and 297 transitions. Second operand 24 states. [2018-11-18 23:14:43,781 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 23:14:53,484 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 23:14:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:55,253 INFO L93 Difference]: Finished difference Result 530 states and 608 transitions. [2018-11-18 23:14:55,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-18 23:14:55,253 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-11-18 23:14:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:14:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 23:14:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 354 transitions. [2018-11-18 23:14:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 23:14:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 354 transitions. [2018-11-18 23:14:55,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 354 transitions. [2018-11-18 23:14:55,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:14:55,937 INFO L225 Difference]: With dead ends: 530 [2018-11-18 23:14:55,937 INFO L226 Difference]: Without dead ends: 483 [2018-11-18 23:14:55,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 55 SyntacticMatches, 10 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=982, Invalid=6500, Unknown=0, NotChecked=0, Total=7482 [2018-11-18 23:14:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-11-18 23:14:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 341. [2018-11-18 23:14:59,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:14:59,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 483 states. Second operand 341 states. [2018-11-18 23:14:59,555 INFO L74 IsIncluded]: Start isIncluded. First operand 483 states. Second operand 341 states. [2018-11-18 23:14:59,555 INFO L87 Difference]: Start difference. First operand 483 states. Second operand 341 states. [2018-11-18 23:14:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:59,571 INFO L93 Difference]: Finished difference Result 483 states and 552 transitions. [2018-11-18 23:14:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 552 transitions. [2018-11-18 23:14:59,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:14:59,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:14:59,572 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand 483 states. [2018-11-18 23:14:59,572 INFO L87 Difference]: Start difference. First operand 341 states. Second operand 483 states. [2018-11-18 23:14:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:14:59,587 INFO L93 Difference]: Finished difference Result 483 states and 552 transitions. [2018-11-18 23:14:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 552 transitions. [2018-11-18 23:14:59,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:14:59,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:14:59,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:14:59,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:14:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-18 23:14:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 395 transitions. [2018-11-18 23:14:59,598 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 395 transitions. Word has length 72 [2018-11-18 23:14:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:14:59,598 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 395 transitions. [2018-11-18 23:14:59,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 23:14:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 395 transitions. [2018-11-18 23:14:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 23:14:59,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:14:59,600 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:14:59,600 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:14:59,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:14:59,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1780489153, now seen corresponding path program 1 times [2018-11-18 23:14:59,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:14:59,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:14:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:14:59,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:14:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:14:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:15:00,078 INFO L256 TraceCheckUtils]: 0: Hoare triple {23096#true} call ULTIMATE.init(); {23096#true} is VALID [2018-11-18 23:15:00,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {23096#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {23096#true} is VALID [2018-11-18 23:15:00,079 INFO L273 TraceCheckUtils]: 2: Hoare triple {23096#true} assume true; {23096#true} is VALID [2018-11-18 23:15:00,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23096#true} {23096#true} #91#return; {23096#true} is VALID [2018-11-18 23:15:00,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {23096#true} call #t~ret7 := main(); {23096#true} is VALID [2018-11-18 23:15:00,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {23096#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {23096#true} is VALID [2018-11-18 23:15:00,079 INFO L273 TraceCheckUtils]: 6: Hoare triple {23096#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {23096#true} is VALID [2018-11-18 23:15:00,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {23096#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {23098#(= main_~i~0 1)} is VALID [2018-11-18 23:15:00,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {23098#(= main_~i~0 1)} assume true; {23098#(= main_~i~0 1)} is VALID [2018-11-18 23:15:00,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {23098#(= main_~i~0 1)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {23098#(= main_~i~0 1)} is VALID [2018-11-18 23:15:00,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {23098#(= main_~i~0 1)} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {23098#(= main_~i~0 1)} is VALID [2018-11-18 23:15:00,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {23098#(= main_~i~0 1)} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {23098#(= main_~i~0 1)} is VALID [2018-11-18 23:15:00,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {23098#(= main_~i~0 1)} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {23098#(= main_~i~0 1)} is VALID [2018-11-18 23:15:00,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {23098#(= main_~i~0 1)} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {23098#(= main_~i~0 1)} is VALID [2018-11-18 23:15:00,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {23098#(= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23099#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-18 23:15:00,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {23099#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume true; {23099#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-18 23:15:00,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {23099#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {23099#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-18 23:15:00,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {23099#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {23100#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {23100#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {23100#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {23100#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {23100#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {23100#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {23100#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {23100#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23101#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,110 INFO L273 TraceCheckUtils]: 22: Hoare triple {23101#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} assume true; {23101#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {23101#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {23101#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {23101#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16)))))} ~i~0 := 0; {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:00,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume true; {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:00,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:00,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:00,114 INFO L256 TraceCheckUtils]: 28: Hoare triple {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {23096#true} is VALID [2018-11-18 23:15:00,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {23096#true} ~cond := #in~cond; {23096#true} is VALID [2018-11-18 23:15:00,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {23096#true} assume !(0 == ~cond); {23096#true} is VALID [2018-11-18 23:15:00,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {23096#true} assume true; {23096#true} is VALID [2018-11-18 23:15:00,116 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {23096#true} {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} #95#return; {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:00,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:00,117 INFO L273 TraceCheckUtils]: 34: Hoare triple {23102#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 8) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} assume true; {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,118 INFO L273 TraceCheckUtils]: 36: Hoare triple {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,119 INFO L256 TraceCheckUtils]: 38: Hoare triple {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {23096#true} is VALID [2018-11-18 23:15:00,119 INFO L273 TraceCheckUtils]: 39: Hoare triple {23096#true} ~cond := #in~cond; {23096#true} is VALID [2018-11-18 23:15:00,119 INFO L273 TraceCheckUtils]: 40: Hoare triple {23096#true} assume !(0 == ~cond); {23096#true} is VALID [2018-11-18 23:15:00,119 INFO L273 TraceCheckUtils]: 41: Hoare triple {23096#true} assume true; {23096#true} is VALID [2018-11-18 23:15:00,120 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {23096#true} {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} #95#return; {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,121 INFO L273 TraceCheckUtils]: 43: Hoare triple {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,122 INFO L273 TraceCheckUtils]: 44: Hoare triple {23103#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 7)) (+ |main_~#volArray~0.offset| (- 16)))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,122 INFO L273 TraceCheckUtils]: 45: Hoare triple {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} assume true; {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,123 INFO L273 TraceCheckUtils]: 46: Hoare triple {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,123 INFO L256 TraceCheckUtils]: 48: Hoare triple {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {23096#true} is VALID [2018-11-18 23:15:00,124 INFO L273 TraceCheckUtils]: 49: Hoare triple {23096#true} ~cond := #in~cond; {23096#true} is VALID [2018-11-18 23:15:00,124 INFO L273 TraceCheckUtils]: 50: Hoare triple {23096#true} assume !(0 == ~cond); {23096#true} is VALID [2018-11-18 23:15:00,124 INFO L273 TraceCheckUtils]: 51: Hoare triple {23096#true} assume true; {23096#true} is VALID [2018-11-18 23:15:00,125 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {23096#true} {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} #95#return; {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,125 INFO L273 TraceCheckUtils]: 53: Hoare triple {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,126 INFO L273 TraceCheckUtils]: 54: Hoare triple {23104#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 6)) (+ |main_~#volArray~0.offset| (- 16)))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,127 INFO L273 TraceCheckUtils]: 55: Hoare triple {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} assume true; {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,128 INFO L273 TraceCheckUtils]: 57: Hoare triple {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,128 INFO L256 TraceCheckUtils]: 58: Hoare triple {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {23096#true} is VALID [2018-11-18 23:15:00,128 INFO L273 TraceCheckUtils]: 59: Hoare triple {23096#true} ~cond := #in~cond; {23096#true} is VALID [2018-11-18 23:15:00,128 INFO L273 TraceCheckUtils]: 60: Hoare triple {23096#true} assume !(0 == ~cond); {23096#true} is VALID [2018-11-18 23:15:00,129 INFO L273 TraceCheckUtils]: 61: Hoare triple {23096#true} assume true; {23096#true} is VALID [2018-11-18 23:15:00,129 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {23096#true} {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} #95#return; {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,130 INFO L273 TraceCheckUtils]: 63: Hoare triple {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} is VALID [2018-11-18 23:15:00,131 INFO L273 TraceCheckUtils]: 64: Hoare triple {23105#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 5)) (+ |main_~#volArray~0.offset| (- 16)))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23106#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:15:00,131 INFO L273 TraceCheckUtils]: 65: Hoare triple {23106#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {23106#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:15:00,132 INFO L273 TraceCheckUtils]: 66: Hoare triple {23106#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {23106#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:15:00,133 INFO L273 TraceCheckUtils]: 67: Hoare triple {23106#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {23107#|main_#t~short6|} is VALID [2018-11-18 23:15:00,133 INFO L256 TraceCheckUtils]: 68: Hoare triple {23107#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {23108#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-18 23:15:00,134 INFO L273 TraceCheckUtils]: 69: Hoare triple {23108#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23109#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-18 23:15:00,134 INFO L273 TraceCheckUtils]: 70: Hoare triple {23109#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23097#false} is VALID [2018-11-18 23:15:00,135 INFO L273 TraceCheckUtils]: 71: Hoare triple {23097#false} assume !false; {23097#false} is VALID [2018-11-18 23:15:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 23:15:00,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:15:00,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:15:00,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:15:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:15:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:15:00,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:15:00,301 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-18 23:15:00,305 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-18 23:15:00,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-18 23:15:00,367 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 29 treesize of output 24 [2018-11-18 23:15:00,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:15:00,374 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 24 treesize of output 39 [2018-11-18 23:15:00,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-18 23:15:00,451 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 41 treesize of output 34 [2018-11-18 23:15:00,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:15:00,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:15:00,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:15:00,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 79 [2018-11-18 23:15:00,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-18 23:15:00,557 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 41 treesize of output 32 [2018-11-18 23:15:00,564 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:15:00,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:15:00,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:15:00,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:15:00,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:15:00,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:15:00,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-11-18 23:15:00,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:15:00,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-18 23:15:01,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {23096#true} call ULTIMATE.init(); {23096#true} is VALID [2018-11-18 23:15:01,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {23096#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {23096#true} is VALID [2018-11-18 23:15:01,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {23096#true} assume true; {23096#true} is VALID [2018-11-18 23:15:01,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23096#true} {23096#true} #91#return; {23096#true} is VALID [2018-11-18 23:15:01,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {23096#true} call #t~ret7 := main(); {23096#true} is VALID [2018-11-18 23:15:01,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {23096#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {23096#true} is VALID [2018-11-18 23:15:01,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {23096#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {23131#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-18 23:15:01,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {23131#(= |main_~#volArray~0.offset| 0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {23135#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23157#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {23157#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {23157#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {23157#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {23157#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {23157#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 4), 4); {23167#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:15:01,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {23167#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 3), 4); {23171#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} is VALID [2018-11-18 23:15:01,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {23171#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 2), 4); {23175#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} is VALID [2018-11-18 23:15:01,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {23175#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - 1), 4); {23179#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {23179#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23179#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {23179#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume true; {23179#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,864 INFO L273 TraceCheckUtils]: 23: Hoare triple {23179#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {23179#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,865 INFO L273 TraceCheckUtils]: 24: Hoare triple {23179#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} ~i~0 := 0; {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:01,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} assume true; {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:01,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:01,869 INFO L273 TraceCheckUtils]: 27: Hoare triple {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:01,870 INFO L256 TraceCheckUtils]: 28: Hoare triple {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} ~cond := #in~cond; {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} assume !(0 == ~cond); {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} assume true; {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,885 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} #95#return; {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:01,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} is VALID [2018-11-18 23:15:01,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {23192#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume true; {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,888 INFO L273 TraceCheckUtils]: 36: Hoare triple {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,889 INFO L273 TraceCheckUtils]: 37: Hoare triple {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,891 INFO L256 TraceCheckUtils]: 38: Hoare triple {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,891 INFO L273 TraceCheckUtils]: 39: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} ~cond := #in~cond; {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,892 INFO L273 TraceCheckUtils]: 40: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} assume !(0 == ~cond); {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,893 INFO L273 TraceCheckUtils]: 41: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} assume true; {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,893 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} #95#return; {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,894 INFO L273 TraceCheckUtils]: 43: Hoare triple {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,896 INFO L273 TraceCheckUtils]: 44: Hoare triple {23224#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,897 INFO L273 TraceCheckUtils]: 45: Hoare triple {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume true; {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,898 INFO L273 TraceCheckUtils]: 46: Hoare triple {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,899 INFO L273 TraceCheckUtils]: 47: Hoare triple {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,901 INFO L256 TraceCheckUtils]: 48: Hoare triple {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,902 INFO L273 TraceCheckUtils]: 49: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} ~cond := #in~cond; {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,902 INFO L273 TraceCheckUtils]: 50: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} assume !(0 == ~cond); {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,903 INFO L273 TraceCheckUtils]: 51: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} assume true; {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,903 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} #95#return; {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,905 INFO L273 TraceCheckUtils]: 53: Hoare triple {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,906 INFO L273 TraceCheckUtils]: 54: Hoare triple {23255#(and (= main_~i~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,907 INFO L273 TraceCheckUtils]: 55: Hoare triple {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume true; {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,908 INFO L273 TraceCheckUtils]: 56: Hoare triple {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,909 INFO L273 TraceCheckUtils]: 57: Hoare triple {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,911 INFO L256 TraceCheckUtils]: 58: Hoare triple {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,912 INFO L273 TraceCheckUtils]: 59: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} ~cond := #in~cond; {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,912 INFO L273 TraceCheckUtils]: 60: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} assume !(0 == ~cond); {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,913 INFO L273 TraceCheckUtils]: 61: Hoare triple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} assume true; {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} is VALID [2018-11-18 23:15:01,914 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {23205#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_19| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 16) 0) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 28)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 24)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_19|) 20))))} {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} #95#return; {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,915 INFO L273 TraceCheckUtils]: 63: Hoare triple {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} is VALID [2018-11-18 23:15:01,916 INFO L273 TraceCheckUtils]: 64: Hoare triple {23286#(and (= main_~i~0 3) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23317#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 4))} is VALID [2018-11-18 23:15:01,917 INFO L273 TraceCheckUtils]: 65: Hoare triple {23317#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 4))} assume true; {23317#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 4))} is VALID [2018-11-18 23:15:01,918 INFO L273 TraceCheckUtils]: 66: Hoare triple {23317#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 4))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {23317#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 4))} is VALID [2018-11-18 23:15:01,919 INFO L273 TraceCheckUtils]: 67: Hoare triple {23317#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 28))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 24)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 16)) 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 20))) (= main_~i~0 4))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {23107#|main_#t~short6|} is VALID [2018-11-18 23:15:01,919 INFO L256 TraceCheckUtils]: 68: Hoare triple {23107#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {23330#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:15:01,920 INFO L273 TraceCheckUtils]: 69: Hoare triple {23330#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {23334#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:15:01,921 INFO L273 TraceCheckUtils]: 70: Hoare triple {23334#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23097#false} is VALID [2018-11-18 23:15:01,921 INFO L273 TraceCheckUtils]: 71: Hoare triple {23097#false} assume !false; {23097#false} is VALID [2018-11-18 23:15:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 23:15:01,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:15:01,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 29 [2018-11-18 23:15:01,965 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2018-11-18 23:15:01,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:15:01,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 23:15:02,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:15:02,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 23:15:02,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 23:15:02,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2018-11-18 23:15:02,114 INFO L87 Difference]: Start difference. First operand 341 states and 395 transitions. Second operand 29 states.