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/ldv-regression/test24_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:07:49,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:07:49,022 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:07:49,040 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:07:49,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:07:49,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:07:49,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:07:49,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:07:49,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:07:49,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:07:49,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:07:49,060 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:07:49,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:07:49,063 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:07:49,066 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:07:49,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:07:49,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:07:49,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:07:49,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:07:49,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:07:49,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:07:49,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:07:49,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:07:49,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:07:49,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:07:49,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:07:49,089 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:07:49,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:07:49,091 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:07:49,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:07:49,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:07:49,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:07:49,095 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:07:49,095 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:07:49,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:07:49,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:07:49,100 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 11:07:49,119 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:07:49,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:07:49,121 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:07:49,121 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:07:49,122 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:07:49,122 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:07:49,122 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:07:49,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:07:49,124 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:07:49,124 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:07:49,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:07:49,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:07:49,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:07:49,124 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:07:49,125 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:07:49,125 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:07:49,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:07:49,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:07:49,125 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:07:49,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:07:49,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:07:49,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:07:49,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:07:49,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:07:49,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:49,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:07:49,127 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:07:49,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:07:49,127 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:07:49,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:07:49,128 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:07:49,129 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:07:49,129 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:07:49,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:07:49,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:07:49,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:07:49,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:07:49,216 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:07:49,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test24_true-unreach-call_true-termination.c [2018-11-23 11:07:49,293 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bd3367a/539175ebcdd24625863fe815960cd2cd/FLAG49844bcfc [2018-11-23 11:07:49,714 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:07:49,714 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24_true-unreach-call_true-termination.c [2018-11-23 11:07:49,720 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bd3367a/539175ebcdd24625863fe815960cd2cd/FLAG49844bcfc [2018-11-23 11:07:50,080 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bd3367a/539175ebcdd24625863fe815960cd2cd [2018-11-23 11:07:50,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:07:50,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:07:50,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:50,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:07:50,098 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:07:50,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cbf194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50, skipping insertion in model container [2018-11-23 11:07:50,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:07:50,137 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:07:50,365 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:50,379 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:07:50,404 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:50,424 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:07:50,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50 WrapperNode [2018-11-23 11:07:50,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:50,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:50,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:07:50,427 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:07:50,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:50,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:07:50,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:07:50,456 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:07:50,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:07:50,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:07:50,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:07:50,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:07:50,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (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 11:07:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:07:50,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:07:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:07:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:07:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:07:50,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:07:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:07:50,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:07:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 11:07:50,625 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 11:07:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:07:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:07:51,184 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:07:51,185 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:07:51,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:51 BoogieIcfgContainer [2018-11-23 11:07:51,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:07:51,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:07:51,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:07:51,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:07:51,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:07:50" (1/3) ... [2018-11-23 11:07:51,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5225df37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:51, skipping insertion in model container [2018-11-23 11:07:51,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (2/3) ... [2018-11-23 11:07:51,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5225df37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:51, skipping insertion in model container [2018-11-23 11:07:51,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:51" (3/3) ... [2018-11-23 11:07:51,194 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_true-unreach-call_true-termination.c [2018-11-23 11:07:51,204 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:07:51,213 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:07:51,231 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:07:51,263 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:07:51,264 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:07:51,264 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:07:51,264 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:07:51,264 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:07:51,265 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:07:51,265 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:07:51,265 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:07:51,265 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:07:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:07:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:07:51,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:51,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:51,296 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:51,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:51,303 INFO L82 PathProgramCache]: Analyzing trace with hash -435220142, now seen corresponding path program 1 times [2018-11-23 11:07:51,309 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:51,309 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 11:07:51,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:51,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:51,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:07:51,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {24#true} is VALID [2018-11-23 11:07:51,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:07:51,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #38#return; {24#true} is VALID [2018-11-23 11:07:51,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2018-11-23 11:07:51,601 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80bv32);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2018-11-23 11:07:51,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~intINTTYPE4(~i~0, ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0));call #t~mem2 := read~intINTTYPE4(~ad2~0.base, ~bvadd32(~ad2~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem2, 10bv32);havoc #t~mem2; {24#true} is VALID [2018-11-23 11:07:51,602 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 11:07:51,602 INFO L256 TraceCheckUtils]: 8: Hoare triple {25#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {25#false} is VALID [2018-11-23 11:07:51,602 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~intINTTYPE4(~ad1.base, ~bvadd32(~ad1.offset, ~bvmul32(8bv32, ~b)), 4bv32);#res := (if #t~mem0 == ~b then 1bv32 else 0bv32);havoc #t~mem0; {25#false} is VALID [2018-11-23 11:07:51,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume true; {25#false} is VALID [2018-11-23 11:07:51,603 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {25#false} {25#false} #42#return; {25#false} is VALID [2018-11-23 11:07:51,603 INFO L273 TraceCheckUtils]: 12: Hoare triple {25#false} assume 0bv32 == #t~ret5;havoc #t~ret5; {25#false} is VALID [2018-11-23 11:07:51,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:07:51,607 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 11:07:51,607 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:51,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:51,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:07:51,616 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:07:51,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:51,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:07:51,732 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 11:07:51,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:07:51,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:07:51,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:07:51,746 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 11:07:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:51,960 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 11:07:51,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:07:51,961 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:07:51,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:07:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 11:07:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:07:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 11:07:51,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-23 11:07:52,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:52,150 INFO L225 Difference]: With dead ends: 33 [2018-11-23 11:07:52,150 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:07:52,155 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 11:07:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:07:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 11:07:52,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:52,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 11:07:52,197 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:07:52,197 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:07:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:52,200 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:07:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:07:52,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:52,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:52,201 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:07:52,202 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:07:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:52,205 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:07:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:07:52,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:52,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:52,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:52,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:07:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 11:07:52,210 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 11:07:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:52,210 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 11:07:52,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:07:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:07:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:07:52,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:52,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:52,212 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:52,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash -463759725, now seen corresponding path program 1 times [2018-11-23 11:07:52,213 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:52,213 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 11:07:52,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:52,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:52,855 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 11 treesize of output 8 [2018-11-23 11:07:52,907 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 8 treesize of output 7 [2018-11-23 11:07:52,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:52,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:52,968 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 11:07:52,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2018-11-23 11:07:52,981 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:52,982 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_7|, v_main_~i~0_11]. (and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge v_main_~i~0_11 (_ bv0 32)) (bvslt v_main_~i~0_11 (_ bv10 32)) (= (store |v_#memory_int_7| main_~pa~0.base (store (select |v_#memory_int_7| main_~pa~0.base) main_~pa~0.offset v_main_~i~0_11)) |#memory_int|)) [2018-11-23 11:07:52,982 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= (bvadd main_~i~0 (_ bv10 32)) .cse0) (bvslt .cse0 (_ bv10 32)) (bvsge .cse0 (_ bv0 32)))) [2018-11-23 11:07:53,070 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 31 treesize of output 23 [2018-11-23 11:07:53,150 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 23 treesize of output 12 [2018-11-23 11:07:53,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:53,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:53,285 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 11:07:53,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-11-23 11:07:53,298 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:53,299 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= (bvadd main_~i~0 (_ bv10 32)) .cse0) (bvslt .cse0 (_ bv10 32)) (= |main_#t~mem3| .cse0) (bvsge .cse0 (_ bv0 32)))) [2018-11-23 11:07:53,299 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (bvsge |main_#t~mem3| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) |main_#t~mem3|) (bvslt |main_#t~mem3| (_ bv10 32))) [2018-11-23 11:07:53,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {167#true} call ULTIMATE.init(); {167#true} is VALID [2018-11-23 11:07:53,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {167#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {167#true} is VALID [2018-11-23 11:07:53,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {167#true} assume true; {167#true} is VALID [2018-11-23 11:07:53,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {167#true} {167#true} #38#return; {167#true} is VALID [2018-11-23 11:07:53,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {167#true} call #t~ret6 := main(); {167#true} is VALID [2018-11-23 11:07:53,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {167#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80bv32);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet1;havoc #t~nondet1; {167#true} is VALID [2018-11-23 11:07:53,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {167#true} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~intINTTYPE4(~i~0, ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0));call #t~mem2 := read~intINTTYPE4(~ad2~0.base, ~bvadd32(~ad2~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem2, 10bv32);havoc #t~mem2; {190#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:53,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {190#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {194#(and (bvsge |main_#t~mem3| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) |main_#t~mem3|) (bvslt |main_#t~mem3| (_ bv10 32)))} is VALID [2018-11-23 11:07:53,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {194#(and (bvsge |main_#t~mem3| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) |main_#t~mem3|) (bvslt |main_#t~mem3| (_ bv10 32)))} assume !~bvslt32(~i~0, #t~mem3);havoc #t~mem3; {168#false} is VALID [2018-11-23 11:07:53,411 INFO L256 TraceCheckUtils]: 9: Hoare triple {168#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {168#false} is VALID [2018-11-23 11:07:53,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {168#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~intINTTYPE4(~ad1.base, ~bvadd32(~ad1.offset, ~bvmul32(8bv32, ~b)), 4bv32);#res := (if #t~mem0 == ~b then 1bv32 else 0bv32);havoc #t~mem0; {168#false} is VALID [2018-11-23 11:07:53,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {168#false} assume true; {168#false} is VALID [2018-11-23 11:07:53,412 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {168#false} {168#false} #42#return; {168#false} is VALID [2018-11-23 11:07:53,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {168#false} assume 0bv32 == #t~ret5;havoc #t~ret5; {168#false} is VALID [2018-11-23 11:07:53,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {168#false} assume !false; {168#false} is VALID [2018-11-23 11:07:53,415 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 11:07:53,416 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:53,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:53,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:07:53,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:07:53,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:53,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:07:53,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:53,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:07:53,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:07:53,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:07:53,637 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2018-11-23 11:07:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:54,126 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 11:07:54,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:07:54,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:07:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:07:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 11:07:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:07:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 11:07:54,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2018-11-23 11:07:54,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:54,209 INFO L225 Difference]: With dead ends: 25 [2018-11-23 11:07:54,210 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:07:54,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:07:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:07:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:07:54,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:54,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 11:07:54,220 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:07:54,220 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:07:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:54,222 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 11:07:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 11:07:54,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:54,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:54,223 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:07:54,223 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:07:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:54,226 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 11:07:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 11:07:54,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:54,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:54,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:54,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:07:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 11:07:54,230 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-23 11:07:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:54,230 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 11:07:54,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:07:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 11:07:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:07:54,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:54,231 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:54,232 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:54,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash 583830776, now seen corresponding path program 1 times [2018-11-23 11:07:54,233 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:54,233 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 11:07:54,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:54,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:54,614 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 11 treesize of output 8 [2018-11-23 11:07:54,622 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 8 treesize of output 7 [2018-11-23 11:07:54,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:54,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:54,652 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 11:07:54,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2018-11-23 11:07:54,662 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:54,662 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|, v_main_~i~0_12]. (and (bvslt v_main_~i~0_12 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge v_main_~i~0_12 (_ bv0 32)) (= (store |v_#memory_int_8| main_~pa~0.base (store (select |v_#memory_int_8| main_~pa~0.base) main_~pa~0.offset v_main_~i~0_12)) |#memory_int|)) [2018-11-23 11:07:54,662 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= (bvadd main_~i~0 (_ bv10 32)) .cse0) (bvslt .cse0 (_ bv10 32)) (bvsge .cse0 (_ bv0 32)))) [2018-11-23 11:07:54,883 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 31 treesize of output 23 [2018-11-23 11:07:54,912 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 23 treesize of output 12 [2018-11-23 11:07:54,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:54,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:54,965 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 11:07:54,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-11-23 11:07:54,971 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:54,972 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (bvslt .cse0 (_ bv10 32)) (= |main_#t~mem3| .cse0) (= (bvadd main_~i~0 (_ bv9 32)) .cse0) (bvsge .cse0 (_ bv0 32)))) [2018-11-23 11:07:54,972 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (bvsge |main_#t~mem3| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv9 32)) |main_#t~mem3|) (bvslt |main_#t~mem3| (_ bv10 32))) [2018-11-23 11:07:55,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {317#true} call ULTIMATE.init(); {317#true} is VALID [2018-11-23 11:07:55,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {317#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {317#true} is VALID [2018-11-23 11:07:55,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {317#true} assume true; {317#true} is VALID [2018-11-23 11:07:55,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {317#true} {317#true} #38#return; {317#true} is VALID [2018-11-23 11:07:55,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {317#true} call #t~ret6 := main(); {317#true} is VALID [2018-11-23 11:07:55,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80bv32);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet1;havoc #t~nondet1; {317#true} is VALID [2018-11-23 11:07:55,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {317#true} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~intINTTYPE4(~i~0, ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0));call #t~mem2 := read~intINTTYPE4(~ad2~0.base, ~bvadd32(~ad2~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem2, 10bv32);havoc #t~mem2; {340#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:55,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {340#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {344#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:55,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {344#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {348#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:55,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {348#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {352#(and (bvsge |main_#t~mem3| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv9 32)) |main_#t~mem3|) (bvslt |main_#t~mem3| (_ bv10 32)))} is VALID [2018-11-23 11:07:55,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#(and (bvsge |main_#t~mem3| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv9 32)) |main_#t~mem3|) (bvslt |main_#t~mem3| (_ bv10 32)))} assume !~bvslt32(~i~0, #t~mem3);havoc #t~mem3; {318#false} is VALID [2018-11-23 11:07:55,077 INFO L256 TraceCheckUtils]: 11: Hoare triple {318#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {318#false} is VALID [2018-11-23 11:07:55,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {318#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~intINTTYPE4(~ad1.base, ~bvadd32(~ad1.offset, ~bvmul32(8bv32, ~b)), 4bv32);#res := (if #t~mem0 == ~b then 1bv32 else 0bv32);havoc #t~mem0; {318#false} is VALID [2018-11-23 11:07:55,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {318#false} assume true; {318#false} is VALID [2018-11-23 11:07:55,079 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {318#false} {318#false} #42#return; {318#false} is VALID [2018-11-23 11:07:55,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {318#false} assume 0bv32 == #t~ret5;havoc #t~ret5; {318#false} is VALID [2018-11-23 11:07:55,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {318#false} assume !false; {318#false} is VALID [2018-11-23 11:07:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:55,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:07:55,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {318#false} assume !false; {318#false} is VALID [2018-11-23 11:07:55,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {318#false} assume 0bv32 == #t~ret5;havoc #t~ret5; {318#false} is VALID [2018-11-23 11:07:55,465 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {317#true} {318#false} #42#return; {318#false} is VALID [2018-11-23 11:07:55,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {317#true} assume true; {317#true} is VALID [2018-11-23 11:07:55,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {317#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~intINTTYPE4(~ad1.base, ~bvadd32(~ad1.offset, ~bvmul32(8bv32, ~b)), 4bv32);#res := (if #t~mem0 == ~b then 1bv32 else 0bv32);havoc #t~mem0; {317#true} is VALID [2018-11-23 11:07:55,467 INFO L256 TraceCheckUtils]: 11: Hoare triple {318#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {317#true} is VALID [2018-11-23 11:07:55,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {392#(bvslt main_~i~0 |main_#t~mem3|)} assume !~bvslt32(~i~0, #t~mem3);havoc #t~mem3; {318#false} is VALID [2018-11-23 11:07:55,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {396#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {392#(bvslt main_~i~0 |main_#t~mem3|)} is VALID [2018-11-23 11:07:55,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {400#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem3|)))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {396#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 11:07:55,477 INFO L273 TraceCheckUtils]: 7: Hoare triple {404#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {400#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem3|)))} is VALID [2018-11-23 11:07:55,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {317#true} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~intINTTYPE4(~i~0, ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0));call #t~mem2 := read~intINTTYPE4(~ad2~0.base, ~bvadd32(~ad2~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem2, 10bv32);havoc #t~mem2; {404#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:07:55,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80bv32);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet1;havoc #t~nondet1; {317#true} is VALID [2018-11-23 11:07:55,482 INFO L256 TraceCheckUtils]: 4: Hoare triple {317#true} call #t~ret6 := main(); {317#true} is VALID [2018-11-23 11:07:55,482 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {317#true} {317#true} #38#return; {317#true} is VALID [2018-11-23 11:07:55,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {317#true} assume true; {317#true} is VALID [2018-11-23 11:07:55,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {317#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {317#true} is VALID [2018-11-23 11:07:55,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {317#true} call ULTIMATE.init(); {317#true} is VALID [2018-11-23 11:07:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:55,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:07:55,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:07:55,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-23 11:07:55,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:55,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:07:55,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:55,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:07:55,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:07:55,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:07:55,538 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-11-23 11:07:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:56,411 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 11:07:56,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:07:56,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-23 11:07:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:07:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-11-23 11:07:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:07:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-11-23 11:07:56,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2018-11-23 11:07:56,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:56,508 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:07:56,508 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:07:56,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:07:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:07:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 11:07:56,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:56,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 11:07:56,530 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:07:56,530 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:07:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:56,532 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 11:07:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 11:07:56,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:56,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:56,533 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:07:56,534 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:07:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:56,536 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 11:07:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 11:07:56,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:56,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:56,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:56,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:07:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 11:07:56,539 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2018-11-23 11:07:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:56,540 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 11:07:56,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:07:56,540 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 11:07:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:07:56,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:56,541 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:56,541 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:56,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:56,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1705283751, now seen corresponding path program 2 times [2018-11-23 11:07:56,542 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:56,542 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 11:07:56,561 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:07:56,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:07:56,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:07:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:56,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:56,827 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 11 treesize of output 8 [2018-11-23 11:07:56,838 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 8 treesize of output 7 [2018-11-23 11:07:56,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:56,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:56,866 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 11:07:56,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2018-11-23 11:07:56,877 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:56,878 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, v_main_~i~0_16]. (and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt v_main_~i~0_16 (_ bv10 32)) (bvsge v_main_~i~0_16 (_ bv0 32)) (= |#memory_int| (store |v_#memory_int_10| main_~pa~0.base (store (select |v_#memory_int_10| main_~pa~0.base) main_~pa~0.offset v_main_~i~0_16)))) [2018-11-23 11:07:56,878 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= (bvadd main_~i~0 (_ bv10 32)) .cse0) (bvslt .cse0 (_ bv10 32)) (bvsge .cse0 (_ bv0 32)))) [2018-11-23 11:07:57,225 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 31 treesize of output 23 [2018-11-23 11:07:57,254 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 23 treesize of output 12 [2018-11-23 11:07:57,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,281 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 11:07:57,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-11-23 11:07:57,290 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:57,290 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= (bvadd main_~i~0 (_ bv6 32)) .cse0) (bvslt .cse0 (_ bv10 32)) (= |main_#t~mem3| .cse0) (bvsge .cse0 (_ bv0 32)))) [2018-11-23 11:07:57,290 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (bvsge |main_#t~mem3| (_ bv0 32)) (bvslt |main_#t~mem3| (_ bv10 32)) (= (bvadd main_~i~0 (_ bv6 32)) |main_#t~mem3|)) [2018-11-23 11:07:57,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {566#true} is VALID [2018-11-23 11:07:57,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {566#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {566#true} is VALID [2018-11-23 11:07:57,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {566#true} assume true; {566#true} is VALID [2018-11-23 11:07:57,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {566#true} {566#true} #38#return; {566#true} is VALID [2018-11-23 11:07:57,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {566#true} call #t~ret6 := main(); {566#true} is VALID [2018-11-23 11:07:57,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {566#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80bv32);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet1;havoc #t~nondet1; {566#true} is VALID [2018-11-23 11:07:57,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {566#true} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~intINTTYPE4(~i~0, ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0));call #t~mem2 := read~intINTTYPE4(~ad2~0.base, ~bvadd32(~ad2~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem2, 10bv32);havoc #t~mem2; {589#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:57,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {589#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {589#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:57,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {596#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:57,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {596#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {596#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:57,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {596#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {603#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv8 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:57,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {603#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv8 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {603#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv8 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:57,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {603#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv8 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {610#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv7 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:57,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {610#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv7 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {614#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv7 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:57,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {614#(and (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (= (bvadd main_~i~0 (_ bv7 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {618#(and (= (bvadd main_~i~0 (_ bv6 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:07:57,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {618#(and (= (bvadd main_~i~0 (_ bv6 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {622#(and (bvsge |main_#t~mem3| (_ bv0 32)) (bvslt |main_#t~mem3| (_ bv10 32)) (= (bvadd main_~i~0 (_ bv6 32)) |main_#t~mem3|))} is VALID [2018-11-23 11:07:57,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {622#(and (bvsge |main_#t~mem3| (_ bv0 32)) (bvslt |main_#t~mem3| (_ bv10 32)) (= (bvadd main_~i~0 (_ bv6 32)) |main_#t~mem3|))} assume !~bvslt32(~i~0, #t~mem3);havoc #t~mem3; {567#false} is VALID [2018-11-23 11:07:57,401 INFO L256 TraceCheckUtils]: 17: Hoare triple {567#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {567#false} is VALID [2018-11-23 11:07:57,401 INFO L273 TraceCheckUtils]: 18: Hoare triple {567#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~intINTTYPE4(~ad1.base, ~bvadd32(~ad1.offset, ~bvmul32(8bv32, ~b)), 4bv32);#res := (if #t~mem0 == ~b then 1bv32 else 0bv32);havoc #t~mem0; {567#false} is VALID [2018-11-23 11:07:57,402 INFO L273 TraceCheckUtils]: 19: Hoare triple {567#false} assume true; {567#false} is VALID [2018-11-23 11:07:57,402 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {567#false} {567#false} #42#return; {567#false} is VALID [2018-11-23 11:07:57,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {567#false} assume 0bv32 == #t~ret5;havoc #t~ret5; {567#false} is VALID [2018-11-23 11:07:57,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {567#false} assume !false; {567#false} is VALID [2018-11-23 11:07:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:57,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:07:58,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {567#false} assume !false; {567#false} is VALID [2018-11-23 11:07:58,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {567#false} assume 0bv32 == #t~ret5;havoc #t~ret5; {567#false} is VALID [2018-11-23 11:07:58,137 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {566#true} {567#false} #42#return; {567#false} is VALID [2018-11-23 11:07:58,137 INFO L273 TraceCheckUtils]: 19: Hoare triple {566#true} assume true; {566#true} is VALID [2018-11-23 11:07:58,137 INFO L273 TraceCheckUtils]: 18: Hoare triple {566#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~intINTTYPE4(~ad1.base, ~bvadd32(~ad1.offset, ~bvmul32(8bv32, ~b)), 4bv32);#res := (if #t~mem0 == ~b then 1bv32 else 0bv32);havoc #t~mem0; {566#true} is VALID [2018-11-23 11:07:58,138 INFO L256 TraceCheckUtils]: 17: Hoare triple {567#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {566#true} is VALID [2018-11-23 11:07:58,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {662#(bvslt main_~i~0 |main_#t~mem3|)} assume !~bvslt32(~i~0, #t~mem3);havoc #t~mem3; {567#false} is VALID [2018-11-23 11:07:58,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {666#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {662#(bvslt main_~i~0 |main_#t~mem3|)} is VALID [2018-11-23 11:07:58,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {670#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem3|)))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {666#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 11:07:58,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {674#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {670#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem3|)))} is VALID [2018-11-23 11:07:58,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {678#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {674#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:07:58,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {678#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {678#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:07:58,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {685#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {678#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:07:58,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {685#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {685#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:07:58,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {692#(or (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {685#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:07:58,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {692#(or (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {692#(or (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} is VALID [2018-11-23 11:07:58,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {566#true} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~intINTTYPE4(~i~0, ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0));call #t~mem2 := read~intINTTYPE4(~ad2~0.base, ~bvadd32(~ad2~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem2, 10bv32);havoc #t~mem2; {692#(or (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} is VALID [2018-11-23 11:07:58,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {566#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80bv32);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet1;havoc #t~nondet1; {566#true} is VALID [2018-11-23 11:07:58,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {566#true} call #t~ret6 := main(); {566#true} is VALID [2018-11-23 11:07:58,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {566#true} {566#true} #38#return; {566#true} is VALID [2018-11-23 11:07:58,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {566#true} assume true; {566#true} is VALID [2018-11-23 11:07:58,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {566#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {566#true} is VALID [2018-11-23 11:07:58,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {566#true} is VALID [2018-11-23 11:07:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:58,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:07:58,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:07:58,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-23 11:07:58,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:58,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:07:58,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:58,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:07:58,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:07:58,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:07:58,638 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 16 states. [2018-11-23 11:08:00,147 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-11-23 11:08:00,501 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-11-23 11:08:00,831 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2018-11-23 11:08:01,097 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2018-11-23 11:08:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:02,314 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 11:08:02,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:08:02,315 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-23 11:08:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:08:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2018-11-23 11:08:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:08:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2018-11-23 11:08:02,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 48 transitions. [2018-11-23 11:08:02,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:02,690 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:08:02,690 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:08:02,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=260, Invalid=552, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:08:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:08:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 11:08:02,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:02,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 11:08:02,739 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:08:02,739 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:08:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:02,742 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 11:08:02,743 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 11:08:02,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:02,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:02,744 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:08:02,744 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:08:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:02,747 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 11:08:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 11:08:02,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:02,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:02,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:02,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:08:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-23 11:08:02,750 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2018-11-23 11:08:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:02,751 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-23 11:08:02,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:08:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 11:08:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:08:02,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:02,753 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:02,753 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:02,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1443744325, now seen corresponding path program 3 times [2018-11-23 11:08:02,754 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:02,754 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 11:08:02,777 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:08:02,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:08:02,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:08:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:02,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:02,996 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 11:08:03,005 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 11:08:03,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:03,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:03,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:03,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-11-23 11:08:03,063 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:03,064 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, v_main_~i~0_26]. (let ((.cse0 (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (and (bvslt v_main_~i~0_26 (_ bv10 32)) (= |main_~#ad1~0.offset| (_ bv0 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= .cse0 main_~pa~0.offset) (= (store |v_#memory_int_12| |main_~#ad1~0.base| (store (select |v_#memory_int_12| |main_~#ad1~0.base|) .cse0 v_main_~i~0_26)) |#memory_int|) (= |main_~#ad1~0.base| main_~pa~0.base))) [2018-11-23 11:08:03,064 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_26]. (let ((.cse0 (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) .cse0)) (bvslt v_main_~i~0_26 (_ bv10 32)) (= |main_~#ad1~0.offset| (_ bv0 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= .cse0 main_~pa~0.offset) (= |main_~#ad1~0.base| main_~pa~0.base))) [2018-11-23 11:08:04,132 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:08:05,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {935#true} call ULTIMATE.init(); {935#true} is VALID [2018-11-23 11:08:05,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {935#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {935#true} is VALID [2018-11-23 11:08:05,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {935#true} assume true; {935#true} is VALID [2018-11-23 11:08:05,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {935#true} {935#true} #38#return; {935#true} is VALID [2018-11-23 11:08:05,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {935#true} call #t~ret6 := main(); {935#true} is VALID [2018-11-23 11:08:05,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {935#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80bv32);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet1;havoc #t~nondet1; {955#(= |main_~#ad1~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:05,902 INFO L273 TraceCheckUtils]: 6: Hoare triple {955#(= |main_~#ad1~0.offset| (_ bv0 32))} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~intINTTYPE4(~i~0, ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0));call #t~mem2 := read~intINTTYPE4(~ad2~0.base, ~bvadd32(~ad2~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem2, 10bv32);havoc #t~mem2; {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,940 INFO L273 TraceCheckUtils]: 24: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,941 INFO L273 TraceCheckUtils]: 25: Hoare triple {959#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1017#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,948 INFO L273 TraceCheckUtils]: 26: Hoare triple {1017#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_~#ad1~0.base| main_~pa~0.base))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1021#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} is VALID [2018-11-23 11:08:05,955 INFO L273 TraceCheckUtils]: 27: Hoare triple {1021#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)) main_~pa~0.offset))) (= |main_~#ad1~0.base| main_~pa~0.base))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1025#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26))) |main_#t~mem3|) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))))))} is VALID [2018-11-23 11:08:05,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {1025#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26))) |main_#t~mem3|) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))))))} assume !~bvslt32(~i~0, #t~mem3);havoc #t~mem3; {1029#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26))))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))))))} is VALID [2018-11-23 11:08:05,976 INFO L256 TraceCheckUtils]: 29: Hoare triple {1029#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26))))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))))))} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1033#(exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#ad1~0.base_BEFORE_CALL_1| (_ BitVec 32)) (v_main_~i~0_26 (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)) v_main_~i~0_26) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))))} is VALID [2018-11-23 11:08:05,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {1033#(exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#ad1~0.base_BEFORE_CALL_1| (_ BitVec 32)) (v_main_~i~0_26 (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)) v_main_~i~0_26) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))))} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~intINTTYPE4(~ad1.base, ~bvadd32(~ad1.offset, ~bvmul32(8bv32, ~b)), 4bv32);#res := (if #t~mem0 == ~b then 1bv32 else 0bv32);havoc #t~mem0; {1037#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#ad1~0.base_BEFORE_CALL_1| (_ BitVec 32)) (v_main_~i~0_26 (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)) v_main_~i~0_26) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26))))) (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd (bvmul (_ bv8 32) |check_#in~b|) |check_#in~ad1.offset|)))) (= |check_#res| (_ bv0 32))) (and (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd (bvmul (_ bv8 32) |check_#in~b|) |check_#in~ad1.offset|))) (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#ad1~0.base_BEFORE_CALL_1| (_ BitVec 32)) (v_main_~i~0_26 (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)) v_main_~i~0_26) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26))))) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:08:05,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {1037#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#ad1~0.base_BEFORE_CALL_1| (_ BitVec 32)) (v_main_~i~0_26 (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)) v_main_~i~0_26) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26))))) (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd (bvmul (_ bv8 32) |check_#in~b|) |check_#in~ad1.offset|)))) (= |check_#res| (_ bv0 32))) (and (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd (bvmul (_ bv8 32) |check_#in~b|) |check_#in~ad1.offset|))) (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#ad1~0.base_BEFORE_CALL_1| (_ BitVec 32)) (v_main_~i~0_26 (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)) v_main_~i~0_26) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26))))) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1037#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#ad1~0.base_BEFORE_CALL_1| (_ BitVec 32)) (v_main_~i~0_26 (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)) v_main_~i~0_26) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26))))) (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd (bvmul (_ bv8 32) |check_#in~b|) |check_#in~ad1.offset|)))) (= |check_#res| (_ bv0 32))) (and (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd (bvmul (_ bv8 32) |check_#in~b|) |check_#in~ad1.offset|))) (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#ad1~0.base_BEFORE_CALL_1| (_ BitVec 32)) (v_main_~i~0_26 (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)) v_main_~i~0_26) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26))))) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:08:06,005 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1037#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#ad1~0.base_BEFORE_CALL_1| (_ BitVec 32)) (v_main_~i~0_26 (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)) v_main_~i~0_26) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26))))) (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd (bvmul (_ bv8 32) |check_#in~b|) |check_#in~ad1.offset|)))) (= |check_#res| (_ bv0 32))) (and (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd (bvmul (_ bv8 32) |check_#in~b|) |check_#in~ad1.offset|))) (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#ad1~0.base_BEFORE_CALL_1| (_ BitVec 32)) (v_main_~i~0_26 (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)) v_main_~i~0_26) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) v_main_~i~0_26))))) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} {1029#(and (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26))))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))))))} #42#return; {1044#(= (_ bv1 32) |main_#t~ret5|)} is VALID [2018-11-23 11:08:06,006 INFO L273 TraceCheckUtils]: 33: Hoare triple {1044#(= (_ bv1 32) |main_#t~ret5|)} assume 0bv32 == #t~ret5;havoc #t~ret5; {936#false} is VALID [2018-11-23 11:08:06,006 INFO L273 TraceCheckUtils]: 34: Hoare triple {936#false} assume !false; {936#false} is VALID [2018-11-23 11:08:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:08:06,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:06,251 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 11:08:14,138 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:08:14,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:14,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:14,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:1 [2018-11-23 11:08:14,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {936#false} assume !false; {936#false} is VALID [2018-11-23 11:08:14,160 INFO L273 TraceCheckUtils]: 33: Hoare triple {1054#(not (= (_ bv0 32) |main_#t~ret5|))} assume 0bv32 == #t~ret5;havoc #t~ret5; {936#false} is VALID [2018-11-23 11:08:14,162 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1062#(or (not (= |check_#res| (_ bv0 32))) (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd |check_#in~ad1.offset| (bvmul (_ bv8 32) |check_#in~b|))))))} {1058#(= (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0))) main_~i~0)} #42#return; {1054#(not (= (_ bv0 32) |main_#t~ret5|))} is VALID [2018-11-23 11:08:14,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {1062#(or (not (= |check_#res| (_ bv0 32))) (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd |check_#in~ad1.offset| (bvmul (_ bv8 32) |check_#in~b|))))))} assume true; {1062#(or (not (= |check_#res| (_ bv0 32))) (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd |check_#in~ad1.offset| (bvmul (_ bv8 32) |check_#in~b|))))))} is VALID [2018-11-23 11:08:14,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {935#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~intINTTYPE4(~ad1.base, ~bvadd32(~ad1.offset, ~bvmul32(8bv32, ~b)), 4bv32);#res := (if #t~mem0 == ~b then 1bv32 else 0bv32);havoc #t~mem0; {1062#(or (not (= |check_#res| (_ bv0 32))) (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (bvadd |check_#in~ad1.offset| (bvmul (_ bv8 32) |check_#in~b|))))))} is VALID [2018-11-23 11:08:14,164 INFO L256 TraceCheckUtils]: 29: Hoare triple {1058#(= (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0))) main_~i~0)} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {935#true} is VALID [2018-11-23 11:08:14,164 INFO L273 TraceCheckUtils]: 28: Hoare triple {1072#(or (bvslt main_~i~0 |main_#t~mem3|) (= (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0))) main_~i~0))} assume !~bvslt32(~i~0, #t~mem3);havoc #t~mem3; {1058#(= (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0))) main_~i~0)} is VALID [2018-11-23 11:08:14,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {1076#(or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0))) main_~i~0))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1072#(or (bvslt main_~i~0 |main_#t~mem3|) (= (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0))) main_~i~0))} is VALID [2018-11-23 11:08:14,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {1080#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem3|))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1076#(or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0))) main_~i~0))} is VALID [2018-11-23 11:08:14,385 INFO L273 TraceCheckUtils]: 25: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1080#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem3|))))} is VALID [2018-11-23 11:08:14,385 INFO L273 TraceCheckUtils]: 24: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,395 INFO L273 TraceCheckUtils]: 17: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem3);havoc #t~mem3;#t~pre4 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre4; {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,400 INFO L273 TraceCheckUtils]: 7: Hoare triple {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem3 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {935#true} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~intINTTYPE4(~i~0, ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~bvadd32(~#ad1~0.offset, ~bvmul32(8bv32, ~i~0));call #t~mem2 := read~intINTTYPE4(~ad2~0.base, ~bvadd32(~ad2~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem2, 10bv32);havoc #t~mem2; {1084#(forall ((main_~i~0 (_ BitVec 32))) (or (= (bvadd (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv8 32))) (_ bv4294967295 32)) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:08:14,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {935#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80bv32);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet1;havoc #t~nondet1; {935#true} is VALID [2018-11-23 11:08:14,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {935#true} call #t~ret6 := main(); {935#true} is VALID [2018-11-23 11:08:14,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {935#true} {935#true} #38#return; {935#true} is VALID [2018-11-23 11:08:14,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {935#true} assume true; {935#true} is VALID [2018-11-23 11:08:14,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {935#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {935#true} is VALID [2018-11-23 11:08:14,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {935#true} call ULTIMATE.init(); {935#true} is VALID [2018-11-23 11:08:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:08:14,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:14,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-11-23 11:08:14,553 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-11-23 11:08:14,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:14,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:08:15,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:15,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:08:15,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:08:15,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=246, Unknown=1, NotChecked=0, Total=306 [2018-11-23 11:08:15,105 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2018-11-23 11:08:17,835 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-23 11:08:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:19,442 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 11:08:19,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:08:19,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-11-23 11:08:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:08:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-11-23 11:08:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:08:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-11-23 11:08:19,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 16 transitions. [2018-11-23 11:08:19,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:19,629 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:08:19,629 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:08:19,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=96, Invalid=323, Unknown=1, NotChecked=0, Total=420 [2018-11-23 11:08:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:08:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:08:19,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:19,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:19,631 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:19,631 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:19,632 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:08:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:19,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:19,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:19,632 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:19,632 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:19,632 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:08:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:19,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:19,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:19,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:19,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:08:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:08:19,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-11-23 11:08:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:19,633 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:08:19,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:08:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:19,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:19,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:08:19,926 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 11:08:20,644 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:08:20,644 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:08:20,644 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:08:20,644 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:08:20,644 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:08:20,644 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:08:20,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:08:20,645 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-11-23 11:08:20,645 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 38) no Hoare annotation was computed. [2018-11-23 11:08:20,645 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 32) no Hoare annotation was computed. [2018-11-23 11:08:20,645 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 32) no Hoare annotation was computed. [2018-11-23 11:08:20,645 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 38) no Hoare annotation was computed. [2018-11-23 11:08:20,645 INFO L444 ceAbstractionStarter]: At program point L30(lines 15 38) the Hoare annotation is: false [2018-11-23 11:08:20,645 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 38) the Hoare annotation is: true [2018-11-23 11:08:20,645 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2018-11-23 11:08:20,646 INFO L444 ceAbstractionStarter]: At program point L26-3(lines 26 28) the Hoare annotation is: (and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (let ((.cse0 (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) .cse0)) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= .cse0 main_~pa~0.offset)))) (= |main_~#ad1~0.base| main_~pa~0.base)) [2018-11-23 11:08:20,646 INFO L444 ceAbstractionStarter]: At program point L26-4(lines 26 28) the Hoare annotation is: (and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_~#ad1~0.offset| (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (let ((.cse0 (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26)))) (and (= v_main_~i~0_26 (select (select |#memory_int| |main_~#ad1~0.base|) .cse0)) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= .cse0 main_~pa~0.offset)))) (exists ((v_main_~i~0_26 (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |main_~#ad1~0.base|) (bvadd |main_~#ad1~0.offset| (bvmul (_ bv8 32) v_main_~i~0_26))))) (and (= v_main_~i~0_26 .cse1) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (not (bvslt main_~i~0 .cse1)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) .cse1)))) (= |main_~#ad1~0.base| main_~pa~0.base)) [2018-11-23 11:08:20,646 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2018-11-23 11:08:20,646 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 9 12) the Hoare annotation is: true [2018-11-23 11:08:20,646 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 9 12) no Hoare annotation was computed. [2018-11-23 11:08:20,646 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 9 12) no Hoare annotation was computed. [2018-11-23 11:08:20,648 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:08:20,648 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:08:20,648 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 11:08:20,648 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:08:20,648 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:08:20,648 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:08:20,648 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:08:20,649 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 11:08:20,649 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:08:20,649 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:08:20,649 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 11:08:20,649 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 11:08:20,649 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-23 11:08:20,649 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 11:08:20,649 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 11:08:20,650 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 11:08:20,650 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:08:20,650 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 11:08:20,650 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 11:08:20,650 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:08:20,650 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 11:08:20,650 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:08:20,650 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:08:20,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,660 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:08:20,661 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:08:20,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,665 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:08:20,666 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:08:20,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:08:20 BoogieIcfgContainer [2018-11-23 11:08:20,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:08:20,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:08:20,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:08:20,669 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:08:20,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:51" (3/4) ... [2018-11-23 11:08:20,674 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:08:20,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:08:20,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:08:20,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-23 11:08:20,688 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 11:08:20,689 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 11:08:20,689 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:08:20,689 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:08:20,715 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvslt32(~bvadd64(i, 4294967295bv32), unknown-#memory_int-unknown[pa][pa]) && ad1 == 0bv32) && (\exists v_main_~i~0_26 : bv32 :: ((v_main_~i~0_26 == unknown-#memory_int-unknown[ad1][~bvadd64(ad1, ~bvmul32(8bv32, v_main_~i~0_26))] && ~bvslt32(v_main_~i~0_26, 10bv32)) && ~bvsge32(v_main_~i~0_26, 0bv32)) && ~bvadd64(ad1, ~bvmul32(8bv32, v_main_~i~0_26)) == pa)) && ad1 == pa [2018-11-23 11:08:20,737 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test24_true-unreach-call_true-termination.c-witness.graphml [2018-11-23 11:08:20,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:08:20,739 INFO L168 Benchmark]: Toolchain (without parser) took 30646.56 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 853.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -595.3 MB). Peak memory consumption was 258.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:20,740 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:20,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:20,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:20,741 INFO L168 Benchmark]: Boogie Preprocessor took 38.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:20,741 INFO L168 Benchmark]: RCFGBuilder took 691.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:20,742 INFO L168 Benchmark]: TraceAbstraction took 29482.12 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 120.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 161.1 MB). Peak memory consumption was 281.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:20,742 INFO L168 Benchmark]: Witness Printer took 68.68 ms. Allocated memory is still 2.4 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:20,745 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 331.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 691.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29482.12 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 120.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 161.1 MB). Peak memory consumption was 281.7 MB. Max. memory is 7.1 GB. * Witness Printer took 68.68 ms. Allocated memory is still 2.4 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant [2018-11-23 11:08:20,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,762 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:08:20,762 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:08:20,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_26,QUANTIFIED] [2018-11-23 11:08:20,765 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:08:20,766 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((~bvslt32(~bvadd64(i, 4294967295bv32), unknown-#memory_int-unknown[pa][pa]) && ad1 == 0bv32) && (\exists v_main_~i~0_26 : bv32 :: ((v_main_~i~0_26 == unknown-#memory_int-unknown[ad1][~bvadd64(ad1, ~bvmul32(8bv32, v_main_~i~0_26))] && ~bvslt32(v_main_~i~0_26, 10bv32)) && ~bvsge32(v_main_~i~0_26, 0bv32)) && ~bvadd64(ad1, ~bvmul32(8bv32, v_main_~i~0_26)) == pa)) && ad1 == pa - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 29.3s OverallTime, 5 OverallIterations, 11 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 72 SDtfs, 32 SDslu, 236 SDs, 0 SdLazy, 214 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 12 PreInvPairs, 23 NumberOfFragments, 134 HoareAnnotationTreeSize, 12 FomulaSimplifications, 684 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 79 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 104 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 171 ConstructedInterpolants, 46 QuantifiedInterpolants, 74529 SizeOfPredicates, 45 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 181/264 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...