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-Const.epf -i ../../../trunk/examples/svcomp/array-tiling/rewrev_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:53:39,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:53:39,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:53:39,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:53:39,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:53:39,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:53:39,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:53:39,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:53:39,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:53:39,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:53:39,337 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:53:39,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:53:39,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:53:39,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:53:39,340 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:53:39,341 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:53:39,342 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:53:39,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:53:39,346 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:53:39,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:53:39,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:53:39,351 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:53:39,353 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:53:39,354 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:53:39,354 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:53:39,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:53:39,361 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:53:39,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:53:39,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:53:39,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:53:39,367 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:53:39,368 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:53:39,368 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:53:39,368 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:53:39,369 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:53:39,372 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:53:39,372 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:53:39,403 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:53:39,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:53:39,404 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:53:39,404 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:53:39,405 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:53:39,405 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:53:39,405 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:53:39,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:53:39,406 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:53:39,406 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:53:39,406 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:53:39,406 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:53:39,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:53:39,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:53:39,408 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:53:39,408 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:53:39,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:53:39,409 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:53:39,409 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:53:39,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:53:39,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:53:39,409 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:53:39,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:53:39,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:53:39,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:53:39,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:53:39,412 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:53:39,412 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:53:39,412 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:53:39,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:53:39,412 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:53:39,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:53:39,497 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:53:39,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:53:39,503 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:53:39,504 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:53:39,505 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewrev_true-unreach-call.i [2018-11-14 18:53:39,574 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9430a813/633c970d11274aba8a78b1c66ec7f4e3/FLAG08cb0cbca [2018-11-14 18:53:40,029 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:53:40,030 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewrev_true-unreach-call.i [2018-11-14 18:53:40,037 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9430a813/633c970d11274aba8a78b1c66ec7f4e3/FLAG08cb0cbca [2018-11-14 18:53:40,052 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9430a813/633c970d11274aba8a78b1c66ec7f4e3 [2018-11-14 18:53:40,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:53:40,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:53:40,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:53:40,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:53:40,068 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:53:40,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:53:40" (1/1) ... [2018-11-14 18:53:40,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a061bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40, skipping insertion in model container [2018-11-14 18:53:40,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:53:40" (1/1) ... [2018-11-14 18:53:40,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:53:40,111 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:53:40,367 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:53:40,373 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:53:40,403 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:53:40,435 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:53:40,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40 WrapperNode [2018-11-14 18:53:40,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:53:40,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:53:40,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:53:40,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:53:40,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40" (1/1) ... [2018-11-14 18:53:40,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40" (1/1) ... [2018-11-14 18:53:40,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40" (1/1) ... [2018-11-14 18:53:40,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40" (1/1) ... [2018-11-14 18:53:40,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40" (1/1) ... [2018-11-14 18:53:40,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40" (1/1) ... [2018-11-14 18:53:40,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40" (1/1) ... [2018-11-14 18:53:40,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:53:40,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:53:40,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:53:40,501 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:53:40,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:53:40,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:53:40,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:53:40,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:53:40,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:53:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:53:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:53:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:53:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:53:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:53:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:53:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:53:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:53:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:53:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:53:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:53:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:53:41,170 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:53:41,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:53:41 BoogieIcfgContainer [2018-11-14 18:53:41,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:53:41,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:53:41,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:53:41,176 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:53:41,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:53:40" (1/3) ... [2018-11-14 18:53:41,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579fa911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:53:41, skipping insertion in model container [2018-11-14 18:53:41,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:53:40" (2/3) ... [2018-11-14 18:53:41,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579fa911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:53:41, skipping insertion in model container [2018-11-14 18:53:41,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:53:41" (3/3) ... [2018-11-14 18:53:41,180 INFO L112 eAbstractionObserver]: Analyzing ICFG rewrev_true-unreach-call.i [2018-11-14 18:53:41,190 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:53:41,198 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:53:41,213 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:53:41,245 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:53:41,246 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:53:41,246 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:53:41,247 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:53:41,247 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:53:41,247 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:53:41,247 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:53:41,247 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:53:41,247 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:53:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-14 18:53:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:53:41,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:53:41,275 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:53:41,278 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:53:41,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:53:41,284 INFO L82 PathProgramCache]: Analyzing trace with hash -780591074, now seen corresponding path program 1 times [2018-11-14 18:53:41,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:53:41,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:53:41,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:53:41,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:53:41,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:53:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:53:41,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-14 18:53:41,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {33#true} is VALID [2018-11-14 18:53:41,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-14 18:53:41,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #65#return; {33#true} is VALID [2018-11-14 18:53:41,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret5 := main(); {33#true} is VALID [2018-11-14 18:53:41,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2018-11-14 18:53:41,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {33#true} is VALID [2018-11-14 18:53:41,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-14 18:53:41,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} ~i~0 := 0; {34#false} is VALID [2018-11-14 18:53:41,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-14 18:53:41,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {34#false} is VALID [2018-11-14 18:53:41,465 INFO L256 TraceCheckUtils]: 11: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {34#false} is VALID [2018-11-14 18:53:41,465 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-14 18:53:41,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} assume ~cond == 0; {34#false} is VALID [2018-11-14 18:53:41,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-14 18:53:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:53:41,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:53:41,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:53:41,477 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 18:53:41,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:53:41,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:53:41,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:53:41,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:53:41,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:53:41,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:53:41,622 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-14 18:53:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:41,924 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-14 18:53:41,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:53:41,925 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 18:53:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:53:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:53:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 18:53:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:53:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 18:53:41,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-14 18:53:42,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:53:42,135 INFO L225 Difference]: With dead ends: 48 [2018-11-14 18:53:42,135 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 18:53:42,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:53:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 18:53:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 18:53:42,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:53:42,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 18:53:42,196 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:53:42,196 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:53:42,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:42,201 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 18:53:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 18:53:42,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:53:42,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:53:42,202 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:53:42,202 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:53:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:42,206 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 18:53:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 18:53:42,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:53:42,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:53:42,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:53:42,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:53:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:53:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-14 18:53:42,213 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2018-11-14 18:53:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:53:42,213 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-14 18:53:42,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:53:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 18:53:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:53:42,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:53:42,215 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:53:42,215 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:53:42,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:53:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash 629098255, now seen corresponding path program 1 times [2018-11-14 18:53:42,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:53:42,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:53:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:53:42,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:53:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:53:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:53:42,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {176#true} is VALID [2018-11-14 18:53:42,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {176#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {176#true} is VALID [2018-11-14 18:53:42,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2018-11-14 18:53:42,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #65#return; {176#true} is VALID [2018-11-14 18:53:42,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret5 := main(); {176#true} is VALID [2018-11-14 18:53:42,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {176#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {176#true} is VALID [2018-11-14 18:53:42,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {178#(<= 0 main_~i~0)} is VALID [2018-11-14 18:53:42,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {178#(<= 0 main_~i~0)} assume true; {178#(<= 0 main_~i~0)} is VALID [2018-11-14 18:53:42,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {178#(<= 0 main_~i~0)} assume !(~i~0 >= -1); {177#false} is VALID [2018-11-14 18:53:42,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {177#false} ~i~0 := 0; {177#false} is VALID [2018-11-14 18:53:42,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {177#false} assume true; {177#false} is VALID [2018-11-14 18:53:42,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {177#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {177#false} is VALID [2018-11-14 18:53:42,391 INFO L256 TraceCheckUtils]: 12: Hoare triple {177#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {177#false} is VALID [2018-11-14 18:53:42,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {177#false} ~cond := #in~cond; {177#false} is VALID [2018-11-14 18:53:42,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {177#false} assume ~cond == 0; {177#false} is VALID [2018-11-14 18:53:42,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {177#false} assume !false; {177#false} is VALID [2018-11-14 18:53:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:53:42,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:53:42,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:53:42,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 18:53:42,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:53:42,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:53:42,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:53:42,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:53:42,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:53:42,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:53:42,461 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 3 states. [2018-11-14 18:53:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:42,654 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-14 18:53:42,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:53:42,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 18:53:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:53:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:53:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2018-11-14 18:53:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:53:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2018-11-14 18:53:42,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2018-11-14 18:53:43,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:53:43,058 INFO L225 Difference]: With dead ends: 46 [2018-11-14 18:53:43,058 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 18:53:43,059 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-14 18:53:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 18:53:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-14 18:53:43,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:53:43,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-14 18:53:43,075 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-14 18:53:43,076 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-14 18:53:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:43,078 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-14 18:53:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-14 18:53:43,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:53:43,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:53:43,079 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-14 18:53:43,080 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-14 18:53:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:43,082 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-14 18:53:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-14 18:53:43,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:53:43,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:53:43,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:53:43,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:53:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:53:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-14 18:53:43,087 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2018-11-14 18:53:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:53:43,087 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-14 18:53:43,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:53:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 18:53:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:53:43,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:53:43,088 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] [2018-11-14 18:53:43,089 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:53:43,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:53:43,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1434210682, now seen corresponding path program 1 times [2018-11-14 18:53:43,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:53:43,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:53:43,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:53:43,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:53:43,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:53:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:53:43,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2018-11-14 18:53:43,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {334#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {334#true} is VALID [2018-11-14 18:53:43,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-14 18:53:43,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #65#return; {334#true} is VALID [2018-11-14 18:53:43,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret5 := main(); {334#true} is VALID [2018-11-14 18:53:43,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {334#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {334#true} is VALID [2018-11-14 18:53:43,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {334#true} is VALID [2018-11-14 18:53:43,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-14 18:53:43,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {334#true} assume !!(~i~0 >= -1); {334#true} is VALID [2018-11-14 18:53:43,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {334#true} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {336#(<= 0 main_~i~0)} is VALID [2018-11-14 18:53:43,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {336#(<= 0 main_~i~0)} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {336#(<= 0 main_~i~0)} is VALID [2018-11-14 18:53:43,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {336#(<= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {337#(<= 0 (+ main_~i~0 1))} is VALID [2018-11-14 18:53:43,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {337#(<= 0 (+ main_~i~0 1))} assume true; {337#(<= 0 (+ main_~i~0 1))} is VALID [2018-11-14 18:53:43,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {337#(<= 0 (+ main_~i~0 1))} assume !(~i~0 >= -1); {335#false} is VALID [2018-11-14 18:53:43,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {335#false} ~i~0 := 0; {335#false} is VALID [2018-11-14 18:53:43,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {335#false} assume true; {335#false} is VALID [2018-11-14 18:53:43,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {335#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {335#false} is VALID [2018-11-14 18:53:43,261 INFO L256 TraceCheckUtils]: 17: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {335#false} is VALID [2018-11-14 18:53:43,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2018-11-14 18:53:43,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {335#false} assume ~cond == 0; {335#false} is VALID [2018-11-14 18:53:43,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {335#false} assume !false; {335#false} is VALID [2018-11-14 18:53:43,264 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-14 18:53:43,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:53:43,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:53:43,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 18:53:43,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:53:43,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:53:43,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:53:43,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:53:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:53:43,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:53:43,327 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2018-11-14 18:53:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:43,550 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-14 18:53:43,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:53:43,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 18:53:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:53:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:53:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-14 18:53:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:53:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-14 18:53:43,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2018-11-14 18:53:43,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:53:43,654 INFO L225 Difference]: With dead ends: 43 [2018-11-14 18:53:43,654 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 18:53:43,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:53:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 18:53:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 18:53:43,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:53:43,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 18:53:43,686 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 18:53:43,686 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 18:53:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:43,688 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-14 18:53:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-14 18:53:43,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:53:43,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:53:43,690 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 18:53:43,690 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 18:53:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:43,692 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-14 18:53:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-14 18:53:43,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:53:43,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:53:43,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:53:43,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:53:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:53:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-14 18:53:43,696 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2018-11-14 18:53:43,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:53:43,697 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-14 18:53:43,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:53:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-14 18:53:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:53:43,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:53:43,698 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] [2018-11-14 18:53:43,699 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:53:43,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:53:43,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1167828013, now seen corresponding path program 1 times [2018-11-14 18:53:43,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:53:43,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:53:43,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:53:43,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:53:43,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:53:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:53:44,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {499#true} call ULTIMATE.init(); {499#true} is VALID [2018-11-14 18:53:44,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {499#true} is VALID [2018-11-14 18:53:44,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {499#true} assume true; {499#true} is VALID [2018-11-14 18:53:44,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {499#true} {499#true} #65#return; {499#true} is VALID [2018-11-14 18:53:44,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {499#true} call #t~ret5 := main(); {499#true} is VALID [2018-11-14 18:53:44,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {499#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {499#true} is VALID [2018-11-14 18:53:44,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {499#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {501#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,741 INFO L273 TraceCheckUtils]: 7: Hoare triple {501#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} assume true; {501#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,741 INFO L273 TraceCheckUtils]: 8: Hoare triple {501#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {501#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,742 INFO L273 TraceCheckUtils]: 9: Hoare triple {501#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {501#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {501#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {501#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {501#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {502#(and (or (<= (+ main_~low~0 1) main_~val2~0) (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {502#(and (or (<= (+ main_~low~0 1) main_~val2~0) (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0))) (= |main_~#a~0.offset| 0))} assume true; {502#(and (or (<= (+ main_~low~0 1) main_~val2~0) (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {502#(and (or (<= (+ main_~low~0 1) main_~val2~0) (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {503#(and (or (<= (+ main_~low~0 1) main_~val2~0) (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0))) (< 0 (+ (* 4 main_~i~0) |main_~#a~0.offset| 5)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {503#(and (or (<= (+ main_~low~0 1) main_~val2~0) (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0))) (< 0 (+ (* 4 main_~i~0) |main_~#a~0.offset| 5)) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= 0); {504#(and (<= (+ main_~low~0 1) main_~val2~0) (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {504#(and (<= (+ main_~low~0 1) main_~val2~0) (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {505#(and (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {505#(and (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {506#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {506#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} assume true; {506#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {506#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= -1); {506#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {506#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {507#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {507#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {507#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:44,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {507#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {508#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-14 18:53:44,762 INFO L256 TraceCheckUtils]: 22: Hoare triple {508#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {509#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:53:44,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {509#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {510#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 18:53:44,764 INFO L273 TraceCheckUtils]: 24: Hoare triple {510#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {500#false} is VALID [2018-11-14 18:53:44,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {500#false} assume !false; {500#false} is VALID [2018-11-14 18:53:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:53:44,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:53:44,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:53:44,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:53:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:53:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:53:44,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:53:45,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 18:53:45,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 18:53:45,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:53:45,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:53:45,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:53:45,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-11-14 18:53:45,277 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:53:46,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 18:53:46,016 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:53:46,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-14 18:53:46,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:53:46,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:53:46,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:53:46,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:7 [2018-11-14 18:53:46,060 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:53:46,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {499#true} call ULTIMATE.init(); {499#true} is VALID [2018-11-14 18:53:46,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {499#true} is VALID [2018-11-14 18:53:46,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {499#true} assume true; {499#true} is VALID [2018-11-14 18:53:46,182 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {499#true} {499#true} #65#return; {499#true} is VALID [2018-11-14 18:53:46,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {499#true} call #t~ret5 := main(); {499#true} is VALID [2018-11-14 18:53:46,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {499#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {499#true} is VALID [2018-11-14 18:53:46,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {499#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume true; {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,191 INFO L273 TraceCheckUtils]: 9: Hoare triple {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,192 INFO L273 TraceCheckUtils]: 10: Hoare triple {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume true; {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,194 INFO L273 TraceCheckUtils]: 13: Hoare triple {532#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {554#(and (<= 0 (+ main_~i~0 1)) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {554#(and (<= 0 (+ main_~i~0 1)) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= 0); {558#(and (<= 0 (+ main_~i~0 1)) (<= 3 main_~val2~0) (<= main_~low~0 2) (< main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {558#(and (<= 0 (+ main_~i~0 1)) (<= 3 main_~val2~0) (<= main_~low~0 2) (< main_~i~0 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {562#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {562#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {562#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,198 INFO L273 TraceCheckUtils]: 17: Hoare triple {562#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume true; {562#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,200 INFO L273 TraceCheckUtils]: 18: Hoare triple {562#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= -1); {562#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {562#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {575#(and (exists ((v_prenex_1 Int)) (and (< v_prenex_1 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset| 4))) (<= 0 (+ v_prenex_1 1)))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {575#(and (exists ((v_prenex_1 Int)) (and (< v_prenex_1 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset| 4))) (<= 0 (+ v_prenex_1 1)))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {575#(and (exists ((v_prenex_1 Int)) (and (< v_prenex_1 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset| 4))) (<= 0 (+ v_prenex_1 1)))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:46,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {575#(and (exists ((v_prenex_1 Int)) (and (< v_prenex_1 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset| 4))) (<= 0 (+ v_prenex_1 1)))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {582#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-14 18:53:46,205 INFO L256 TraceCheckUtils]: 22: Hoare triple {582#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {509#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:53:46,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {509#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {510#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 18:53:46,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {510#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {500#false} is VALID [2018-11-14 18:53:46,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {500#false} assume !false; {500#false} is VALID [2018-11-14 18:53:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:53:46,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:53:46,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-11-14 18:53:46,238 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-11-14 18:53:46,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:53:46,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:53:46,325 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-14 18:53:46,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:53:46,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:53:46,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:53:46,326 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 18 states. [2018-11-14 18:53:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:47,657 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-14 18:53:47,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:53:47,658 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-11-14 18:53:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:53:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:53:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-14 18:53:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:53:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-14 18:53:47,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2018-11-14 18:53:47,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:53:47,754 INFO L225 Difference]: With dead ends: 44 [2018-11-14 18:53:47,755 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:53:47,756 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:53:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:53:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-14 18:53:47,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:53:47,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2018-11-14 18:53:47,823 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2018-11-14 18:53:47,823 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2018-11-14 18:53:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:47,827 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-14 18:53:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-14 18:53:47,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:53:47,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:53:47,829 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2018-11-14 18:53:47,829 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2018-11-14 18:53:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:53:47,832 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-14 18:53:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-14 18:53:47,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:53:47,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:53:47,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:53:47,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:53:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:53:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-14 18:53:47,836 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 26 [2018-11-14 18:53:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:53:47,836 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-14 18:53:47,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:53:47,836 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-14 18:53:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 18:53:47,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:53:47,838 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-14 18:53:47,838 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:53:47,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:53:47,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1015321010, now seen corresponding path program 1 times [2018-11-14 18:53:47,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:53:47,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:53:47,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:53:47,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:53:47,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:53:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:53:48,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {798#true} call ULTIMATE.init(); {798#true} is VALID [2018-11-14 18:53:48,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {798#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {798#true} is VALID [2018-11-14 18:53:48,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {798#true} assume true; {798#true} is VALID [2018-11-14 18:53:48,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {798#true} {798#true} #65#return; {798#true} is VALID [2018-11-14 18:53:48,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {798#true} call #t~ret5 := main(); {798#true} is VALID [2018-11-14 18:53:48,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {798#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {798#true} is VALID [2018-11-14 18:53:48,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {798#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {800#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {800#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} assume true; {800#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {800#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {800#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {800#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {801#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 0 main_~i~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {801#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 0 main_~i~0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {802#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 0 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {802#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 0 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {803#(and (<= 0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) main_~val2~0) (or (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (<= 0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {803#(and (<= 0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) main_~val2~0) (or (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (<= 0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} assume true; {803#(and (<= 0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) main_~val2~0) (or (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (<= 0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {803#(and (<= 0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) main_~val2~0) (or (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (<= 0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {803#(and (<= 0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) main_~val2~0) (or (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (<= 0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {803#(and (<= 0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) main_~val2~0) (or (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (<= 0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= 0); {804#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {804#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {805#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {805#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {805#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {805#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} assume true; {805#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {805#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= -1); {805#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,666 INFO L273 TraceCheckUtils]: 19: Hoare triple {805#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,670 INFO L256 TraceCheckUtils]: 22: Hoare triple {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {798#true} is VALID [2018-11-14 18:53:48,672 INFO L273 TraceCheckUtils]: 23: Hoare triple {798#true} ~cond := #in~cond; {807#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 18:53:48,676 INFO L273 TraceCheckUtils]: 24: Hoare triple {807#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {808#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 18:53:48,678 INFO L273 TraceCheckUtils]: 25: Hoare triple {808#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {808#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 18:53:48,680 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {808#(not (= |__VERIFIER_assert_#in~cond| 0))} {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #69#return; {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,680 INFO L273 TraceCheckUtils]: 27: Hoare triple {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {806#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {809#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {809#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} assume true; {809#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:53:48,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {809#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {810#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-14 18:53:48,684 INFO L256 TraceCheckUtils]: 31: Hoare triple {810#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {808#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 18:53:48,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {808#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {811#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 18:53:48,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {811#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {799#false} is VALID [2018-11-14 18:53:48,686 INFO L273 TraceCheckUtils]: 34: Hoare triple {799#false} assume !false; {799#false} is VALID [2018-11-14 18:53:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:53:48,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:53:48,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:53:48,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:53:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:53:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:53:48,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:53:48,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 18:53:48,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 18:53:48,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:53:48,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:53:48,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:53:48,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-14 18:53:49,232 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 38 treesize of output 31 [2018-11-14 18:53:49,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:53:49,244 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 31 treesize of output 48 [2018-11-14 18:53:49,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:53:49,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:53:49,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:53:49,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-11-14 18:53:49,333 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:53:52,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-11-14 18:53:52,864 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:53:52,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:53:52,866 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:53:52,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2018-11-14 18:53:52,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:53:52,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:53:52,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:53:52,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:7 [2018-11-14 18:53:52,909 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:53:53,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {798#true} call ULTIMATE.init(); {798#true} is VALID [2018-11-14 18:53:53,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {798#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {798#true} is VALID [2018-11-14 18:53:53,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {798#true} assume true; {798#true} is VALID [2018-11-14 18:53:53,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {798#true} {798#true} #65#return; {798#true} is VALID [2018-11-14 18:53:53,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {798#true} call #t~ret5 := main(); {798#true} is VALID [2018-11-14 18:53:53,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {798#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {798#true} is VALID [2018-11-14 18:53:53,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {798#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {833#(and (<= 3 main_~val2~0) (<= main_~low~0 2))} is VALID [2018-11-14 18:53:53,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {833#(and (<= 3 main_~val2~0) (<= main_~low~0 2))} assume true; {833#(and (<= 3 main_~val2~0) (<= main_~low~0 2))} is VALID [2018-11-14 18:53:53,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {833#(and (<= 3 main_~val2~0) (<= main_~low~0 2))} assume !!(~i~0 >= -1); {833#(and (<= 3 main_~val2~0) (<= main_~low~0 2))} is VALID [2018-11-14 18:53:53,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {833#(and (<= 3 main_~val2~0) (<= main_~low~0 2))} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {843#(and (<= 3 main_~val2~0) (<= 0 main_~i~0) (<= main_~low~0 2))} is VALID [2018-11-14 18:53:53,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {843#(and (<= 3 main_~val2~0) (<= 0 main_~i~0) (<= main_~low~0 2))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {847#(and (<= 3 main_~val2~0) (<= 0 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))))} is VALID [2018-11-14 18:53:53,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {847#(and (<= 3 main_~val2~0) (<= 0 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {851#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (exists ((v_main_~i~0_15 Int)) (and (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)))))} is VALID [2018-11-14 18:53:53,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {851#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (exists ((v_main_~i~0_15 Int)) (and (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)))))} assume true; {851#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (exists ((v_main_~i~0_15 Int)) (and (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)))))} is VALID [2018-11-14 18:53:53,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {851#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (exists ((v_main_~i~0_15 Int)) (and (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)))))} assume !!(~i~0 >= -1); {851#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (exists ((v_main_~i~0_15 Int)) (and (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)))))} is VALID [2018-11-14 18:53:53,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {851#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (exists ((v_main_~i~0_15 Int)) (and (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)))))} assume !(~i~0 >= 0); {861#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (exists ((v_main_~i~0_15 Int)) (and (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)))) (< main_~i~0 0))} is VALID [2018-11-14 18:53:53,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {861#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (exists ((v_main_~i~0_15 Int)) (and (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)))) (< main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {865#(and (<= main_~low~0 2) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)) (< main_~i~0 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))))} is VALID [2018-11-14 18:53:53,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(and (<= main_~low~0 2) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)) (< main_~i~0 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {865#(and (<= main_~low~0 2) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)) (< main_~i~0 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))))} is VALID [2018-11-14 18:53:53,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#(and (<= main_~low~0 2) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)) (< main_~i~0 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))))} assume true; {865#(and (<= main_~low~0 2) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)) (< main_~i~0 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))))} is VALID [2018-11-14 18:53:53,151 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#(and (<= main_~low~0 2) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)) (< main_~i~0 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))))} assume !(~i~0 >= -1); {865#(and (<= main_~low~0 2) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)) (< main_~i~0 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))))} is VALID [2018-11-14 18:53:53,152 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#(and (<= main_~low~0 2) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)) (< main_~i~0 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))))} ~i~0 := 0; {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} is VALID [2018-11-14 18:53:53,153 INFO L273 TraceCheckUtils]: 20: Hoare triple {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} assume true; {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} is VALID [2018-11-14 18:53:53,153 INFO L273 TraceCheckUtils]: 21: Hoare triple {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} is VALID [2018-11-14 18:53:53,163 INFO L256 TraceCheckUtils]: 22: Hoare triple {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {888#(exists ((v_prenex_2 Int) (v_main_~i~0_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_prenex_2) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 0 v_main_~i~0_15) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1))))} is VALID [2018-11-14 18:53:53,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {888#(exists ((v_prenex_2 Int) (v_main_~i~0_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_prenex_2) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 0 v_main_~i~0_15) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1))))} ~cond := #in~cond; {892#(and (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_prenex_2) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 0 v_main_~i~0_15) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:53:53,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {892#(and (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_prenex_2) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 0 v_main_~i~0_15) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(~cond == 0); {896#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_prenex_2) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 0 v_main_~i~0_15) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)))))} is VALID [2018-11-14 18:53:53,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {896#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_prenex_2) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 0 v_main_~i~0_15) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)))))} assume true; {896#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_prenex_2) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 0 v_main_~i~0_15) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)))))} is VALID [2018-11-14 18:53:53,168 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {896#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_prenex_2) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_15) |v_main_~#a~0.offset_BEFORE_CALL_1| 4))) (<= 0 v_main_~i~0_15) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)))))} {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} #69#return; {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} is VALID [2018-11-14 18:53:53,169 INFO L273 TraceCheckUtils]: 27: Hoare triple {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} havoc #t~mem4; {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} is VALID [2018-11-14 18:53:53,171 INFO L273 TraceCheckUtils]: 28: Hoare triple {878#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {909#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 1))} is VALID [2018-11-14 18:53:53,172 INFO L273 TraceCheckUtils]: 29: Hoare triple {909#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 1))} assume true; {909#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 1))} is VALID [2018-11-14 18:53:53,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {909#(and (<= main_~low~0 2) (exists ((v_prenex_2 Int) (v_main_~i~0_15 Int)) (and (<= 0 v_main_~i~0_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset| 4))) (< v_prenex_2 0) (<= v_main_~i~0_15 (+ v_prenex_2 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4))))) (= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {916#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-14 18:53:53,177 INFO L256 TraceCheckUtils]: 31: Hoare triple {916#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {920#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:53:53,178 INFO L273 TraceCheckUtils]: 32: Hoare triple {920#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {924#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 18:53:53,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {924#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {799#false} is VALID [2018-11-14 18:53:53,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {799#false} assume !false; {799#false} is VALID [2018-11-14 18:53:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:53:53,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:53:53,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-11-14 18:53:53,206 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-14 18:53:53,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:53:53,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 18:53:53,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:53:53,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 18:53:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 18:53:53,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=675, Unknown=1, NotChecked=0, Total=756 [2018-11-14 18:53:53,424 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 28 states. [2018-11-14 18:54:21,578 WARN L179 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-11-14 18:54:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:25,357 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-14 18:54:25,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:54:25,358 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-14 18:54:25,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:54:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2018-11-14 18:54:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:54:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2018-11-14 18:54:25,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2018-11-14 18:54:29,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:29,147 INFO L225 Difference]: With dead ends: 53 [2018-11-14 18:54:29,147 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 18:54:29,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=252, Invalid=1553, Unknown=1, NotChecked=0, Total=1806 [2018-11-14 18:54:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 18:54:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-14 18:54:29,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:29,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-14 18:54:29,303 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-14 18:54:29,303 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-14 18:54:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:29,306 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-11-14 18:54:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-11-14 18:54:29,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:29,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:29,307 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-14 18:54:29,307 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-14 18:54:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:29,310 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-11-14 18:54:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-11-14 18:54:29,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:29,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:29,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:29,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:54:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-14 18:54:29,314 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 35 [2018-11-14 18:54:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:29,314 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-14 18:54:29,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 18:54:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-14 18:54:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 18:54:29,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:29,316 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:29,317 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:29,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:29,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1920862669, now seen corresponding path program 2 times [2018-11-14 18:54:29,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:29,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:29,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:29,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:29,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:29,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2018-11-14 18:54:29,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {1196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1196#true} is VALID [2018-11-14 18:54:29,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-14 18:54:29,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #65#return; {1196#true} is VALID [2018-11-14 18:54:29,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret5 := main(); {1196#true} is VALID [2018-11-14 18:54:29,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {1196#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1196#true} is VALID [2018-11-14 18:54:29,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {1196#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {1198#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-14 18:54:29,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {1198#(<= ~SIZE~0 (+ main_~i~0 2))} assume true; {1198#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-14 18:54:29,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {1198#(<= ~SIZE~0 (+ main_~i~0 2))} assume !!(~i~0 >= -1); {1198#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-14 18:54:29,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {1198#(<= ~SIZE~0 (+ main_~i~0 2))} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1198#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-14 18:54:29,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {1198#(<= ~SIZE~0 (+ main_~i~0 2))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {1198#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-14 18:54:29,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {1198#(<= ~SIZE~0 (+ main_~i~0 2))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1199#(<= ~SIZE~0 (+ main_~i~0 3))} is VALID [2018-11-14 18:54:29,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {1199#(<= ~SIZE~0 (+ main_~i~0 3))} assume true; {1199#(<= ~SIZE~0 (+ main_~i~0 3))} is VALID [2018-11-14 18:54:29,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {1199#(<= ~SIZE~0 (+ main_~i~0 3))} assume !!(~i~0 >= -1); {1199#(<= ~SIZE~0 (+ main_~i~0 3))} is VALID [2018-11-14 18:54:29,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {1199#(<= ~SIZE~0 (+ main_~i~0 3))} assume !(~i~0 >= 0); {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {1200#(<= ~SIZE~0 2)} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {1200#(<= ~SIZE~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {1200#(<= ~SIZE~0 2)} assume true; {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {1200#(<= ~SIZE~0 2)} assume !(~i~0 >= -1); {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {1200#(<= ~SIZE~0 2)} ~i~0 := 0; {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-14 18:54:29,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} assume true; {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-14 18:54:29,533 INFO L273 TraceCheckUtils]: 21: Hoare triple {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-14 18:54:29,533 INFO L256 TraceCheckUtils]: 22: Hoare triple {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1196#true} is VALID [2018-11-14 18:54:29,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2018-11-14 18:54:29,534 INFO L273 TraceCheckUtils]: 24: Hoare triple {1196#true} assume !(~cond == 0); {1196#true} is VALID [2018-11-14 18:54:29,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-14 18:54:29,535 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1196#true} {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} #69#return; {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-14 18:54:29,536 INFO L273 TraceCheckUtils]: 27: Hoare triple {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} havoc #t~mem4; {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-14 18:54:29,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {1201#(and (<= ~SIZE~0 2) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1202#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-14 18:54:29,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {1202#(<= ~SIZE~0 (+ main_~i~0 1))} assume true; {1202#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-14 18:54:29,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {1202#(<= ~SIZE~0 (+ main_~i~0 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1202#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-14 18:54:29,544 INFO L256 TraceCheckUtils]: 31: Hoare triple {1202#(<= ~SIZE~0 (+ main_~i~0 1))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1196#true} is VALID [2018-11-14 18:54:29,544 INFO L273 TraceCheckUtils]: 32: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2018-11-14 18:54:29,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {1196#true} assume !(~cond == 0); {1196#true} is VALID [2018-11-14 18:54:29,544 INFO L273 TraceCheckUtils]: 34: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-14 18:54:29,545 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1196#true} {1202#(<= ~SIZE~0 (+ main_~i~0 1))} #69#return; {1202#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-14 18:54:29,545 INFO L273 TraceCheckUtils]: 36: Hoare triple {1202#(<= ~SIZE~0 (+ main_~i~0 1))} havoc #t~mem4; {1202#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-14 18:54:29,546 INFO L273 TraceCheckUtils]: 37: Hoare triple {1202#(<= ~SIZE~0 (+ main_~i~0 1))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1203#(<= ~SIZE~0 main_~i~0)} is VALID [2018-11-14 18:54:29,546 INFO L273 TraceCheckUtils]: 38: Hoare triple {1203#(<= ~SIZE~0 main_~i~0)} assume true; {1203#(<= ~SIZE~0 main_~i~0)} is VALID [2018-11-14 18:54:29,547 INFO L273 TraceCheckUtils]: 39: Hoare triple {1203#(<= ~SIZE~0 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1197#false} is VALID [2018-11-14 18:54:29,547 INFO L256 TraceCheckUtils]: 40: Hoare triple {1197#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1197#false} is VALID [2018-11-14 18:54:29,547 INFO L273 TraceCheckUtils]: 41: Hoare triple {1197#false} ~cond := #in~cond; {1197#false} is VALID [2018-11-14 18:54:29,547 INFO L273 TraceCheckUtils]: 42: Hoare triple {1197#false} assume ~cond == 0; {1197#false} is VALID [2018-11-14 18:54:29,548 INFO L273 TraceCheckUtils]: 43: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2018-11-14 18:54:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 18:54:29,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:29,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:29,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:54:29,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:54:29,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:29,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:29,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2018-11-14 18:54:29,761 INFO L273 TraceCheckUtils]: 1: Hoare triple {1196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1196#true} is VALID [2018-11-14 18:54:29,762 INFO L273 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-14 18:54:29,762 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #65#return; {1196#true} is VALID [2018-11-14 18:54:29,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret5 := main(); {1196#true} is VALID [2018-11-14 18:54:29,763 INFO L273 TraceCheckUtils]: 5: Hoare triple {1196#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1196#true} is VALID [2018-11-14 18:54:29,764 INFO L273 TraceCheckUtils]: 6: Hoare triple {1196#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {1198#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-14 18:54:29,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {1198#(<= ~SIZE~0 (+ main_~i~0 2))} assume true; {1198#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-14 18:54:29,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {1198#(<= ~SIZE~0 (+ main_~i~0 2))} assume !!(~i~0 >= -1); {1198#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-14 18:54:29,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {1198#(<= ~SIZE~0 (+ main_~i~0 2))} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1198#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-14 18:54:29,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {1198#(<= ~SIZE~0 (+ main_~i~0 2))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {1198#(<= ~SIZE~0 (+ main_~i~0 2))} is VALID [2018-11-14 18:54:29,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {1198#(<= ~SIZE~0 (+ main_~i~0 2))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1199#(<= ~SIZE~0 (+ main_~i~0 3))} is VALID [2018-11-14 18:54:29,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {1199#(<= ~SIZE~0 (+ main_~i~0 3))} assume true; {1199#(<= ~SIZE~0 (+ main_~i~0 3))} is VALID [2018-11-14 18:54:29,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {1199#(<= ~SIZE~0 (+ main_~i~0 3))} assume !!(~i~0 >= -1); {1199#(<= ~SIZE~0 (+ main_~i~0 3))} is VALID [2018-11-14 18:54:29,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {1199#(<= ~SIZE~0 (+ main_~i~0 3))} assume !(~i~0 >= 0); {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {1200#(<= ~SIZE~0 2)} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,770 INFO L273 TraceCheckUtils]: 16: Hoare triple {1200#(<= ~SIZE~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {1200#(<= ~SIZE~0 2)} assume true; {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {1200#(<= ~SIZE~0 2)} assume !(~i~0 >= -1); {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,771 INFO L273 TraceCheckUtils]: 19: Hoare triple {1200#(<= ~SIZE~0 2)} ~i~0 := 0; {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} assume true; {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,774 INFO L256 TraceCheckUtils]: 22: Hoare triple {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {1200#(<= ~SIZE~0 2)} ~cond := #in~cond; {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,775 INFO L273 TraceCheckUtils]: 24: Hoare triple {1200#(<= ~SIZE~0 2)} assume !(~cond == 0); {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {1200#(<= ~SIZE~0 2)} assume true; {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,777 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1200#(<= ~SIZE~0 2)} {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} #69#return; {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} havoc #t~mem4; {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,780 INFO L273 TraceCheckUtils]: 29: Hoare triple {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} assume true; {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,781 INFO L273 TraceCheckUtils]: 30: Hoare triple {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,783 INFO L256 TraceCheckUtils]: 31: Hoare triple {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,784 INFO L273 TraceCheckUtils]: 32: Hoare triple {1200#(<= ~SIZE~0 2)} ~cond := #in~cond; {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,784 INFO L273 TraceCheckUtils]: 33: Hoare triple {1200#(<= ~SIZE~0 2)} assume !(~cond == 0); {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,785 INFO L273 TraceCheckUtils]: 34: Hoare triple {1200#(<= ~SIZE~0 2)} assume true; {1200#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:54:29,786 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1200#(<= ~SIZE~0 2)} {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} #69#return; {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,788 INFO L273 TraceCheckUtils]: 36: Hoare triple {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} havoc #t~mem4; {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,792 INFO L273 TraceCheckUtils]: 37: Hoare triple {1292#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1320#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,793 INFO L273 TraceCheckUtils]: 38: Hoare triple {1320#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} assume true; {1320#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:54:29,794 INFO L273 TraceCheckUtils]: 39: Hoare triple {1320#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1197#false} is VALID [2018-11-14 18:54:29,794 INFO L256 TraceCheckUtils]: 40: Hoare triple {1197#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1197#false} is VALID [2018-11-14 18:54:29,795 INFO L273 TraceCheckUtils]: 41: Hoare triple {1197#false} ~cond := #in~cond; {1197#false} is VALID [2018-11-14 18:54:29,795 INFO L273 TraceCheckUtils]: 42: Hoare triple {1197#false} assume ~cond == 0; {1197#false} is VALID [2018-11-14 18:54:29,795 INFO L273 TraceCheckUtils]: 43: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2018-11-14 18:54:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 18:54:29,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:29,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-11-14 18:54:29,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-11-14 18:54:29,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:29,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:54:29,886 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-14 18:54:29,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:54:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:54:29,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:54:29,888 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 11 states. [2018-11-14 18:54:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:30,921 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-11-14 18:54:30,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:54:30,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-11-14 18:54:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:54:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2018-11-14 18:54:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:54:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2018-11-14 18:54:30,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 77 transitions. [2018-11-14 18:54:31,016 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-14 18:54:31,018 INFO L225 Difference]: With dead ends: 95 [2018-11-14 18:54:31,018 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 18:54:31,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:54:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 18:54:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-14 18:54:31,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:31,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-14 18:54:31,103 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-14 18:54:31,103 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-14 18:54:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:31,106 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-14 18:54:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-14 18:54:31,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:31,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:31,107 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-14 18:54:31,107 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-14 18:54:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:31,110 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-14 18:54:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-14 18:54:31,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:31,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:31,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:31,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 18:54:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-14 18:54:31,114 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 44 [2018-11-14 18:54:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:31,114 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-14 18:54:31,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:54:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-14 18:54:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 18:54:31,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:31,116 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:31,116 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:31,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:31,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1653942468, now seen corresponding path program 3 times [2018-11-14 18:54:31,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:31,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:31,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:31,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:31,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2018-11-14 18:54:31,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {1641#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1641#true} is VALID [2018-11-14 18:54:31,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2018-11-14 18:54:31,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1641#true} #65#return; {1641#true} is VALID [2018-11-14 18:54:31,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {1641#true} call #t~ret5 := main(); {1641#true} is VALID [2018-11-14 18:54:31,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {1641#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1641#true} is VALID [2018-11-14 18:54:31,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {1641#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {1643#(<= (+ main_~low~0 1) main_~val2~0)} is VALID [2018-11-14 18:54:31,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {1643#(<= (+ main_~low~0 1) main_~val2~0)} assume true; {1643#(<= (+ main_~low~0 1) main_~val2~0)} is VALID [2018-11-14 18:54:31,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {1643#(<= (+ main_~low~0 1) main_~val2~0)} assume !!(~i~0 >= -1); {1643#(<= (+ main_~low~0 1) main_~val2~0)} is VALID [2018-11-14 18:54:31,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {1643#(<= (+ main_~low~0 1) main_~val2~0)} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1643#(<= (+ main_~low~0 1) main_~val2~0)} is VALID [2018-11-14 18:54:31,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {1643#(<= (+ main_~low~0 1) main_~val2~0)} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {1644#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:54:31,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {1644#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1645#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val1~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))))} is VALID [2018-11-14 18:54:31,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {1645#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val1~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))))} assume true; {1645#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val1~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))))} is VALID [2018-11-14 18:54:31,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {1645#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val1~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))))} assume !!(~i~0 >= -1); {1645#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val1~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))))} is VALID [2018-11-14 18:54:31,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {1645#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val1~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))))} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1646#(or (<= 1 main_~i~0) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= 1 (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)) (- 4))) 4))))} is VALID [2018-11-14 18:54:31,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {1646#(or (<= 1 main_~i~0) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= 1 (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)) (- 4))) 4))))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {1646#(or (<= 1 main_~i~0) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= 1 (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)) (- 4))) 4))))} is VALID [2018-11-14 18:54:31,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {1646#(or (<= 1 main_~i~0) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= 1 (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)) (- 4))) 4))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1647#(and (<= 0 (+ main_~i~0 1)) (or (<= 0 main_~i~0) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4)))))))} is VALID [2018-11-14 18:54:31,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {1647#(and (<= 0 (+ main_~i~0 1)) (or (<= 0 main_~i~0) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4)))))))} assume true; {1647#(and (<= 0 (+ main_~i~0 1)) (or (<= 0 main_~i~0) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4)))))))} is VALID [2018-11-14 18:54:31,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {1647#(and (<= 0 (+ main_~i~0 1)) (or (<= 0 main_~i~0) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4)))))))} assume !!(~i~0 >= -1); {1647#(and (<= 0 (+ main_~i~0 1)) (or (<= 0 main_~i~0) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4)))))))} is VALID [2018-11-14 18:54:31,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {1647#(and (<= 0 (+ main_~i~0 1)) (or (<= 0 main_~i~0) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4)))))))} assume !(~i~0 >= 0); {1648#(and (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (<= (+ main_~low~0 1) main_~val2~0))} is VALID [2018-11-14 18:54:31,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {1648#(and (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (<= (+ main_~low~0 1) main_~val2~0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + (~i~0 + 1) * 4, 4); {1649#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} is VALID [2018-11-14 18:54:31,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {1649#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1649#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} is VALID [2018-11-14 18:54:31,774 INFO L273 TraceCheckUtils]: 22: Hoare triple {1649#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} assume true; {1649#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} is VALID [2018-11-14 18:54:31,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {1649#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} assume !(~i~0 >= -1); {1649#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} is VALID [2018-11-14 18:54:31,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {1649#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} ~i~0 := 0; {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} is VALID [2018-11-14 18:54:31,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} assume true; {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} is VALID [2018-11-14 18:54:31,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} is VALID [2018-11-14 18:54:31,778 INFO L256 TraceCheckUtils]: 27: Hoare triple {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1641#true} is VALID [2018-11-14 18:54:31,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {1641#true} ~cond := #in~cond; {1651#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 18:54:31,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {1651#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {1652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 18:54:31,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {1652#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 18:54:31,780 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1652#(not (= |__VERIFIER_assert_#in~cond| 0))} {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} #69#return; {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} is VALID [2018-11-14 18:54:31,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} havoc #t~mem4; {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} is VALID [2018-11-14 18:54:31,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {1650#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:54:31,783 INFO L273 TraceCheckUtils]: 34: Hoare triple {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} assume true; {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:54:31,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:54:31,784 INFO L256 TraceCheckUtils]: 36: Hoare triple {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1641#true} is VALID [2018-11-14 18:54:31,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {1641#true} ~cond := #in~cond; {1641#true} is VALID [2018-11-14 18:54:31,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {1641#true} assume !(~cond == 0); {1641#true} is VALID [2018-11-14 18:54:31,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {1641#true} assume true; {1641#true} is VALID [2018-11-14 18:54:31,804 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1641#true} {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} #69#return; {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:54:31,819 INFO L273 TraceCheckUtils]: 41: Hoare triple {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} havoc #t~mem4; {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:54:31,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {1653#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1654#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-14 18:54:31,825 INFO L273 TraceCheckUtils]: 43: Hoare triple {1654#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} assume true; {1654#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-14 18:54:31,826 INFO L273 TraceCheckUtils]: 44: Hoare triple {1654#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1655#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-14 18:54:31,827 INFO L256 TraceCheckUtils]: 45: Hoare triple {1655#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 18:54:31,828 INFO L273 TraceCheckUtils]: 46: Hoare triple {1652#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1656#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 18:54:31,829 INFO L273 TraceCheckUtils]: 47: Hoare triple {1656#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {1642#false} is VALID [2018-11-14 18:54:31,829 INFO L273 TraceCheckUtils]: 48: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2018-11-14 18:54:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 18:54:31,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:31,838 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-14 18:54:31,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:54:31,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:54:31,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:31,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:32,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 18:54:32,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 18:54:32,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:54:32,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:54:32,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:54:32,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 18:54:32,512 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 28 treesize of output 23 [2018-11-14 18:54:32,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 37 [2018-11-14 18:54:32,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-14 18:54:32,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:54:32,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:54:32,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:42 [2018-11-14 18:54:32,591 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:54:32,718 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 28 treesize of output 25 [2018-11-14 18:54:32,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 18:54:32,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:54:32,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:54:32,774 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 45 treesize of output 40 [2018-11-14 18:54:32,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 24 treesize of output 25 [2018-11-14 18:54:32,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:54:32,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:54:32,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:54:32,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:66 [2018-11-14 18:54:33,122 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 59 treesize of output 48 [2018-11-14 18:54:33,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-11-14 18:54:33,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:54:33,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:54:33,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-14 18:54:33,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:76 [2018-11-14 18:54:33,196 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:54:46,109 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 66 [2018-11-14 18:54:48,327 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 66 [2018-11-14 18:54:52,779 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:52,780 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-11-14 18:54:52,787 INFO L168 Benchmark]: Toolchain (without parser) took 72724.67 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 999.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -608.7 MB). Peak memory consumption was 390.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:54:52,787 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:54:52,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:54:52,788 INFO L168 Benchmark]: Boogie Preprocessor took 59.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:54:52,789 INFO L168 Benchmark]: RCFGBuilder took 674.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 18:54:52,789 INFO L168 Benchmark]: TraceAbstraction took 71613.19 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 243.3 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 161.4 MB). Peak memory consumption was 404.7 MB. Max. memory is 7.1 GB. [2018-11-14 18:54:52,792 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 371.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 674.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71613.19 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 243.3 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 161.4 MB). Peak memory consumption was 404.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...