java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-tiling/rew_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:29:35,044 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:29:35,046 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:29:35,059 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:29:35,059 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:29:35,060 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:29:35,061 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:29:35,063 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:29:35,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:29:35,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:29:35,067 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:29:35,067 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:29:35,068 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:29:35,070 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:29:35,071 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:29:35,071 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:29:35,072 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:29:35,074 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:29:35,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:29:35,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:29:35,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:29:35,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:29:35,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:29:35,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:29:35,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:29:35,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:29:35,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:29:35,087 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:29:35,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:29:35,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:29:35,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:29:35,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:29:35,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:29:35,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:29:35,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:29:35,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:29:35,092 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:29:35,121 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:29:35,123 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:29:35,123 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:29:35,124 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:29:35,124 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:29:35,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:29:35,126 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:29:35,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:29:35,126 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:29:35,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:29:35,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:29:35,127 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:29:35,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:29:35,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:29:35,127 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:29:35,127 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:29:35,127 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:29:35,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:29:35,128 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:29:35,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:29:35,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:29:35,129 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:29:35,129 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:29:35,129 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:29:35,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:29:35,130 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:29:35,130 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:29:35,130 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:29:35,131 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:29:35,131 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:29:35,131 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:29:35,131 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:29:35,131 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:29:35,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:29:35,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:29:35,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:29:35,211 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:29:35,212 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:29:35,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rew_true-unreach-call.i [2018-11-23 10:29:35,282 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a5d81f2/8cb4189cc8374d7e8827f1edc34cab2d/FLAGca4bcc6d6 [2018-11-23 10:29:35,731 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:29:35,732 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rew_true-unreach-call.i [2018-11-23 10:29:35,738 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a5d81f2/8cb4189cc8374d7e8827f1edc34cab2d/FLAGca4bcc6d6 [2018-11-23 10:29:36,086 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a5d81f2/8cb4189cc8374d7e8827f1edc34cab2d [2018-11-23 10:29:36,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:29:36,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:29:36,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:29:36,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:29:36,104 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:29:36,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fef57ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36, skipping insertion in model container [2018-11-23 10:29:36,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:29:36,152 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:29:36,414 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:29:36,420 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:29:36,448 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:29:36,475 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:29:36,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36 WrapperNode [2018-11-23 10:29:36,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:29:36,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:29:36,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:29:36,478 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:29:36,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:29:36,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:29:36,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:29:36,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:29:36,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (1/1) ... [2018-11-23 10:29:36,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:29:36,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:29:36,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:29:36,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:29:36,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:29:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:29:36,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:29:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:29:36,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:29:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:29:36,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:29:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:29:36,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:29:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:29:36,672 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:29:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:29:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:29:37,303 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:29:37,303 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:29:37,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:37 BoogieIcfgContainer [2018-11-23 10:29:37,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:29:37,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:29:37,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:29:37,309 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:29:37,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:29:36" (1/3) ... [2018-11-23 10:29:37,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144697e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:37, skipping insertion in model container [2018-11-23 10:29:37,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:36" (2/3) ... [2018-11-23 10:29:37,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144697e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:37, skipping insertion in model container [2018-11-23 10:29:37,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:37" (3/3) ... [2018-11-23 10:29:37,313 INFO L112 eAbstractionObserver]: Analyzing ICFG rew_true-unreach-call.i [2018-11-23 10:29:37,323 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:29:37,332 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:29:37,352 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:29:37,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:29:37,389 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:29:37,389 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:29:37,389 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:29:37,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:29:37,390 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:29:37,390 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:29:37,390 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:29:37,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:29:37,410 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 10:29:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:29:37,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:37,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:37,421 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:37,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:37,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1204506220, now seen corresponding path program 1 times [2018-11-23 10:29:37,434 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:37,435 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-23 10:29:37,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:37,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:37,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 10:29:37,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {31#true} is VALID [2018-11-23 10:29:37,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 10:29:37,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #63#return; {31#true} is VALID [2018-11-23 10:29:37,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2018-11-23 10:29:37,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {31#true} is VALID [2018-11-23 10:29:37,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {31#true} is VALID [2018-11-23 10:29:37,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 10:29:37,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} ~i~0 := 0bv32; {32#false} is VALID [2018-11-23 10:29:37,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {32#false} is VALID [2018-11-23 10:29:37,653 INFO L256 TraceCheckUtils]: 10: Hoare triple {32#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {32#false} is VALID [2018-11-23 10:29:37,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-23 10:29:37,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume 0bv32 == ~cond; {32#false} is VALID [2018-11-23 10:29:37,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 10:29:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:37,657 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:29:37,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:29:37,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:29:37,670 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:29:37,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:37,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:29:37,836 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-23 10:29:37,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:29:37,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:29:37,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:29:37,851 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 10:29:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:38,164 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-23 10:29:38,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:29:38,165 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:29:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:29:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 10:29:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:29:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 10:29:38,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-23 10:29:38,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:38,447 INFO L225 Difference]: With dead ends: 45 [2018-11-23 10:29:38,448 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 10:29:38,451 INFO L631 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-23 10:29:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 10:29:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 10:29:38,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:38,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 10:29:38,497 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:29:38,498 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:29:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:38,502 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 10:29:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 10:29:38,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:38,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:38,504 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:29:38,504 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:29:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:38,508 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 10:29:38,508 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 10:29:38,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:38,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:38,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:38,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:29:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 10:29:38,514 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2018-11-23 10:29:38,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:38,515 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 10:29:38,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:29:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 10:29:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:29:38,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:38,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:38,517 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:38,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 142847815, now seen corresponding path program 1 times [2018-11-23 10:29:38,518 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:38,518 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-23 10:29:38,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:38,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:38,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-23 10:29:38,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {204#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {204#true} is VALID [2018-11-23 10:29:38,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 10:29:38,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #63#return; {204#true} is VALID [2018-11-23 10:29:38,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret5 := main(); {204#true} is VALID [2018-11-23 10:29:38,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {204#true} is VALID [2018-11-23 10:29:38,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {204#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {227#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:38,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {227#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {205#false} is VALID [2018-11-23 10:29:38,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {205#false} ~i~0 := 0bv32; {205#false} is VALID [2018-11-23 10:29:38,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {205#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {205#false} is VALID [2018-11-23 10:29:38,684 INFO L256 TraceCheckUtils]: 10: Hoare triple {205#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {205#false} is VALID [2018-11-23 10:29:38,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {205#false} ~cond := #in~cond; {205#false} is VALID [2018-11-23 10:29:38,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {205#false} assume 0bv32 == ~cond; {205#false} is VALID [2018-11-23 10:29:38,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-23 10:29:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:38,687 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:29:38,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:29:38,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:29:38,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:29:38,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:38,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:29:38,721 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-23 10:29:38,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:29:38,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:29:38,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:29:38,722 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-23 10:29:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:39,232 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 10:29:39,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:29:39,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:29:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:29:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 10:29:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:29:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 10:29:39,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-23 10:29:39,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:39,458 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:29:39,458 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 10:29:39,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:29:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 10:29:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 10:29:39,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:39,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 10:29:39,470 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 10:29:39,470 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 10:29:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:39,472 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 10:29:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 10:29:39,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:39,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:39,474 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 10:29:39,474 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 10:29:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:39,476 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 10:29:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 10:29:39,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:39,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:39,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:39,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:29:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 10:29:39,480 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2018-11-23 10:29:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:39,481 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 10:29:39,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:29:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 10:29:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:29:39,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:39,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:39,483 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:39,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:39,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1002652542, now seen corresponding path program 1 times [2018-11-23 10:29:39,484 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:39,484 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-23 10:29:39,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:39,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:39,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {387#true} call ULTIMATE.init(); {387#true} is VALID [2018-11-23 10:29:39,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {387#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {387#true} is VALID [2018-11-23 10:29:39,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {387#true} assume true; {387#true} is VALID [2018-11-23 10:29:39,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {387#true} {387#true} #63#return; {387#true} is VALID [2018-11-23 10:29:39,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {387#true} call #t~ret5 := main(); {387#true} is VALID [2018-11-23 10:29:39,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {387#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {387#true} is VALID [2018-11-23 10:29:39,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {387#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {410#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:39,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {410#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:39,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {410#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {410#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:39,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {410#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {410#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:39,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {410#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {423#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:39,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {423#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {388#false} is VALID [2018-11-23 10:29:39,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {388#false} ~i~0 := 0bv32; {388#false} is VALID [2018-11-23 10:29:39,710 INFO L273 TraceCheckUtils]: 13: Hoare triple {388#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {388#false} is VALID [2018-11-23 10:29:39,711 INFO L256 TraceCheckUtils]: 14: Hoare triple {388#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {388#false} is VALID [2018-11-23 10:29:39,711 INFO L273 TraceCheckUtils]: 15: Hoare triple {388#false} ~cond := #in~cond; {388#false} is VALID [2018-11-23 10:29:39,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {388#false} assume 0bv32 == ~cond; {388#false} is VALID [2018-11-23 10:29:39,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {388#false} assume !false; {388#false} is VALID [2018-11-23 10:29:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:39,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:39,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {388#false} assume !false; {388#false} is VALID [2018-11-23 10:29:39,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {388#false} assume 0bv32 == ~cond; {388#false} is VALID [2018-11-23 10:29:39,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {388#false} ~cond := #in~cond; {388#false} is VALID [2018-11-23 10:29:39,905 INFO L256 TraceCheckUtils]: 14: Hoare triple {388#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {388#false} is VALID [2018-11-23 10:29:39,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {388#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {388#false} is VALID [2018-11-23 10:29:39,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {388#false} ~i~0 := 0bv32; {388#false} is VALID [2018-11-23 10:29:39,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {463#(bvslt main_~i~0 ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {388#false} is VALID [2018-11-23 10:29:39,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {463#(bvslt main_~i~0 ~SIZE~0)} is VALID [2018-11-23 10:29:39,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {467#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {467#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:29:39,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {467#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {467#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:29:39,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {467#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {467#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:29:39,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {387#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {467#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:29:39,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {387#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {387#true} is VALID [2018-11-23 10:29:39,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {387#true} call #t~ret5 := main(); {387#true} is VALID [2018-11-23 10:29:39,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {387#true} {387#true} #63#return; {387#true} is VALID [2018-11-23 10:29:39,919 INFO L273 TraceCheckUtils]: 2: Hoare triple {387#true} assume true; {387#true} is VALID [2018-11-23 10:29:39,919 INFO L273 TraceCheckUtils]: 1: Hoare triple {387#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {387#true} is VALID [2018-11-23 10:29:39,919 INFO L256 TraceCheckUtils]: 0: Hoare triple {387#true} call ULTIMATE.init(); {387#true} is VALID [2018-11-23 10:29:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:39,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:39,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:29:39,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 10:29:39,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:39,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:29:39,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:39,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:29:39,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:29:39,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:29:39,992 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2018-11-23 10:29:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:40,531 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 10:29:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:29:40,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 10:29:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:29:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2018-11-23 10:29:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:29:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2018-11-23 10:29:40,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2018-11-23 10:29:40,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:40,649 INFO L225 Difference]: With dead ends: 46 [2018-11-23 10:29:40,650 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 10:29:40,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:29:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 10:29:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-11-23 10:29:40,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:40,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 27 states. [2018-11-23 10:29:40,663 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 27 states. [2018-11-23 10:29:40,663 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 27 states. [2018-11-23 10:29:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:40,666 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 10:29:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 10:29:40,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:40,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:40,668 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 35 states. [2018-11-23 10:29:40,668 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 35 states. [2018-11-23 10:29:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:40,671 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 10:29:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 10:29:40,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:40,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:40,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:40,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:29:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 10:29:40,674 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-23 10:29:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:40,675 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 10:29:40,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:29:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 10:29:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:29:40,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:40,676 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:40,676 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:40,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:40,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1636198789, now seen corresponding path program 1 times [2018-11-23 10:29:40,677 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:40,677 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-23 10:29:40,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:40,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:40,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 10:29:40,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 10:29:40,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:40,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:40,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:40,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-23 10:29:41,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 10:29:41,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:41,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 10:29:41,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:41,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:41,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:41,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-23 10:29:41,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-23 10:29:41,546 INFO L478 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 20 treesize of output 5 [2018-11-23 10:29:41,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:41,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:41,637 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-23 10:29:41,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-11-23 10:29:41,641 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:41,641 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse1 (select .cse0 (_ bv0 32)))) (and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select .cse0 (_ bv4 32)) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd .cse1 (_ bv4294967293 32)) (_ bv0 32)) (= .cse1 |main_#t~mem4|)))) [2018-11-23 10:29:41,642 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (bvadd |main_#t~mem4| (_ bv4294967293 32)))) [2018-11-23 10:29:41,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {671#true} call ULTIMATE.init(); {671#true} is VALID [2018-11-23 10:29:41,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {671#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {671#true} is VALID [2018-11-23 10:29:41,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {671#true} assume true; {671#true} is VALID [2018-11-23 10:29:41,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {671#true} {671#true} #63#return; {671#true} is VALID [2018-11-23 10:29:41,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {671#true} call #t~ret5 := main(); {671#true} is VALID [2018-11-23 10:29:41,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {671#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {671#true} is VALID [2018-11-23 10:29:41,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {671#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {694#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:41,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {694#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {694#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:41,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {694#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {694#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:41,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {694#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {704#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:41,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {704#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {708#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:41,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {708#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {708#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:41,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0); {708#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:41,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {718#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:29:41,757 INFO L273 TraceCheckUtils]: 14: Hoare triple {718#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {718#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:29:41,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {718#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {718#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:29:41,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {718#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {728#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:41,760 INFO L273 TraceCheckUtils]: 17: Hoare triple {728#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {732#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) |main_#t~mem4|))} is VALID [2018-11-23 10:29:41,762 INFO L256 TraceCheckUtils]: 18: Hoare triple {732#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) |main_#t~mem4|))} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {736#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:41,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {736#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {740#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:41,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {740#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {672#false} is VALID [2018-11-23 10:29:41,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {672#false} assume !false; {672#false} is VALID [2018-11-23 10:29:41,769 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-23 10:29:41,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:42,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 10:29:42,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 10:29:42,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-11-23 10:29:42,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:42,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-11-23 10:29:42,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:29:42,258 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:29:42,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:29:42,362 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 2 xjuncts. [2018-11-23 10:29:42,362 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2018-11-23 10:29:42,379 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:42,380 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (bvsge (select (let ((.cse0 (bvmul (_ bv4 32) main_~i~0))) (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| .cse0) main_~val2~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv4 32)) main_~val2~0)) |main_~#a~0.offset|) main_~low~0) [2018-11-23 10:29:42,380 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_arrayElimCell_5]. (and (let ((.cse0 (bvmul (_ bv4 32) main_~i~0))) (or (bvsge v_arrayElimCell_5 main_~low~0) (= (bvadd .cse0 (_ bv4 32)) (_ bv0 32)) (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse0)))) (bvsge main_~val2~0 main_~low~0)) [2018-11-23 10:29:42,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {672#false} assume !false; {672#false} is VALID [2018-11-23 10:29:42,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {750#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {672#false} is VALID [2018-11-23 10:29:42,543 INFO L273 TraceCheckUtils]: 19: Hoare triple {754#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {750#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:29:42,545 INFO L256 TraceCheckUtils]: 18: Hoare triple {758#(bvsge |main_#t~mem4| main_~low~0)} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {754#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:29:42,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {762#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {758#(bvsge |main_#t~mem4| main_~low~0)} is VALID [2018-11-23 10:29:42,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} ~i~0 := 0bv32; {762#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) main_~low~0)} is VALID [2018-11-23 10:29:42,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} assume !~bvslt32(~i~0, ~SIZE~0); {766#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:42,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {766#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:42,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {776#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {766#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:42,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {776#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} assume !~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0); {776#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:42,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {776#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {776#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:42,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {786#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {776#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:42,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {790#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_5 (_ BitVec 32))) (bvsge v_arrayElimCell_5 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {786#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:42,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {790#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_5 (_ BitVec 32))) (bvsge v_arrayElimCell_5 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {790#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_5 (_ BitVec 32))) (bvsge v_arrayElimCell_5 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:29:42,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {790#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_5 (_ BitVec 32))) (bvsge v_arrayElimCell_5 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {790#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_5 (_ BitVec 32))) (bvsge v_arrayElimCell_5 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:29:42,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {671#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {790#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_5 (_ BitVec 32))) (bvsge v_arrayElimCell_5 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:29:42,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {671#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {671#true} is VALID [2018-11-23 10:29:42,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {671#true} call #t~ret5 := main(); {671#true} is VALID [2018-11-23 10:29:42,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {671#true} {671#true} #63#return; {671#true} is VALID [2018-11-23 10:29:42,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {671#true} assume true; {671#true} is VALID [2018-11-23 10:29:42,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {671#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {671#true} is VALID [2018-11-23 10:29:42,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {671#true} call ULTIMATE.init(); {671#true} is VALID [2018-11-23 10:29:42,619 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-23 10:29:42,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:42,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 10:29:42,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-11-23 10:29:42,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:42,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 10:29:42,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:42,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 10:29:42,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 10:29:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-23 10:29:42,762 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 18 states. [2018-11-23 10:29:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:47,933 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-23 10:29:47,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 10:29:47,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-11-23 10:29:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 10:29:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 94 transitions. [2018-11-23 10:29:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 10:29:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 94 transitions. [2018-11-23 10:29:47,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 94 transitions. [2018-11-23 10:29:50,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:50,359 INFO L225 Difference]: With dead ends: 85 [2018-11-23 10:29:50,359 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 10:29:50,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2018-11-23 10:29:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 10:29:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2018-11-23 10:29:50,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:50,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 57 states. [2018-11-23 10:29:50,485 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 57 states. [2018-11-23 10:29:50,485 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 57 states. [2018-11-23 10:29:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:50,493 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-11-23 10:29:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2018-11-23 10:29:50,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:50,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:50,495 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 83 states. [2018-11-23 10:29:50,495 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 83 states. [2018-11-23 10:29:50,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:50,501 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-11-23 10:29:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2018-11-23 10:29:50,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:50,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:50,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:50,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 10:29:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-23 10:29:50,506 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 22 [2018-11-23 10:29:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:50,506 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-23 10:29:50,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 10:29:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 10:29:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:29:50,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:50,511 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:50,511 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:50,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:50,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1000651407, now seen corresponding path program 2 times [2018-11-23 10:29:50,512 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:50,512 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-23 10:29:50,530 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:29:50,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:29:50,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:29:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:50,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:50,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 10:29:50,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 10:29:50,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:50,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:50,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:50,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-23 10:29:50,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 10:29:50,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:50,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-23 10:29:50,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:50,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:50,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:50,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-11-23 10:29:51,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-23 10:29:51,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-11-23 10:29:51,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:51,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:51,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:51,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2018-11-23 10:29:51,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-11-23 10:29:51,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 106 [2018-11-23 10:29:51,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:51,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:51,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:51,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-11-23 10:29:51,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2018-11-23 10:29:51,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:51,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 109 [2018-11-23 10:29:51,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:51,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:51,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:51,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:47 [2018-11-23 10:29:51,941 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:51,941 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|]. (let ((.cse1 (bvmul (_ bv4 32) main_~i~0))) (let ((.cse2 (bvadd |main_~#a~0.offset| .cse1)) (.cse0 (select |v_#memory_int_19| |main_~#a~0.base|))) (and (= main_~val2~0 (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967292 32)))) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (store |v_#memory_int_19| |main_~#a~0.base| (store .cse0 .cse2 main_~val2~0)) |#memory_int|) (= (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4 32))) (select .cse0 .cse2)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (select .cse0 |main_~#a~0.offset|) main_~val2~0)))) [2018-11-23 10:29:51,942 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvmul (_ bv4 32) main_~i~0)) (.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select .cse0 (bvadd |main_~#a~0.offset| .cse1))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0) (= main_~val2~0 (select .cse0 |main_~#a~0.offset|)))) [2018-11-23 10:29:52,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-11-23 10:29:52,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:52,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:52,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:52,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:52,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:52,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:52,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-11-23 10:29:52,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:52,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:52,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:52,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-23 10:29:52,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-11-23 10:29:52,347 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-23 10:29:52,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:52,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:52,370 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-23 10:29:52,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:11 [2018-11-23 10:29:52,374 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:52,374 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse1 (select .cse0 (_ bv0 32)))) (and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select .cse0 (_ bv4 32)) (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) (select .cse0 (_ bv12 32))) (= (bvadd .cse1 (_ bv4294967293 32)) (_ bv0 32)) (= .cse1 |main_#t~mem4|) (= (_ bv3 32) (select .cse0 (_ bv8 32)))))) [2018-11-23 10:29:52,374 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (bvadd |main_#t~mem4| (_ bv4294967293 32)))) [2018-11-23 10:29:52,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {1200#true} call ULTIMATE.init(); {1200#true} is VALID [2018-11-23 10:29:52,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {1200#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1200#true} is VALID [2018-11-23 10:29:52,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {1200#true} assume true; {1200#true} is VALID [2018-11-23 10:29:52,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1200#true} {1200#true} #63#return; {1200#true} is VALID [2018-11-23 10:29:52,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {1200#true} call #t~ret5 := main(); {1200#true} is VALID [2018-11-23 10:29:52,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {1200#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1200#true} is VALID [2018-11-23 10:29:52,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {1200#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {1223#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:52,513 INFO L273 TraceCheckUtils]: 7: Hoare triple {1223#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1223#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:52,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {1223#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1223#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:52,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {1223#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1233#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:52,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {1233#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1237#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:52,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {1237#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1237#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:52,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {1237#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1244#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~val1~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:52,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {1244#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~val1~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1248#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~val1~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:52,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {1248#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~val1~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1252#(and (= main_~val1~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:52,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {1252#(and (= main_~val1~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1252#(and (= main_~val1~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:52,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {1252#(and (= main_~val1~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1259#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:52,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {1259#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1263#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:52,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {1263#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:52,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {1267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:52,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {1267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0); {1267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:52,564 INFO L273 TraceCheckUtils]: 21: Hoare triple {1267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1277#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:52,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1277#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:52,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {1277#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !~bvslt32(~i~0, ~SIZE~0); {1277#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:52,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {1277#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} ~i~0 := 0bv32; {1287#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:52,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {1287#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1291#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) |main_#t~mem4|))} is VALID [2018-11-23 10:29:52,580 INFO L256 TraceCheckUtils]: 26: Hoare triple {1291#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) |main_#t~mem4|))} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {1295#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:52,581 INFO L273 TraceCheckUtils]: 27: Hoare triple {1295#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1299#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:52,581 INFO L273 TraceCheckUtils]: 28: Hoare triple {1299#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1201#false} is VALID [2018-11-23 10:29:52,581 INFO L273 TraceCheckUtils]: 29: Hoare triple {1201#false} assume !false; {1201#false} is VALID [2018-11-23 10:29:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:52,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:53,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-11-23 10:29:53,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 10:29:53,835 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:53,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-11-23 10:29:53,853 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:53,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:53,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:53,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 83 [2018-11-23 10:29:53,977 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:53,978 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:53,978 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:54,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 79 [2018-11-23 10:29:54,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:29:54,025 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:54,026 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:54,026 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:54,028 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-23 10:29:54,031 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:54,086 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:29:54,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:29:54,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:29:54,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:29:54,192 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 2 xjuncts. [2018-11-23 10:29:54,193 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:38, output treesize:38 [2018-11-23 10:29:54,203 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:54,203 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (bvsge (select (let ((.cse0 (bvmul (_ bv4 32) main_~i~0))) (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| .cse0) main_~val2~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv12 32)) main_~val2~0)) |main_~#a~0.offset|) main_~low~0) [2018-11-23 10:29:54,203 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_arrayElimCell_15]. (and (let ((.cse0 (bvmul (_ bv4 32) main_~i~0))) (or (bvsge v_arrayElimCell_15 main_~low~0) (= (bvadd .cse0 (_ bv12 32)) (_ bv0 32)) (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse0)) (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse0 (_ bv8 32))) (= (bvadd |main_~#a~0.offset| .cse0 (_ bv4 32)) |main_~#a~0.offset|))) (bvsge main_~val2~0 main_~low~0)) [2018-11-23 10:29:54,419 INFO L273 TraceCheckUtils]: 29: Hoare triple {1201#false} assume !false; {1201#false} is VALID [2018-11-23 10:29:54,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {1309#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1201#false} is VALID [2018-11-23 10:29:54,421 INFO L273 TraceCheckUtils]: 27: Hoare triple {1313#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1309#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:29:54,421 INFO L256 TraceCheckUtils]: 26: Hoare triple {1317#(bvsge |main_#t~mem4| main_~low~0)} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {1313#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:29:54,422 INFO L273 TraceCheckUtils]: 25: Hoare triple {1321#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1317#(bvsge |main_#t~mem4| main_~low~0)} is VALID [2018-11-23 10:29:54,422 INFO L273 TraceCheckUtils]: 24: Hoare triple {1325#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} ~i~0 := 0bv32; {1321#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) main_~low~0)} is VALID [2018-11-23 10:29:54,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {1325#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} assume !~bvslt32(~i~0, ~SIZE~0); {1325#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {1325#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1325#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {1335#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1325#(bvsge (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {1335#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} assume !~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0); {1335#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,448 INFO L273 TraceCheckUtils]: 19: Hoare triple {1335#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {1335#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {1345#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1335#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {1349#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1345#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,517 INFO L273 TraceCheckUtils]: 16: Hoare triple {1349#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1349#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {1349#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {1349#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {1359#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1349#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {1363#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1359#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,612 INFO L273 TraceCheckUtils]: 12: Hoare triple {1363#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1363#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {1363#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {1363#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {1373#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1363#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {1377#(and (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_15 (_ BitVec 32))) (bvsge v_arrayElimCell_15 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1373#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)) main_~val2~0) |main_~#a~0.offset|) main_~low~0)} is VALID [2018-11-23 10:29:54,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {1377#(and (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_15 (_ BitVec 32))) (bvsge v_arrayElimCell_15 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1377#(and (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_15 (_ BitVec 32))) (bvsge v_arrayElimCell_15 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:29:54,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {1377#(and (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_15 (_ BitVec 32))) (bvsge v_arrayElimCell_15 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {1377#(and (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_15 (_ BitVec 32))) (bvsge v_arrayElimCell_15 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:29:54,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {1200#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {1377#(and (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_15 (_ BitVec 32))) (bvsge v_arrayElimCell_15 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:29:54,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {1200#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1200#true} is VALID [2018-11-23 10:29:54,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {1200#true} call #t~ret5 := main(); {1200#true} is VALID [2018-11-23 10:29:54,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1200#true} {1200#true} #63#return; {1200#true} is VALID [2018-11-23 10:29:54,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {1200#true} assume true; {1200#true} is VALID [2018-11-23 10:29:54,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {1200#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1200#true} is VALID [2018-11-23 10:29:54,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {1200#true} call ULTIMATE.init(); {1200#true} is VALID [2018-11-23 10:29:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:54,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:54,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-11-23 10:29:54,673 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2018-11-23 10:29:54,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:54,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 10:29:54,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:54,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 10:29:54,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 10:29:54,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2018-11-23 10:29:54,996 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 28 states. [2018-11-23 10:29:56,616 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-11-23 10:29:58,097 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-11-23 10:29:58,681 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-11-23 10:29:59,599 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-11-23 10:30:00,568 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2018-11-23 10:30:02,253 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-11-23 10:30:03,477 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-23 10:30:08,470 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-11-23 10:30:09,410 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-23 10:30:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:30:13,622 INFO L93 Difference]: Finished difference Result 188 states and 229 transitions. [2018-11-23 10:30:13,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 10:30:13,623 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2018-11-23 10:30:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:30:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:30:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 183 transitions. [2018-11-23 10:30:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:30:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 183 transitions. [2018-11-23 10:30:13,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 183 transitions. [2018-11-23 10:30:17,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 182 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 10:30:17,860 INFO L225 Difference]: With dead ends: 188 [2018-11-23 10:30:17,861 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 10:30:17,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=550, Invalid=2102, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 10:30:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 10:30:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 121. [2018-11-23 10:30:18,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:30:18,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 121 states. [2018-11-23 10:30:18,224 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 121 states. [2018-11-23 10:30:18,224 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 121 states. [2018-11-23 10:30:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:30:18,234 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2018-11-23 10:30:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2018-11-23 10:30:18,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:30:18,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:30:18,236 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 186 states. [2018-11-23 10:30:18,236 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 186 states. [2018-11-23 10:30:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:30:18,246 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2018-11-23 10:30:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2018-11-23 10:30:18,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:30:18,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:30:18,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:30:18,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:30:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 10:30:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2018-11-23 10:30:18,253 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 30 [2018-11-23 10:30:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:30:18,253 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2018-11-23 10:30:18,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 10:30:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2018-11-23 10:30:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 10:30:18,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:30:18,255 INFO L402 BasicCegarLoop]: trace histogram [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-23 10:30:18,255 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:30:18,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:30:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash -26204567, now seen corresponding path program 1 times [2018-11-23 10:30:18,256 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:30:18,256 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-23 10:30:18,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:30:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:30:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:30:18,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:30:18,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 10:30:18,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 10:30:18,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:18,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:18,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:18,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 10:30:18,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 10:30:18,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:30:18,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 10:30:18,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:18,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:18,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:18,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 10:30:19,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 10:30:19,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:30:19,322 INFO L478 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 17 [2018-11-23 10:30:19,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:19,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:19,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:19,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:11 [2018-11-23 10:30:19,340 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:30:19,341 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 (bvadd |main_~#a~0.offset| (_ bv4 32))))) (and (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= .cse0 |main_#t~mem4|) (= (_ bv3 32) (select .cse1 (bvadd |main_~#a~0.offset| (_ bv8 32))))))) [2018-11-23 10:30:19,341 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (bvadd |main_#t~mem4| (_ bv4294967293 32)))) [2018-11-23 10:30:19,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {2244#true} call ULTIMATE.init(); {2244#true} is VALID [2018-11-23 10:30:19,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {2244#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2244#true} is VALID [2018-11-23 10:30:19,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {2244#true} assume true; {2244#true} is VALID [2018-11-23 10:30:19,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2244#true} {2244#true} #63#return; {2244#true} is VALID [2018-11-23 10:30:19,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {2244#true} call #t~ret5 := main(); {2244#true} is VALID [2018-11-23 10:30:19,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {2244#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2244#true} is VALID [2018-11-23 10:30:19,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {2244#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {2267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:19,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {2267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:19,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {2267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:19,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {2267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:19,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {2267#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2280#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:19,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {2280#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2280#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:19,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {2280#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2280#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:19,487 INFO L273 TraceCheckUtils]: 13: Hoare triple {2280#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2290#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:19,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {2290#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2294#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:30:19,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {2294#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {2294#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:30:19,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {2294#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0); {2294#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:30:19,494 INFO L273 TraceCheckUtils]: 17: Hoare triple {2294#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2304#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:19,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {2304#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2304#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:19,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {2304#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !~bvslt32(~i~0, ~SIZE~0); {2304#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:19,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {2304#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} ~i~0 := 0bv32; {2314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:19,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {2314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:19,503 INFO L256 TraceCheckUtils]: 22: Hoare triple {2314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {2321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv4 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32))))))} is VALID [2018-11-23 10:30:19,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {2321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv4 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32))))))} ~cond := #in~cond; {2321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv4 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32))))))} is VALID [2018-11-23 10:30:19,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {2321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv4 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32))))))} assume !(0bv32 == ~cond); {2321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv4 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32))))))} is VALID [2018-11-23 10:30:19,505 INFO L273 TraceCheckUtils]: 25: Hoare triple {2321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv4 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32))))))} assume true; {2321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv4 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32))))))} is VALID [2018-11-23 10:30:19,506 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv4 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32))))))} {2314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #67#return; {2314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:19,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {2314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} havoc #t~mem4; {2314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:19,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {2314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2340#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:19,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {2340#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2344#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) |main_#t~mem4|))} is VALID [2018-11-23 10:30:19,519 INFO L256 TraceCheckUtils]: 30: Hoare triple {2344#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) |main_#t~mem4|))} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {2348#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:30:19,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {2348#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2352#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:30:19,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {2352#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2245#false} is VALID [2018-11-23 10:30:19,520 INFO L273 TraceCheckUtils]: 33: Hoare triple {2245#false} assume !false; {2245#false} is VALID [2018-11-23 10:30:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:30:19,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:30:26,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-23 10:30:26,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-11-23 10:30:26,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-23 10:30:26,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:30:26,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 6 [2018-11-23 10:30:26,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:26,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:30:26,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:30:26,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 10:30:26,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:24, output treesize:22 [2018-11-23 10:30:26,262 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:30:26,263 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (bvsge (select (let ((.cse0 (bvmul (_ bv4 32) main_~i~0))) (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| .cse0) main_~val2~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv4 32)) main_~val2~0)) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0) [2018-11-23 10:30:26,263 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|main_~#a~0.offset|, v_arrayElimCell_20]. (and (let ((.cse0 (bvmul (_ bv4 32) main_~i~0))) (or (= .cse0 (_ bv0 32)) (= (bvadd |main_~#a~0.offset| (_ bv4 32)) (bvadd |main_~#a~0.offset| .cse0)) (bvsge v_arrayElimCell_20 main_~low~0))) (bvsge main_~val2~0 main_~low~0)) [2018-11-23 10:30:26,548 INFO L273 TraceCheckUtils]: 33: Hoare triple {2245#false} assume !false; {2245#false} is VALID [2018-11-23 10:30:26,555 INFO L273 TraceCheckUtils]: 32: Hoare triple {2362#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2245#false} is VALID [2018-11-23 10:30:26,555 INFO L273 TraceCheckUtils]: 31: Hoare triple {2366#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2362#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:30:26,556 INFO L256 TraceCheckUtils]: 30: Hoare triple {2370#(bvsge |main_#t~mem4| main_~low~0)} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {2366#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:30:26,557 INFO L273 TraceCheckUtils]: 29: Hoare triple {2374#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2370#(bvsge |main_#t~mem4| main_~low~0)} is VALID [2018-11-23 10:30:28,585 INFO L273 TraceCheckUtils]: 28: Hoare triple {2378#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2374#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) main_~low~0)} is UNKNOWN [2018-11-23 10:30:28,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {2378#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} havoc #t~mem4; {2378#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,587 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2244#true} {2378#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} #67#return; {2378#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {2244#true} assume true; {2244#true} is VALID [2018-11-23 10:30:28,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {2244#true} assume !(0bv32 == ~cond); {2244#true} is VALID [2018-11-23 10:30:28,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {2244#true} ~cond := #in~cond; {2244#true} is VALID [2018-11-23 10:30:28,587 INFO L256 TraceCheckUtils]: 22: Hoare triple {2378#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {2244#true} is VALID [2018-11-23 10:30:28,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {2378#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2378#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,590 INFO L273 TraceCheckUtils]: 20: Hoare triple {2403#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} ~i~0 := 0bv32; {2378#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {2403#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} assume !~bvslt32(~i~0, ~SIZE~0); {2403#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {2403#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2403#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {2413#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2403#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {2413#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} assume !~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0); {2413#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {2413#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {2413#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {2423#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2413#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,665 INFO L273 TraceCheckUtils]: 13: Hoare triple {2427#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2423#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:30:28,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {2427#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2427#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:30:28,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {2427#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {2427#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:30:28,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {2437#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2427#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:30:28,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {2437#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2437#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:30:28,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {2437#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2437#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:30:28,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {2437#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {2437#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:30:28,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {2244#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {2437#(and (or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (forall ((v_arrayElimCell_20 (_ BitVec 32))) (bvsge v_arrayElimCell_20 main_~low~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:30:28,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {2244#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2244#true} is VALID [2018-11-23 10:30:28,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {2244#true} call #t~ret5 := main(); {2244#true} is VALID [2018-11-23 10:30:28,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2244#true} {2244#true} #63#return; {2244#true} is VALID [2018-11-23 10:30:28,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {2244#true} assume true; {2244#true} is VALID [2018-11-23 10:30:28,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {2244#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2244#true} is VALID [2018-11-23 10:30:28,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {2244#true} call ULTIMATE.init(); {2244#true} is VALID [2018-11-23 10:30:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:30:28,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:30:28,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-23 10:30:28,694 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-11-23 10:30:28,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:30:28,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 10:30:31,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 10:30:31,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 10:30:31,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 10:30:31,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=433, Unknown=3, NotChecked=0, Total=506 [2018-11-23 10:30:31,103 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand 23 states. [2018-11-23 10:30:34,305 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-11-23 10:30:36,625 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2018-11-23 10:30:41,209 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-11-23 10:30:45,489 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2018-11-23 10:31:06,895 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-11-23 10:31:11,297 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-11-23 10:31:28,682 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 10:31:29,528 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 10:31:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:32,784 INFO L93 Difference]: Finished difference Result 212 states and 252 transitions. [2018-11-23 10:31:32,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 10:31:32,784 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-11-23 10:31:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:31:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 10:31:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 135 transitions. [2018-11-23 10:31:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 10:31:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 135 transitions. [2018-11-23 10:31:32,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 135 transitions. [2018-11-23 10:31:41,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 131 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-23 10:31:41,616 INFO L225 Difference]: With dead ends: 212 [2018-11-23 10:31:41,616 INFO L226 Difference]: Without dead ends: 210 [2018-11-23 10:31:41,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 48.0s TimeCoverageRelationStatistics Valid=256, Invalid=1622, Unknown=14, NotChecked=0, Total=1892 [2018-11-23 10:31:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-23 10:31:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 147. [2018-11-23 10:31:41,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:31:41,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 147 states. [2018-11-23 10:31:41,917 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 147 states. [2018-11-23 10:31:41,917 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 147 states. [2018-11-23 10:31:41,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:41,927 INFO L93 Difference]: Finished difference Result 210 states and 249 transitions. [2018-11-23 10:31:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 249 transitions. [2018-11-23 10:31:41,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:31:41,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:31:41,928 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 210 states. [2018-11-23 10:31:41,928 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 210 states. [2018-11-23 10:31:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:41,937 INFO L93 Difference]: Finished difference Result 210 states and 249 transitions. [2018-11-23 10:31:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 249 transitions. [2018-11-23 10:31:41,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:31:41,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:31:41,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:31:41,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:31:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 10:31:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 177 transitions. [2018-11-23 10:31:41,943 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 177 transitions. Word has length 34 [2018-11-23 10:31:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:31:41,944 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 177 transitions. [2018-11-23 10:31:41,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 10:31:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 177 transitions. [2018-11-23 10:31:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 10:31:41,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:31:41,945 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:31:41,945 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:31:41,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:31:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1830675681, now seen corresponding path program 2 times [2018-11-23 10:31:41,946 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:31:41,946 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-23 10:31:41,966 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:31:42,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:31:42,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:31:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:31:42,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:31:42,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {3415#true} call ULTIMATE.init(); {3415#true} is VALID [2018-11-23 10:31:42,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {3415#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3415#true} is VALID [2018-11-23 10:31:42,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {3415#true} assume true; {3415#true} is VALID [2018-11-23 10:31:42,206 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3415#true} {3415#true} #63#return; {3415#true} is VALID [2018-11-23 10:31:42,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {3415#true} call #t~ret5 := main(); {3415#true} is VALID [2018-11-23 10:31:42,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {3415#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3415#true} is VALID [2018-11-23 10:31:42,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {3415#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {3438#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {3438#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {3438#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {3438#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {3438#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {3438#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3438#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,210 INFO L273 TraceCheckUtils]: 10: Hoare triple {3438#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3451#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:42,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {3451#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {3451#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:42,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {3451#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0); {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~i~0 := 0bv32; {3471#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {3471#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3471#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,221 INFO L256 TraceCheckUtils]: 18: Hoare triple {3471#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(0bv32 == ~cond); {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,227 INFO L273 TraceCheckUtils]: 21: Hoare triple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,229 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {3471#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #67#return; {3471#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {3471#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} havoc #t~mem4; {3471#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {3471#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3496#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:42,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {3496#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3496#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:42,233 INFO L256 TraceCheckUtils]: 26: Hoare triple {3496#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,234 INFO L273 TraceCheckUtils]: 27: Hoare triple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,235 INFO L273 TraceCheckUtils]: 28: Hoare triple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(0bv32 == ~cond); {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,235 INFO L273 TraceCheckUtils]: 29: Hoare triple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:31:42,237 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {3458#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {3496#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {3496#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:42,238 INFO L273 TraceCheckUtils]: 31: Hoare triple {3496#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {3496#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:42,238 INFO L273 TraceCheckUtils]: 32: Hoare triple {3496#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3521#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:31:42,239 INFO L273 TraceCheckUtils]: 33: Hoare triple {3521#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3416#false} is VALID [2018-11-23 10:31:42,239 INFO L256 TraceCheckUtils]: 34: Hoare triple {3416#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {3416#false} is VALID [2018-11-23 10:31:42,240 INFO L273 TraceCheckUtils]: 35: Hoare triple {3416#false} ~cond := #in~cond; {3416#false} is VALID [2018-11-23 10:31:42,240 INFO L273 TraceCheckUtils]: 36: Hoare triple {3416#false} assume 0bv32 == ~cond; {3416#false} is VALID [2018-11-23 10:31:42,240 INFO L273 TraceCheckUtils]: 37: Hoare triple {3416#false} assume !false; {3416#false} is VALID [2018-11-23 10:31:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:31:42,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:31:42,505 INFO L273 TraceCheckUtils]: 37: Hoare triple {3416#false} assume !false; {3416#false} is VALID [2018-11-23 10:31:42,505 INFO L273 TraceCheckUtils]: 36: Hoare triple {3416#false} assume 0bv32 == ~cond; {3416#false} is VALID [2018-11-23 10:31:42,505 INFO L273 TraceCheckUtils]: 35: Hoare triple {3416#false} ~cond := #in~cond; {3416#false} is VALID [2018-11-23 10:31:42,506 INFO L256 TraceCheckUtils]: 34: Hoare triple {3416#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {3416#false} is VALID [2018-11-23 10:31:42,506 INFO L273 TraceCheckUtils]: 33: Hoare triple {3549#(not (bvslt main_~i~0 ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3416#false} is VALID [2018-11-23 10:31:42,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {3553#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3549#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-23 10:31:42,509 INFO L273 TraceCheckUtils]: 31: Hoare triple {3553#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} havoc #t~mem4; {3553#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:31:42,509 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {3415#true} {3553#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #67#return; {3553#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:31:42,510 INFO L273 TraceCheckUtils]: 29: Hoare triple {3415#true} assume true; {3415#true} is VALID [2018-11-23 10:31:42,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {3415#true} assume !(0bv32 == ~cond); {3415#true} is VALID [2018-11-23 10:31:42,510 INFO L273 TraceCheckUtils]: 27: Hoare triple {3415#true} ~cond := #in~cond; {3415#true} is VALID [2018-11-23 10:31:42,510 INFO L256 TraceCheckUtils]: 26: Hoare triple {3553#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {3415#true} is VALID [2018-11-23 10:31:42,510 INFO L273 TraceCheckUtils]: 25: Hoare triple {3553#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3553#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:31:42,541 INFO L273 TraceCheckUtils]: 24: Hoare triple {3578#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3553#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:31:42,542 INFO L273 TraceCheckUtils]: 23: Hoare triple {3578#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} havoc #t~mem4; {3578#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-23 10:31:42,543 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3415#true} {3578#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #67#return; {3578#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-23 10:31:42,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {3415#true} assume true; {3415#true} is VALID [2018-11-23 10:31:42,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {3415#true} assume !(0bv32 == ~cond); {3415#true} is VALID [2018-11-23 10:31:42,543 INFO L273 TraceCheckUtils]: 19: Hoare triple {3415#true} ~cond := #in~cond; {3415#true} is VALID [2018-11-23 10:31:42,543 INFO L256 TraceCheckUtils]: 18: Hoare triple {3578#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {3415#true} is VALID [2018-11-23 10:31:42,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {3578#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3578#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-23 10:31:42,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {3603#(not (bvslt (_ bv2 32) ~SIZE~0))} ~i~0 := 0bv32; {3578#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-23 10:31:42,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {3603#(not (bvslt (_ bv2 32) ~SIZE~0))} assume !~bvslt32(~i~0, ~SIZE~0); {3603#(not (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:31:42,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {3603#(not (bvslt (_ bv2 32) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3603#(not (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:31:42,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {3603#(not (bvslt (_ bv2 32) ~SIZE~0))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3603#(not (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:31:42,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {3616#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0); {3603#(not (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:31:42,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {3616#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {3616#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:31:42,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {3623#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3616#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:31:42,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {3623#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3623#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-23 10:31:42,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {3623#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {3623#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-23 10:31:42,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {3623#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume !!~bvslt32(~i~0, ~SIZE~0); {3623#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-23 10:31:42,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {3415#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {3623#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-23 10:31:42,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {3415#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3415#true} is VALID [2018-11-23 10:31:42,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {3415#true} call #t~ret5 := main(); {3415#true} is VALID [2018-11-23 10:31:42,573 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3415#true} {3415#true} #63#return; {3415#true} is VALID [2018-11-23 10:31:42,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {3415#true} assume true; {3415#true} is VALID [2018-11-23 10:31:42,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {3415#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3415#true} is VALID [2018-11-23 10:31:42,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {3415#true} call ULTIMATE.init(); {3415#true} is VALID [2018-11-23 10:31:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:31:42,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:31:42,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 10:31:42,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-23 10:31:42,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:31:42,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 10:31:42,713 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-23 10:31:42,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 10:31:42,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 10:31:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-23 10:31:42,714 INFO L87 Difference]: Start difference. First operand 147 states and 177 transitions. Second operand 14 states. [2018-11-23 10:31:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:44,320 INFO L93 Difference]: Finished difference Result 256 states and 300 transitions. [2018-11-23 10:31:44,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:31:44,320 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-23 10:31:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:31:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:31:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 82 transitions. [2018-11-23 10:31:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:31:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 82 transitions. [2018-11-23 10:31:44,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 82 transitions. [2018-11-23 10:31:44,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:31:44,507 INFO L225 Difference]: With dead ends: 256 [2018-11-23 10:31:44,508 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 10:31:44,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-11-23 10:31:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 10:31:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2018-11-23 10:31:45,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:31:45,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 101 states. [2018-11-23 10:31:45,422 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 101 states. [2018-11-23 10:31:45,423 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 101 states. [2018-11-23 10:31:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:45,428 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-11-23 10:31:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-11-23 10:31:45,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:31:45,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:31:45,429 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 118 states. [2018-11-23 10:31:45,429 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 118 states. [2018-11-23 10:31:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:45,434 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-11-23 10:31:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-11-23 10:31:45,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:31:45,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:31:45,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:31:45,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:31:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 10:31:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-11-23 10:31:45,439 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 38 [2018-11-23 10:31:45,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:31:45,440 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-11-23 10:31:45,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 10:31:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-11-23 10:31:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 10:31:45,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:31:45,441 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:31:45,441 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:31:45,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:31:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1692068769, now seen corresponding path program 3 times [2018-11-23 10:31:45,442 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:31:45,442 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:31:45,466 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:31:45,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 10:31:45,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:31:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:31:46,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:31:46,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 10:31:46,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 10:31:46,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 10:31:46,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-23 10:31:46,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:46,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-23 10:31:46,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-11-23 10:31:46,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 10:31:46,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:46,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:46,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:46,536 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-11-23 10:31:46,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2018-11-23 10:31:46,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2018-11-23 10:31:46,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-11-23 10:31:46,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:46,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:46,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:46,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:46,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:46,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:46,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 94 [2018-11-23 10:31:46,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:46,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-23 10:31:47,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2018-11-23 10:31:47,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:31:47,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 128 [2018-11-23 10:31:47,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:47,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:47,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:47,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:45 [2018-11-23 10:31:47,231 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:31:47,231 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|]. (let ((.cse1 (bvmul (_ bv4 32) main_~i~0)) (.cse0 (select |v_#memory_int_42| |main_~#a~0.base|))) (and (= (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4 32))) (select .cse0 (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (store |v_#memory_int_42| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| .cse1) main_~val2~0)) |#memory_int|) (= (select .cse0 (bvadd |main_~#a~0.offset| (_ bv8 32))) main_~val2~0) (= main_~val2~0 (select .cse0 (bvadd |main_~#a~0.offset| (_ bv4 32)))))) [2018-11-23 10:31:47,231 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select .cse0 (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select .cse0 (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select .cse0 (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))) [2018-11-23 10:31:47,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-11-23 10:31:47,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-11-23 10:31:47,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:47,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:47,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:47,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-11-23 10:31:48,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-11-23 10:31:48,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:48,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:48,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:48,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:48,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:48,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:48,197 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 57 [2018-11-23 10:31:48,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:48,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:48,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:48,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:11 [2018-11-23 10:31:48,224 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:31:48,224 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse1 (select .cse0 (bvadd |main_~#a~0.offset| (_ bv4 32))))) (and (= (_ bv3 32) (select .cse0 (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd .cse1 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select .cse0 (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= .cse1 |main_#t~mem4|) (= (_ bv3 32) (select .cse0 (bvadd |main_~#a~0.offset| (_ bv8 32))))))) [2018-11-23 10:31:48,224 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (bvadd |main_#t~mem4| (_ bv4294967293 32)))) [2018-11-23 10:31:48,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {4377#true} call ULTIMATE.init(); {4377#true} is VALID [2018-11-23 10:31:48,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {4377#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {4377#true} is VALID [2018-11-23 10:31:48,402 INFO L273 TraceCheckUtils]: 2: Hoare triple {4377#true} assume true; {4377#true} is VALID [2018-11-23 10:31:48,402 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4377#true} {4377#true} #63#return; {4377#true} is VALID [2018-11-23 10:31:48,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {4377#true} call #t~ret5 := main(); {4377#true} is VALID [2018-11-23 10:31:48,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {4377#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4377#true} is VALID [2018-11-23 10:31:48,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {4377#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {4400#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:48,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {4400#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {4400#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:48,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {4400#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {4400#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:48,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {4400#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4400#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:48,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {4400#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4413#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:48,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {4413#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {4413#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:48,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {4413#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {4413#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:48,410 INFO L273 TraceCheckUtils]: 13: Hoare triple {4413#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4423#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:48,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {4423#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4427#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:31:48,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {4427#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4427#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:31:48,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {4427#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {4434#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~val1~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:31:48,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {4434#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~val1~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4438#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~val1~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:31:48,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {4438#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~val1~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= (_ bv2 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4442#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val1~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:31:48,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {4442#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val1~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0); {4442#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val1~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:31:48,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {4442#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val1~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {4449#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:31:48,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {4449#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4453#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-23 10:31:48,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {4453#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4457#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv4 32) main_~i~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} is VALID [2018-11-23 10:31:48,829 INFO L273 TraceCheckUtils]: 23: Hoare triple {4457#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv4 32) main_~i~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0); {4457#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv4 32) main_~i~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} is VALID [2018-11-23 10:31:48,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {4457#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv4 32) main_~i~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} assume !~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0); {4457#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv4 32) main_~i~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} is VALID [2018-11-23 10:31:48,834 INFO L273 TraceCheckUtils]: 25: Hoare triple {4457#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv4 32) main_~i~0) (= (bvadd main_~val2~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4467#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:48,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {4467#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4467#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:48,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {4467#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !~bvslt32(~i~0, ~SIZE~0); {4467#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:48,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {4467#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} ~i~0 := 0bv32; {4477#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:48,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {4477#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4477#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:48,842 INFO L256 TraceCheckUtils]: 30: Hoare triple {4477#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {4484#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:48,843 INFO L273 TraceCheckUtils]: 31: Hoare triple {4484#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32))))} ~cond := #in~cond; {4484#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:48,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {4484#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32))))} assume !(0bv32 == ~cond); {4484#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:48,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {4484#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32))))} assume true; {4484#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:48,844 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {4484#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32)))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32))))} {4477#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #67#return; {4477#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:48,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {4477#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} havoc #t~mem4; {4477#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:48,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {4477#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4503#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:48,849 INFO L273 TraceCheckUtils]: 37: Hoare triple {4503#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4507#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) |main_#t~mem4|))} is VALID [2018-11-23 10:31:48,850 INFO L256 TraceCheckUtils]: 38: Hoare triple {4507#(and (= (bvadd main_~low~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv3 32) |main_#t~mem4|))} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {4511#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:31:48,851 INFO L273 TraceCheckUtils]: 39: Hoare triple {4511#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4515#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:31:48,851 INFO L273 TraceCheckUtils]: 40: Hoare triple {4515#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {4378#false} is VALID [2018-11-23 10:31:48,851 INFO L273 TraceCheckUtils]: 41: Hoare triple {4378#false} assume !false; {4378#false} is VALID [2018-11-23 10:31:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:31:48,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:32:34,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-23 10:32:34,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-11-23 10:32:34,669 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:34,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 57 [2018-11-23 10:32:34,695 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:34,695 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:34,696 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:34,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 85 [2018-11-23 10:32:34,825 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:34,826 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:34,827 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:34,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 85 [2018-11-23 10:32:34,874 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:32:34,882 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:34,882 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:34,883 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:34,884 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-23 10:32:34,886 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:34,944 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:32:34,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:32:35,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:32:35,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:32:35,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 10:32:35,053 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:40, output treesize:44 [2018-11-23 10:32:35,073 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:32:35,073 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (bvsge (select (let ((.cse0 (bvmul (_ bv4 32) main_~i~0))) (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| .cse0) main_~val2~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv12 32)) main_~val2~0)) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0) [2018-11-23 10:32:35,073 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_arrayElimCell_30, |main_~#a~0.offset|]. (and (let ((.cse1 (bvmul (_ bv4 32) main_~i~0)) (.cse0 (bvadd |main_~#a~0.offset| (_ bv4 32)))) (or (bvsge v_arrayElimCell_30 main_~low~0) (= .cse0 (bvadd |main_~#a~0.offset| .cse1)) (= (bvadd |main_~#a~0.offset| .cse1 (_ bv8 32)) .cse0) (= (bvadd .cse1 (_ bv8 32)) (_ bv0 32)) (= (bvadd |main_~#a~0.offset| .cse1 (_ bv4 32)) .cse0))) (bvsge main_~val2~0 main_~low~0)) [2018-11-23 10:32:35,682 INFO L273 TraceCheckUtils]: 41: Hoare triple {4378#false} assume !false; {4378#false} is VALID [2018-11-23 10:32:35,682 INFO L273 TraceCheckUtils]: 40: Hoare triple {4525#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {4378#false} is VALID [2018-11-23 10:32:35,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {4529#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {4525#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:32:35,684 INFO L256 TraceCheckUtils]: 38: Hoare triple {4533#(bvsge |main_#t~mem4| main_~low~0)} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {4529#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:32:35,684 INFO L273 TraceCheckUtils]: 37: Hoare triple {4537#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4533#(bvsge |main_#t~mem4| main_~low~0)} is VALID [2018-11-23 10:32:37,688 INFO L273 TraceCheckUtils]: 36: Hoare triple {4541#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4537#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) main_~low~0)} is UNKNOWN [2018-11-23 10:32:37,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {4541#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} havoc #t~mem4; {4541#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,690 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {4377#true} {4541#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} #67#return; {4541#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,690 INFO L273 TraceCheckUtils]: 33: Hoare triple {4377#true} assume true; {4377#true} is VALID [2018-11-23 10:32:37,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {4377#true} assume !(0bv32 == ~cond); {4377#true} is VALID [2018-11-23 10:32:37,690 INFO L273 TraceCheckUtils]: 31: Hoare triple {4377#true} ~cond := #in~cond; {4377#true} is VALID [2018-11-23 10:32:37,690 INFO L256 TraceCheckUtils]: 30: Hoare triple {4541#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} call __VERIFIER_assert((if ~bvsge32(#t~mem4, ~low~0) then 1bv32 else 0bv32)); {4377#true} is VALID [2018-11-23 10:32:37,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {4541#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4541#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,691 INFO L273 TraceCheckUtils]: 28: Hoare triple {4566#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} ~i~0 := 0bv32; {4541#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {4566#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} assume !~bvslt32(~i~0, ~SIZE~0); {4566#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,692 INFO L273 TraceCheckUtils]: 26: Hoare triple {4566#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4566#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {4576#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4566#(bvsge (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {4576#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} assume !~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0); {4576#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {4576#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {4576#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,744 INFO L273 TraceCheckUtils]: 22: Hoare triple {4586#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4576#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {4590#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4586#(bvsge (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {4590#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {4590#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {4590#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {4590#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,839 INFO L273 TraceCheckUtils]: 18: Hoare triple {4600#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4590#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {4604#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4600#(bvsge (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {4604#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {4604#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {4604#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {4604#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {4614#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4604#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {4618#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4614#(bvsge (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)) main_~val2~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~low~0)} is VALID [2018-11-23 10:32:37,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {4618#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {4618#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:32:38,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {4618#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4618#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:32:38,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {4628#(and (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4618#(and (or (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:32:38,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {4628#(and (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} call write~intINTTYPE4(~val2~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4628#(and (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:32:38,011 INFO L273 TraceCheckUtils]: 8: Hoare triple {4628#(and (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} assume ~bvslt32(~bvadd32(1bv32, ~i~0), ~SIZE~0);call write~intINTTYPE4(~val1~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {4628#(and (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:32:38,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {4628#(and (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4628#(and (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:32:38,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {4377#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~val2~0 := 3bv32;~val1~0 := 0bv32;~low~0 := 2bv32;~i~0 := 0bv32; {4628#(and (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (_ bv0 32)) (forall ((v_arrayElimCell_30 (_ BitVec 32))) (bvsge v_arrayElimCell_30 main_~low~0))) (bvsge main_~val2~0 main_~low~0))} is VALID [2018-11-23 10:32:38,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {4377#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4377#true} is VALID [2018-11-23 10:32:38,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {4377#true} call #t~ret5 := main(); {4377#true} is VALID [2018-11-23 10:32:38,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4377#true} {4377#true} #63#return; {4377#true} is VALID [2018-11-23 10:32:38,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {4377#true} assume true; {4377#true} is VALID [2018-11-23 10:32:38,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {4377#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {4377#true} is VALID [2018-11-23 10:32:38,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {4377#true} call ULTIMATE.init(); {4377#true} is VALID [2018-11-23 10:32:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:32:38,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:32:38,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2018-11-23 10:32:38,023 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2018-11-23 10:32:38,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:32:38,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 10:32:41,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 76 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 10:32:41,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 10:32:41,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 10:32:41,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=900, Unknown=19, NotChecked=0, Total=1056 [2018-11-23 10:32:41,130 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 33 states. [2018-11-23 10:32:46,656 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2018-11-23 10:32:49,074 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-11-23 10:32:57,635 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 49 DAG size of output: 27 [2018-11-23 10:33:06,787 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2018-11-23 10:33:13,312 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 50 DAG size of output: 26