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_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:25:44,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:25:44,240 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:25:44,253 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:25:44,254 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:25:44,255 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:25:44,256 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:25:44,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:25:44,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:25:44,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:25:44,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:25:44,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:25:44,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:25:44,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:25:44,265 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:25:44,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:25:44,268 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:25:44,270 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:25:44,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:25:44,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:25:44,280 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:25:44,282 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:25:44,285 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:25:44,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:25:44,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:25:44,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:25:44,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:25:44,293 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:25:44,294 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:25:44,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:25:44,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:25:44,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:25:44,299 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:25:44,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:25:44,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:25:44,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:25:44,301 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:25:44,321 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:25:44,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:25:44,322 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:25:44,322 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:25:44,323 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:25:44,323 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:25:44,323 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:25:44,323 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:25:44,323 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:25:44,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:25:44,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:25:44,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:25:44,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:25:44,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:25:44,326 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:25:44,326 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:25:44,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:25:44,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:25:44,326 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:25:44,327 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:25:44,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:25:44,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:25:44,327 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:25:44,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:25:44,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:25:44,328 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:25:44,328 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:25:44,328 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:25:44,328 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:25:44,329 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:25:44,330 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:25:44,330 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:25:44,330 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:25:44,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:25:44,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:25:44,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:25:44,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:25:44,407 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:25:44,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-14 18:25:44,478 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebca61eff/78ef38d3271c45858c35a7797008d370/FLAG31841a94f [2018-11-14 18:25:44,903 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:25:44,903 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-14 18:25:44,909 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebca61eff/78ef38d3271c45858c35a7797008d370/FLAG31841a94f [2018-11-14 18:25:44,923 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebca61eff/78ef38d3271c45858c35a7797008d370 [2018-11-14 18:25:44,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:25:44,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:25:44,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:25:44,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:25:44,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:25:44,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:25:44" (1/1) ... [2018-11-14 18:25:44,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccffd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:44, skipping insertion in model container [2018-11-14 18:25:44,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:25:44" (1/1) ... [2018-11-14 18:25:44,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:25:44,983 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:25:45,243 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:25:45,251 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:25:45,283 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:25:45,312 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:25:45,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:45 WrapperNode [2018-11-14 18:25:45,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:25:45,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:25:45,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:25:45,314 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:25:45,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:45" (1/1) ... [2018-11-14 18:25:45,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:45" (1/1) ... [2018-11-14 18:25:45,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:45" (1/1) ... [2018-11-14 18:25:45,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:45" (1/1) ... [2018-11-14 18:25:45,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:45" (1/1) ... [2018-11-14 18:25:45,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:45" (1/1) ... [2018-11-14 18:25:45,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:45" (1/1) ... [2018-11-14 18:25:45,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:25:45,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:25:45,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:25:45,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:25:45,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:45" (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:25:45,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:25:45,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:25:45,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:25:45,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:25:45,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:25:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:25:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 18:25:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:25:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:25:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:25:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:25:45,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:25:45,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:25:45,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:25:45,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:25:46,121 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:25:46,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:25:46 BoogieIcfgContainer [2018-11-14 18:25:46,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:25:46,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:25:46,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:25:46,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:25:46,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:25:44" (1/3) ... [2018-11-14 18:25:46,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae6560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:25:46, skipping insertion in model container [2018-11-14 18:25:46,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:45" (2/3) ... [2018-11-14 18:25:46,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae6560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:25:46, skipping insertion in model container [2018-11-14 18:25:46,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:25:46" (3/3) ... [2018-11-14 18:25:46,129 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-14 18:25:46,137 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:25:46,145 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:25:46,163 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:25:46,196 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:25:46,197 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:25:46,197 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:25:46,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:25:46,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:25:46,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:25:46,198 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:25:46,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:25:46,198 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:25:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 18:25:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 18:25:46,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:46,225 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:46,227 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:46,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:46,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1403248464, now seen corresponding path program 1 times [2018-11-14 18:25:46,238 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:46,238 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:25:46,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:46,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:46,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 18:25:46,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {36#true} is VALID [2018-11-14 18:25:46,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 18:25:46,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #79#return; {36#true} is VALID [2018-11-14 18:25:46,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret9 := main(); {36#true} is VALID [2018-11-14 18:25:46,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {36#true} is VALID [2018-11-14 18:25:46,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 18:25:46,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} ~k~0 := 1bv32; {37#false} is VALID [2018-11-14 18:25:46,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 18:25:46,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {37#false} is VALID [2018-11-14 18:25:46,469 INFO L256 TraceCheckUtils]: 10: Hoare triple {37#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {37#false} is VALID [2018-11-14 18:25:46,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-14 18:25:46,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume ~cond == 0bv32; {37#false} is VALID [2018-11-14 18:25:46,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 18:25:46,473 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:25:46,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 18:25:46,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:25:46,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:25:46,486 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 18:25:46,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:46,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:25:46,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:46,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:25:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:25:46,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:25:46,611 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 18:25:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:46,900 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-11-14 18:25:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:25:46,901 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 18:25:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:25:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-14 18:25:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:25:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-14 18:25:46,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-14 18:25:47,245 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:25:47,257 INFO L225 Difference]: With dead ends: 60 [2018-11-14 18:25:47,258 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 18:25:47,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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:25:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 18:25:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 18:25:47,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:47,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 18:25:47,325 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 18:25:47,325 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 18:25:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:47,332 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 18:25:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 18:25:47,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:47,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:47,333 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 18:25:47,333 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 18:25:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:47,338 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 18:25:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 18:25:47,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:47,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:47,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:47,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:25:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-14 18:25:47,344 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-11-14 18:25:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:47,345 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-14 18:25:47,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:25:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 18:25:47,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:25:47,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:47,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:47,347 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:47,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:47,347 INFO L82 PathProgramCache]: Analyzing trace with hash 969867983, now seen corresponding path program 1 times [2018-11-14 18:25:47,348 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:47,348 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:25:47,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:47,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:47,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2018-11-14 18:25:47,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {246#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {246#true} is VALID [2018-11-14 18:25:47,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2018-11-14 18:25:47,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #79#return; {246#true} is VALID [2018-11-14 18:25:47,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret9 := main(); {246#true} is VALID [2018-11-14 18:25:47,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {246#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {266#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:47,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {266#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {266#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:47,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {266#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~j~0, ~SIZE~0); {273#(not (bvult (_ bv1 32) main_~SIZE~0))} is VALID [2018-11-14 18:25:47,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {273#(not (bvult (_ bv1 32) main_~SIZE~0))} ~k~0 := 1bv32; {277#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:47,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {277#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {277#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:47,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {277#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {247#false} is VALID [2018-11-14 18:25:47,749 INFO L256 TraceCheckUtils]: 11: Hoare triple {247#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {247#false} is VALID [2018-11-14 18:25:47,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {247#false} ~cond := #in~cond; {247#false} is VALID [2018-11-14 18:25:47,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {247#false} assume ~cond == 0bv32; {247#false} is VALID [2018-11-14 18:25:47,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {247#false} assume !false; {247#false} is VALID [2018-11-14 18:25:47,753 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:25:47,753 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:25:47,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:25:47,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:25:47,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 18:25:47,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:47,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:25:47,869 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:25:47,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:25:47,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:25:47,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:25:47,870 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-14 18:25:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:48,364 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 18:25:48,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:25:48,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 18:25:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:25:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-14 18:25:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:25:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-14 18:25:48,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-14 18:25:48,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:48,516 INFO L225 Difference]: With dead ends: 52 [2018-11-14 18:25:48,517 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 18:25:48,518 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:25:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 18:25:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-11-14 18:25:48,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:48,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 30 states. [2018-11-14 18:25:48,534 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 30 states. [2018-11-14 18:25:48,534 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 30 states. [2018-11-14 18:25:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:48,538 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-14 18:25:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 18:25:48,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:48,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:48,539 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 38 states. [2018-11-14 18:25:48,540 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 38 states. [2018-11-14 18:25:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:48,543 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-14 18:25:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 18:25:48,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:48,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:48,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:48,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:25:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-14 18:25:48,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-11-14 18:25:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:48,547 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-14 18:25:48,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:25:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 18:25:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:25:48,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:48,548 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:48,549 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:48,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:48,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1889876064, now seen corresponding path program 1 times [2018-11-14 18:25:48,550 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:48,550 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:25:48,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:48,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:48,984 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-14 18:25:49,228 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 34 treesize of output 25 [2018-11-14 18:25:49,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:25:49,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-14 18:25:49,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:49,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:49,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:49,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2018-11-14 18:25:49,728 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 27 treesize of output 19 [2018-11-14 18:25:49,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-11-14 18:25:49,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:49,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:49,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:49,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:4 [2018-11-14 18:25:49,771 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:25:49,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {482#true} is VALID [2018-11-14 18:25:49,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {482#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {482#true} is VALID [2018-11-14 18:25:49,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2018-11-14 18:25:49,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #79#return; {482#true} is VALID [2018-11-14 18:25:49,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {482#true} call #t~ret9 := main(); {482#true} is VALID [2018-11-14 18:25:49,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {482#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {502#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:25:49,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {502#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {502#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:25:49,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {502#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {509#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:25:49,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {509#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {509#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:25:49,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {509#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {509#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:25:49,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {509#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {519#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:25:49,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {519#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {523#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-14 18:25:49,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {523#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {527#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:25:49,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {527#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {527#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:25:49,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {527#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume true; {527#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:25:49,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {527#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !~bvult32(~j~0, ~SIZE~0); {527#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:25:49,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {527#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} ~k~0 := 1bv32; {540#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:25:49,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {540#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume true; {540#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:25:49,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {540#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {547#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} is VALID [2018-11-14 18:25:49,985 INFO L256 TraceCheckUtils]: 19: Hoare triple {547#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {551#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:49,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {551#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {555#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:49,990 INFO L273 TraceCheckUtils]: 21: Hoare triple {555#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {483#false} is VALID [2018-11-14 18:25:49,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {483#false} assume !false; {483#false} is VALID [2018-11-14 18:25:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:25:49,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:25:50,845 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 65 treesize of output 53 [2018-11-14 18:26:17,658 WARN L179 SmtUtils]: Spent 26.74 s on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-11-14 18:26:17,669 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:17,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:17,671 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:17,677 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:17,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 55 [2018-11-14 18:26:17,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:17,694 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 18:26:17,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:17,714 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:17,714 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:17,715 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:17,715 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:17,716 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:17,737 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:17,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 79 [2018-11-14 18:26:17,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-14 18:26:17,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:26:17,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:17,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:8 [2018-11-14 18:26:17,843 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:26:17,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {483#false} assume !false; {483#false} is VALID [2018-11-14 18:26:17,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {565#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {483#false} is VALID [2018-11-14 18:26:17,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {569#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {565#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:26:17,928 INFO L256 TraceCheckUtils]: 19: Hoare triple {547#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {569#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:26:17,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {576#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {547#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} is VALID [2018-11-14 18:26:17,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {576#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} assume true; {576#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} is VALID [2018-11-14 18:26:17,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {583#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} ~k~0 := 1bv32; {576#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} is VALID [2018-11-14 18:26:17,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {583#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} assume !~bvult32(~j~0, ~SIZE~0); {583#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 18:26:17,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {583#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} assume true; {583#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 18:26:17,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {583#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {583#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 18:26:18,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {596#(not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {583#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 18:26:18,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {600#(or (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))) |main_#t~short4|)} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {596#(not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 18:26:18,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {604#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {600#(or (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))) |main_#t~short4|)} is VALID [2018-11-14 18:26:18,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {604#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~short4 := ~bvsge32(~i~0, 0bv32); {604#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:26:18,011 INFO L273 TraceCheckUtils]: 8: Hoare triple {604#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume true; {604#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:26:20,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {614#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {604#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is UNKNOWN [2018-11-14 18:26:20,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {614#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} assume true; {614#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} is VALID [2018-11-14 18:26:20,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {482#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {614#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} is VALID [2018-11-14 18:26:20,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {482#true} call #t~ret9 := main(); {482#true} is VALID [2018-11-14 18:26:20,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #79#return; {482#true} is VALID [2018-11-14 18:26:20,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2018-11-14 18:26:20,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {482#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {482#true} is VALID [2018-11-14 18:26:20,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {482#true} is VALID [2018-11-14 18:26:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:26:20,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:26:20,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-14 18:26:20,079 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-11-14 18:26:20,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:26:20,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:26:22,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 18:26:22,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:26:22,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:26:22,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:26:22,306 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 19 states. [2018-11-14 18:26:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:26:29,659 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2018-11-14 18:26:29,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 18:26:29,660 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-11-14 18:26:29,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:26:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:26:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 152 transitions. [2018-11-14 18:26:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:26:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 152 transitions. [2018-11-14 18:26:29,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 152 transitions. [2018-11-14 18:26:31,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:26:31,462 INFO L225 Difference]: With dead ends: 122 [2018-11-14 18:26:31,462 INFO L226 Difference]: Without dead ends: 100 [2018-11-14 18:26:31,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:26:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-14 18:26:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 52. [2018-11-14 18:26:31,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:26:31,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 52 states. [2018-11-14 18:26:31,615 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 52 states. [2018-11-14 18:26:31,615 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 52 states. [2018-11-14 18:26:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:26:31,623 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2018-11-14 18:26:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2018-11-14 18:26:31,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:26:31,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:26:31,625 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 100 states. [2018-11-14 18:26:31,625 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 100 states. [2018-11-14 18:26:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:26:31,632 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2018-11-14 18:26:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2018-11-14 18:26:31,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:26:31,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:26:31,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:26:31,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:26:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 18:26:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-11-14 18:26:31,637 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 23 [2018-11-14 18:26:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:26:31,638 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-11-14 18:26:31,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:26:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-14 18:26:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:26:31,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:26:31,641 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:26:31,641 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:26:31,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:26:31,641 INFO L82 PathProgramCache]: Analyzing trace with hash 337379442, now seen corresponding path program 1 times [2018-11-14 18:26:31,642 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:26:31,642 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:26:31,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:26:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:26:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:26:31,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:26:31,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2018-11-14 18:26:31,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {1085#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1085#true} is VALID [2018-11-14 18:26:31,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {1085#true} assume true; {1085#true} is VALID [2018-11-14 18:26:31,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1085#true} {1085#true} #79#return; {1085#true} is VALID [2018-11-14 18:26:31,901 INFO L256 TraceCheckUtils]: 4: Hoare triple {1085#true} call #t~ret9 := main(); {1085#true} is VALID [2018-11-14 18:26:31,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {1085#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1105#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:26:31,902 INFO L273 TraceCheckUtils]: 6: Hoare triple {1105#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1105#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:26:31,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {1105#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1112#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:26:31,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {1112#(= main_~i~0 (_ bv0 32))} assume true; {1112#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:26:31,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {1112#(= main_~i~0 (_ bv0 32))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1112#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:26:31,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {1112#(= main_~i~0 (_ bv0 32))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1112#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:26:31,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {1112#(= main_~i~0 (_ bv0 32))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {1112#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:26:31,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {1112#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(~i~0, 2bv32);call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5; {1112#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:26:31,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {1112#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvsub32(~i~0, 1bv32); {1131#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:26:31,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {1131#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume true; {1131#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:26:31,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {1131#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1138#(not |main_#t~short4|)} is VALID [2018-11-14 18:26:31,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {1138#(not |main_#t~short4|)} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1086#false} is VALID [2018-11-14 18:26:31,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {1086#false} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {1086#false} is VALID [2018-11-14 18:26:31,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {1086#false} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1086#false} is VALID [2018-11-14 18:26:31,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {1086#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1086#false} is VALID [2018-11-14 18:26:31,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {1086#false} assume true; {1086#false} is VALID [2018-11-14 18:26:31,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {1086#false} assume !~bvult32(~j~0, ~SIZE~0); {1086#false} is VALID [2018-11-14 18:26:31,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {1086#false} ~k~0 := 1bv32; {1086#false} is VALID [2018-11-14 18:26:31,911 INFO L273 TraceCheckUtils]: 23: Hoare triple {1086#false} assume true; {1086#false} is VALID [2018-11-14 18:26:31,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {1086#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1086#false} is VALID [2018-11-14 18:26:31,912 INFO L256 TraceCheckUtils]: 25: Hoare triple {1086#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1086#false} is VALID [2018-11-14 18:26:31,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {1086#false} ~cond := #in~cond; {1086#false} is VALID [2018-11-14 18:26:31,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {1086#false} assume ~cond == 0bv32; {1086#false} is VALID [2018-11-14 18:26:31,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2018-11-14 18:26:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:26:31,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:26:32,034 INFO L273 TraceCheckUtils]: 28: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2018-11-14 18:26:32,035 INFO L273 TraceCheckUtils]: 27: Hoare triple {1086#false} assume ~cond == 0bv32; {1086#false} is VALID [2018-11-14 18:26:32,035 INFO L273 TraceCheckUtils]: 26: Hoare triple {1086#false} ~cond := #in~cond; {1086#false} is VALID [2018-11-14 18:26:32,035 INFO L256 TraceCheckUtils]: 25: Hoare triple {1086#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1086#false} is VALID [2018-11-14 18:26:32,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {1086#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1086#false} is VALID [2018-11-14 18:26:32,036 INFO L273 TraceCheckUtils]: 23: Hoare triple {1086#false} assume true; {1086#false} is VALID [2018-11-14 18:26:32,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {1086#false} ~k~0 := 1bv32; {1086#false} is VALID [2018-11-14 18:26:32,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {1086#false} assume !~bvult32(~j~0, ~SIZE~0); {1086#false} is VALID [2018-11-14 18:26:32,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {1086#false} assume true; {1086#false} is VALID [2018-11-14 18:26:32,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {1086#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1086#false} is VALID [2018-11-14 18:26:32,037 INFO L273 TraceCheckUtils]: 18: Hoare triple {1086#false} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1086#false} is VALID [2018-11-14 18:26:32,037 INFO L273 TraceCheckUtils]: 17: Hoare triple {1086#false} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {1086#false} is VALID [2018-11-14 18:26:32,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {1138#(not |main_#t~short4|)} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1086#false} is VALID [2018-11-14 18:26:32,043 INFO L273 TraceCheckUtils]: 15: Hoare triple {1217#(not (bvsge main_~i~0 (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1138#(not |main_#t~short4|)} is VALID [2018-11-14 18:26:32,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {1217#(not (bvsge main_~i~0 (_ bv0 32)))} assume true; {1217#(not (bvsge main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 18:26:32,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvsub32(~i~0, 1bv32); {1217#(not (bvsge main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 18:26:32,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~i~0, 2bv32);call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5; {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:32,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:32,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:32,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:32,067 INFO L273 TraceCheckUtils]: 8: Hoare triple {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:32,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {1243#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1224#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:32,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {1243#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1243#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:32,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {1085#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1243#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:32,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {1085#true} call #t~ret9 := main(); {1085#true} is VALID [2018-11-14 18:26:32,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1085#true} {1085#true} #79#return; {1085#true} is VALID [2018-11-14 18:26:32,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {1085#true} assume true; {1085#true} is VALID [2018-11-14 18:26:32,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {1085#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1085#true} is VALID [2018-11-14 18:26:32,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2018-11-14 18:26:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:26:32,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:26:32,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-14 18:26:32,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-14 18:26:32,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:26:32,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:26:32,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:26:32,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:26:32,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:26:32,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:26:32,203 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 9 states. [2018-11-14 18:26:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:26:33,221 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2018-11-14 18:26:33,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:26:33,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-14 18:26:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:26:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:26:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2018-11-14 18:26:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:26:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2018-11-14 18:26:33,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 101 transitions. [2018-11-14 18:26:33,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:26:33,446 INFO L225 Difference]: With dead ends: 104 [2018-11-14 18:26:33,447 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 18:26:33,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:26:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 18:26:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 57. [2018-11-14 18:26:33,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:26:33,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 57 states. [2018-11-14 18:26:33,478 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 57 states. [2018-11-14 18:26:33,478 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 57 states. [2018-11-14 18:26:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:26:33,483 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-11-14 18:26:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2018-11-14 18:26:33,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:26:33,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:26:33,484 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 82 states. [2018-11-14 18:26:33,484 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 82 states. [2018-11-14 18:26:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:26:33,489 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-11-14 18:26:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2018-11-14 18:26:33,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:26:33,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:26:33,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:26:33,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:26:33,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 18:26:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-14 18:26:33,494 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 29 [2018-11-14 18:26:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:26:33,494 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-14 18:26:33,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:26:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-14 18:26:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:26:33,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:26:33,495 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:26:33,496 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:26:33,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:26:33,496 INFO L82 PathProgramCache]: Analyzing trace with hash -249426572, now seen corresponding path program 1 times [2018-11-14 18:26:33,496 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:26:33,497 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:26:33,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:26:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:26:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:26:33,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:26:33,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:33,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-11-14 18:26:33,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-11-14 18:26:33,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:38 [2018-11-14 18:26:33,920 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:26:34,038 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:34,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-11-14 18:26:34,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:34,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-14 18:26:34,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-11-14 18:26:34,111 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:26:34,244 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 26 treesize of output 18 [2018-11-14 18:26:34,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:34,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-11-14 18:26:34,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-14 18:26:34,275 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:26:34,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {1647#true} call ULTIMATE.init(); {1647#true} is VALID [2018-11-14 18:26:34,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {1647#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1647#true} is VALID [2018-11-14 18:26:34,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {1647#true} assume true; {1647#true} is VALID [2018-11-14 18:26:34,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1647#true} {1647#true} #79#return; {1647#true} is VALID [2018-11-14 18:26:34,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {1647#true} call #t~ret9 := main(); {1647#true} is VALID [2018-11-14 18:26:34,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {1647#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1667#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {1667#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {1667#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {1667#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1674#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {1674#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {1674#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {1674#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1674#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {1674#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1684#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {1684#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {1688#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {1688#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume ~bvslt32(~i~0, 2bv32);call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5; {1692#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {1692#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} ~i~0 := ~bvsub32(~i~0, 1bv32); {1696#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {1696#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {1696#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {1696#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1696#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {1696#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4; {1696#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {1696#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {1696#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {1696#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1712#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {1712#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1712#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {1712#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {1712#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {1712#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !~bvult32(~j~0, ~SIZE~0); {1712#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {1712#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} ~k~0 := 1bv32; {1725#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,418 INFO L273 TraceCheckUtils]: 23: Hoare triple {1725#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {1725#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:26:34,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {1725#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1732#(bvsgt |main_#t~mem8| |main_#t~mem7|)} is VALID [2018-11-14 18:26:34,431 INFO L256 TraceCheckUtils]: 25: Hoare triple {1732#(bvsgt |main_#t~mem8| |main_#t~mem7|)} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1736#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:26:34,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {1736#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1740#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:26:34,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {1740#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1648#false} is VALID [2018-11-14 18:26:34,433 INFO L273 TraceCheckUtils]: 28: Hoare triple {1648#false} assume !false; {1648#false} is VALID [2018-11-14 18:26:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:26:34,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:26:35,504 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 99 treesize of output 83 [2018-11-14 18:26:35,516 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:35,516 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:35,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:35,524 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:35,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 100 [2018-11-14 18:26:44,133 WARN L179 SmtUtils]: Spent 8.46 s on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-11-14 18:26:44,150 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,151 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,151 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,154 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,154 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,167 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 81 [2018-11-14 18:26:44,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 18:26:44,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,231 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:44,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 84 [2018-11-14 18:26:44,284 INFO L267 ElimStorePlain]: Start of recursive call 5: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-14 18:26:46,385 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:46,404 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:48,575 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#v~0.offset| (bvmul (_ bv4 32) main_~j~0)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-14 18:26:48,578 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:50,695 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-14 18:26:50,696 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:50,697 INFO L303 Elim1Store]: Index analysis took 6408 ms [2018-11-14 18:26:50,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2018-11-14 18:26:50,720 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:52,879 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:55,001 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#v~0.offset| (bvmul (_ bv4 32) main_~j~0)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-14 18:26:55,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:55,003 INFO L303 Elim1Store]: Index analysis took 4254 ms [2018-11-14 18:26:55,004 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 47 treesize of output 43 [2018-11-14 18:26:55,007 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:55,014 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:55,015 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:55,016 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:55,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-11-14 18:26:55,029 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:55,037 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:55,038 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:57,043 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#v~0.offset| (bvmul (_ bv4 32) main_~j~0)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-14 18:26:59,052 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-14 18:26:59,054 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:59,064 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:59,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:59,074 INFO L303 Elim1Store]: Index analysis took 4041 ms [2018-11-14 18:26:59,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 74 [2018-11-14 18:26:59,104 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-14 18:27:01,284 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#v~0.offset| (_ bv4 32)) (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-14 18:27:01,299 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:03,306 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#v~0.offset| (bvmul (_ bv4 32) main_~j~0)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-14 18:27:05,317 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-14 18:27:05,320 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:05,336 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:05,340 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:05,349 INFO L303 Elim1Store]: Index analysis took 6241 ms [2018-11-14 18:27:05,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 72 [2018-11-14 18:27:05,398 INFO L267 ElimStorePlain]: Start of recursive call 10: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-14 18:27:06,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-11-14 18:27:06,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:06,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:06,308 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:99, output treesize:8 [2018-11-14 18:27:06,317 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:27:06,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {1648#false} assume !false; {1648#false} is VALID [2018-11-14 18:27:06,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {1750#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1648#false} is VALID [2018-11-14 18:27:06,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {1754#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1750#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:27:06,381 INFO L256 TraceCheckUtils]: 25: Hoare triple {1758#(bvsle |main_#t~mem7| |main_#t~mem8|)} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1754#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:27:06,385 INFO L273 TraceCheckUtils]: 24: Hoare triple {1762#(bvsle (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1758#(bvsle |main_#t~mem7| |main_#t~mem8|)} is VALID [2018-11-14 18:27:06,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {1762#(bvsle (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|)))} assume true; {1762#(bvsle (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|)))} is VALID [2018-11-14 18:27:06,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {1769#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} ~k~0 := 1bv32; {1762#(bvsle (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|)))} is VALID [2018-11-14 18:27:06,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {1769#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} assume !~bvult32(~j~0, ~SIZE~0); {1769#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {1769#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} assume true; {1769#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {1769#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1769#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {1782#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1769#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {1782#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {1782#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {1782#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} assume !#t~short4; {1782#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {1782#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1782#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {1782#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} assume true; {1782#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {1798#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} ~i~0 := ~bvsub32(~i~0, 1bv32); {1782#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {1802#(bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} assume ~bvslt32(~i~0, 2bv32);call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5; {1798#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {1806#(or (not |main_#t~short4|) (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {1802#(bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-14 18:27:06,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {1810#(or (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1806#(or (not |main_#t~short4|) (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 18:27:06,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {1810#(or (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1810#(or (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-14 18:27:06,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {1810#(or (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} assume true; {1810#(or (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-14 18:27:06,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {1820#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1810#(or (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-14 18:27:06,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {1820#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} assume true; {1820#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} is VALID [2018-11-14 18:27:06,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {1647#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1820#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} is VALID [2018-11-14 18:27:06,612 INFO L256 TraceCheckUtils]: 4: Hoare triple {1647#true} call #t~ret9 := main(); {1647#true} is VALID [2018-11-14 18:27:06,612 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1647#true} {1647#true} #79#return; {1647#true} is VALID [2018-11-14 18:27:06,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {1647#true} assume true; {1647#true} is VALID [2018-11-14 18:27:06,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {1647#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1647#true} is VALID [2018-11-14 18:27:06,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {1647#true} call ULTIMATE.init(); {1647#true} is VALID [2018-11-14 18:27:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:27:06,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:27:06,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 18:27:06,618 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-11-14 18:27:06,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:27:06,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:27:06,943 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:27:06,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:27:06,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:27:06,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:27:06,944 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 24 states. [2018-11-14 18:27:10,135 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-14 18:27:10,889 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-11-14 18:27:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:21,745 INFO L93 Difference]: Finished difference Result 172 states and 207 transitions. [2018-11-14 18:27:21,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 18:27:21,745 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-11-14 18:27:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:27:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:27:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 163 transitions. [2018-11-14 18:27:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:27:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 163 transitions. [2018-11-14 18:27:21,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 163 transitions. [2018-11-14 18:27:24,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 162 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:24,887 INFO L225 Difference]: With dead ends: 172 [2018-11-14 18:27:24,888 INFO L226 Difference]: Without dead ends: 170 [2018-11-14 18:27:24,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=298, Invalid=1958, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 18:27:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-14 18:27:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 57. [2018-11-14 18:27:24,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:27:24,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 57 states. [2018-11-14 18:27:24,938 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 57 states. [2018-11-14 18:27:24,938 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 57 states. [2018-11-14 18:27:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:24,946 INFO L93 Difference]: Finished difference Result 170 states and 205 transitions. [2018-11-14 18:27:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 205 transitions. [2018-11-14 18:27:24,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:24,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:24,948 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 170 states. [2018-11-14 18:27:24,948 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 170 states. [2018-11-14 18:27:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:24,955 INFO L93 Difference]: Finished difference Result 170 states and 205 transitions. [2018-11-14 18:27:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 205 transitions. [2018-11-14 18:27:24,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:24,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:24,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:27:24,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:27:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 18:27:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-14 18:27:24,959 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 29 [2018-11-14 18:27:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:27:24,959 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-14 18:27:24,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:27:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-14 18:27:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:27:24,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:27:24,961 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:27:24,961 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:27:24,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:27:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash -853417747, now seen corresponding path program 1 times [2018-11-14 18:27:24,962 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:27:24,962 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:27:24,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:27:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:25,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:27:25,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2018-11-14 18:27:25,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {2525#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2525#true} is VALID [2018-11-14 18:27:25,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2018-11-14 18:27:25,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #79#return; {2525#true} is VALID [2018-11-14 18:27:25,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret9 := main(); {2525#true} is VALID [2018-11-14 18:27:25,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {2525#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {2545#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:25,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {2545#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2545#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:25,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {2545#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,228 INFO L273 TraceCheckUtils]: 9: Hoare triple {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {2552#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2571#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {2571#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} assume true; {2571#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {2571#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} assume !~bvult32(~j~0, ~SIZE~0); {2578#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)))} is VALID [2018-11-14 18:27:25,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {2578#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)))} ~k~0 := 1bv32; {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,241 INFO L273 TraceCheckUtils]: 17: Hoare triple {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,241 INFO L273 TraceCheckUtils]: 18: Hoare triple {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,242 INFO L256 TraceCheckUtils]: 19: Hoare triple {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {2525#true} is VALID [2018-11-14 18:27:25,242 INFO L273 TraceCheckUtils]: 20: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2018-11-14 18:27:25,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {2525#true} assume !(~cond == 0bv32); {2525#true} is VALID [2018-11-14 18:27:25,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {2525#true} assume true; {2525#true} is VALID [2018-11-14 18:27:25,243 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2525#true} {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #83#return; {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem7;havoc #t~mem8; {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:25,245 INFO L273 TraceCheckUtils]: 25: Hoare triple {2582#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2610#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-14 18:27:25,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {2610#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} assume true; {2610#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-14 18:27:25,247 INFO L273 TraceCheckUtils]: 27: Hoare triple {2610#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {2526#false} is VALID [2018-11-14 18:27:25,247 INFO L256 TraceCheckUtils]: 28: Hoare triple {2526#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {2526#false} is VALID [2018-11-14 18:27:25,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {2526#false} ~cond := #in~cond; {2526#false} is VALID [2018-11-14 18:27:25,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {2526#false} assume ~cond == 0bv32; {2526#false} is VALID [2018-11-14 18:27:25,248 INFO L273 TraceCheckUtils]: 31: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2018-11-14 18:27:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:27:25,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:27:25,528 INFO L273 TraceCheckUtils]: 31: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2018-11-14 18:27:25,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {2526#false} assume ~cond == 0bv32; {2526#false} is VALID [2018-11-14 18:27:25,528 INFO L273 TraceCheckUtils]: 29: Hoare triple {2526#false} ~cond := #in~cond; {2526#false} is VALID [2018-11-14 18:27:25,528 INFO L256 TraceCheckUtils]: 28: Hoare triple {2526#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {2526#false} is VALID [2018-11-14 18:27:25,529 INFO L273 TraceCheckUtils]: 27: Hoare triple {2641#(not (bvult main_~k~0 main_~SIZE~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {2526#false} is VALID [2018-11-14 18:27:25,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {2641#(not (bvult main_~k~0 main_~SIZE~0))} assume true; {2641#(not (bvult main_~k~0 main_~SIZE~0))} is VALID [2018-11-14 18:27:25,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2641#(not (bvult main_~k~0 main_~SIZE~0))} is VALID [2018-11-14 18:27:25,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} havoc #t~mem7;havoc #t~mem8; {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,531 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2525#true} {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} #83#return; {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,531 INFO L273 TraceCheckUtils]: 22: Hoare triple {2525#true} assume true; {2525#true} is VALID [2018-11-14 18:27:25,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {2525#true} assume !(~cond == 0bv32); {2525#true} is VALID [2018-11-14 18:27:25,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2018-11-14 18:27:25,532 INFO L256 TraceCheckUtils]: 19: Hoare triple {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {2525#true} is VALID [2018-11-14 18:27:25,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} assume true; {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {2676#(not (bvult (_ bv2 32) main_~SIZE~0))} ~k~0 := 1bv32; {2648#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {2680#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} assume !~bvult32(~j~0, ~SIZE~0); {2676#(not (bvult (_ bv2 32) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {2680#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} assume true; {2680#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} is VALID [2018-11-14 18:27:25,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2680#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} is VALID [2018-11-14 18:27:25,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} #t~short4 := ~bvsge32(~i~0, 0bv32); {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} assume true; {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {2706#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {2687#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 18:27:25,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {2706#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} assume true; {2706#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} is VALID [2018-11-14 18:27:25,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {2525#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {2706#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} is VALID [2018-11-14 18:27:25,550 INFO L256 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret9 := main(); {2525#true} is VALID [2018-11-14 18:27:25,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #79#return; {2525#true} is VALID [2018-11-14 18:27:25,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2018-11-14 18:27:25,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {2525#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2525#true} is VALID [2018-11-14 18:27:25,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2018-11-14 18:27:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:27:25,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:27:25,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 18:27:25,561 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-14 18:27:25,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:27:25,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:27:25,720 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:27:25,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:27:25,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:27:25,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:27:25,721 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 14 states. [2018-11-14 18:27:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:26,905 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2018-11-14 18:27:26,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:27:26,905 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-14 18:27:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:27:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:27:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2018-11-14 18:27:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:27:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2018-11-14 18:27:26,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 78 transitions. [2018-11-14 18:27:27,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:27,143 INFO L225 Difference]: With dead ends: 97 [2018-11-14 18:27:27,144 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 18:27:27,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:27:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 18:27:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2018-11-14 18:27:27,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:27:27,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 62 states. [2018-11-14 18:27:27,200 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 62 states. [2018-11-14 18:27:27,200 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 62 states. [2018-11-14 18:27:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:27,205 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-11-14 18:27:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2018-11-14 18:27:27,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:27,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:27,205 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 78 states. [2018-11-14 18:27:27,206 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 78 states. [2018-11-14 18:27:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:27,208 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-11-14 18:27:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2018-11-14 18:27:27,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:27,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:27,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:27:27,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:27:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 18:27:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-11-14 18:27:27,211 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 32 [2018-11-14 18:27:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:27:27,212 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-11-14 18:27:27,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:27:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-14 18:27:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 18:27:27,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:27:27,213 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:27:27,213 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:27:27,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:27:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash -289889213, now seen corresponding path program 2 times [2018-11-14 18:27:27,214 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:27:27,214 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:27:27,233 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:27:27,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:27:27,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:27:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:27,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:27:27,508 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 15 treesize of output 12 [2018-11-14 18:27:27,514 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 12 treesize of output 11 [2018-11-14 18:27:27,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:27,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:27,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:27,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-14 18:27:27,553 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:27:27,786 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-14 18:27:27,958 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 34 treesize of output 27 [2018-11-14 18:27:27,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:27:27,966 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:27,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-11-14 18:27:27,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:27,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:28,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:27:28,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:32 [2018-11-14 18:27:28,027 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:27:28,509 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-11-14 18:27:28,626 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 37 treesize of output 28 [2018-11-14 18:27:28,640 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:27:28,644 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:27:28,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:27:28,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-11-14 18:27:28,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:28,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:28,713 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:27:28,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2018-11-14 18:27:28,731 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:27:28,943 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 34 treesize of output 24 [2018-11-14 18:27:28,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2018-11-14 18:27:28,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:28,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:28,973 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:27:28,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:8 [2018-11-14 18:27:28,982 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:27:29,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {3095#true} call ULTIMATE.init(); {3095#true} is VALID [2018-11-14 18:27:29,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {3095#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3095#true} is VALID [2018-11-14 18:27:29,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {3095#true} assume true; {3095#true} is VALID [2018-11-14 18:27:29,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3095#true} {3095#true} #79#return; {3095#true} is VALID [2018-11-14 18:27:29,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {3095#true} call #t~ret9 := main(); {3095#true} is VALID [2018-11-14 18:27:29,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {3095#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {3115#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {3115#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {3115#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {3115#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {3122#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {3122#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {3122#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {3122#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {3122#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,122 INFO L273 TraceCheckUtils]: 10: Hoare triple {3122#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {3122#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {3122#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {3122#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {3122#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {3115#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {3115#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3141#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {3141#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {3141#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,126 INFO L273 TraceCheckUtils]: 15: Hoare triple {3141#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {3148#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:29,127 INFO L273 TraceCheckUtils]: 16: Hoare triple {3148#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3148#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:29,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {3148#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {3148#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:29,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {3148#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {3158#(or (and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:27:29,141 INFO L273 TraceCheckUtils]: 19: Hoare triple {3158#(or (and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {3162#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:29,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {3162#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~i~0, 2bv32);call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5; {3166#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:27:29,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {3166#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvsub32(~i~0, 1bv32); {3170#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {3170#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {3170#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {3170#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {3170#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:27:29,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {3170#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {3180#(or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) |main_#t~short4| (= |main_~#v~0.offset| (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0))))} is VALID [2018-11-14 18:27:29,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {3180#(or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) |main_#t~short4| (= |main_~#v~0.offset| (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0))))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {3184#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-14 18:27:29,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {3184#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {3188#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:27:29,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {3188#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3188#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:27:29,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {3188#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume true; {3188#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:27:29,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {3188#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !~bvult32(~j~0, ~SIZE~0); {3188#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:27:29,200 INFO L273 TraceCheckUtils]: 30: Hoare triple {3188#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} ~k~0 := 1bv32; {3201#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:27:29,201 INFO L273 TraceCheckUtils]: 31: Hoare triple {3201#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume true; {3201#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 18:27:29,222 INFO L273 TraceCheckUtils]: 32: Hoare triple {3201#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {3208#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| |main_#t~mem8|)) (not (bvsgt |main_#t~mem7| |main_#t~mem8|)))} is VALID [2018-11-14 18:27:29,224 INFO L256 TraceCheckUtils]: 33: Hoare triple {3208#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| |main_#t~mem8|)) (not (bvsgt |main_#t~mem7| |main_#t~mem8|)))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {3212#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:29,224 INFO L273 TraceCheckUtils]: 34: Hoare triple {3212#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3216#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:29,225 INFO L273 TraceCheckUtils]: 35: Hoare triple {3216#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {3096#false} is VALID [2018-11-14 18:27:29,225 INFO L273 TraceCheckUtils]: 36: Hoare triple {3096#false} assume !false; {3096#false} is VALID [2018-11-14 18:27:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:27:29,232 INFO L316 TraceCheckSpWp]: Computing backward predicates...