java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy4_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:54:55,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:54:55,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:54:55,235 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:54:55,235 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:54:55,236 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:54:55,238 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:54:55,241 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:54:55,243 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:54:55,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:54:55,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:54:55,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:54:55,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:54:55,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:54:55,260 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:54:55,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:54:55,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:54:55,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:54:55,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:54:55,274 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:54:55,275 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:54:55,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:54:55,284 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:54:55,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:54:55,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:54:55,286 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:54:55,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:54:55,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:54:55,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:54:55,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:54:55,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:54:55,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:54:55,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:54:55,293 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:54:55,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:54:55,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:54:55,296 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 09:54:55,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:54:55,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:54:55,318 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:54:55,319 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:54:55,319 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:54:55,319 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:54:55,320 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:54:55,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:54:55,320 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:54:55,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:54:55,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:54:55,321 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:54:55,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:54:55,321 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:54:55,321 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:54:55,322 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:54:55,322 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:54:55,322 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:54:55,322 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:54:55,322 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:54:55,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:54:55,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:54:55,327 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:54:55,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:54:55,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:54:55,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:54:55,328 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:54:55,328 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:54:55,328 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:54:55,328 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:54:55,328 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:54:55,329 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:54:55,329 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:54:55,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:54:55,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:54:55,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:54:55,404 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:54:55,404 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:54:55,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_false-unreach-call_ground.i [2018-11-23 09:54:55,470 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00af8b5ab/cc69bda80bcf483c9a323dbca1014281/FLAG1a2df7966 [2018-11-23 09:54:55,921 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:54:55,923 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_false-unreach-call_ground.i [2018-11-23 09:54:55,931 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00af8b5ab/cc69bda80bcf483c9a323dbca1014281/FLAG1a2df7966 [2018-11-23 09:54:56,252 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00af8b5ab/cc69bda80bcf483c9a323dbca1014281 [2018-11-23 09:54:56,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:54:56,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:54:56,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:56,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:54:56,270 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:54:56,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295d697c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56, skipping insertion in model container [2018-11-23 09:54:56,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:54:56,314 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:54:56,550 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,556 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:54:56,591 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,618 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:54:56,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56 WrapperNode [2018-11-23 09:54:56,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:56,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:54:56,620 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:54:56,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:54:56,652 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:54:56,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:54:56,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:54:56,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:54:56,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (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 09:54:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:54:56,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:54:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:54:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:54:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:54:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:54:56,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:54:56,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:54:56,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:54:56,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:54:56,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:54:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:54:57,805 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:54:57,805 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 09:54:57,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57 BoogieIcfgContainer [2018-11-23 09:54:57,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:54:57,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:54:57,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:54:57,811 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:54:57,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:54:56" (1/3) ... [2018-11-23 09:54:57,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16868374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (2/3) ... [2018-11-23 09:54:57,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16868374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57" (3/3) ... [2018-11-23 09:54:57,816 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy4_false-unreach-call_ground.i [2018-11-23 09:54:57,827 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:54:57,837 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:54:57,859 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:54:57,897 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:54:57,898 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:54:57,898 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:54:57,899 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:54:57,899 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:54:57,899 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:54:57,899 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:54:57,899 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:54:57,900 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:54:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 09:54:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 09:54:57,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:57,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:57,929 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:57,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:57,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1010407240, now seen corresponding path program 1 times [2018-11-23 09:54:57,941 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:57,942 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 09:54:57,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:58,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 09:54:58,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {39#true} is VALID [2018-11-23 09:54:58,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 09:54:58,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2018-11-23 09:54:58,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret14 := main(); {39#true} is VALID [2018-11-23 09:54:58,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {39#true} is VALID [2018-11-23 09:54:58,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 09:54:58,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} havoc ~i~0;~i~0 := 0bv32; {40#false} is VALID [2018-11-23 09:54:58,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !~bvslt32(~i~0, 100000bv32); {40#false} is VALID [2018-11-23 09:54:58,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0bv32; {40#false} is VALID [2018-11-23 09:54:58,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !~bvslt32(~i~0, 100000bv32); {40#false} is VALID [2018-11-23 09:54:58,135 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} ~i~0 := 0bv32; {40#false} is VALID [2018-11-23 09:54:58,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !~bvslt32(~i~0, 100000bv32); {40#false} is VALID [2018-11-23 09:54:58,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} ~i~0 := 0bv32; {40#false} is VALID [2018-11-23 09:54:58,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} assume !~bvslt32(~i~0, 100000bv32); {40#false} is VALID [2018-11-23 09:54:58,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} havoc ~x~0;~x~0 := 0bv32; {40#false} is VALID [2018-11-23 09:54:58,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {40#false} is VALID [2018-11-23 09:54:58,137 INFO L256 TraceCheckUtils]: 17: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {40#false} is VALID [2018-11-23 09:54:58,137 INFO L273 TraceCheckUtils]: 18: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-23 09:54:58,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {40#false} assume 0bv32 == ~cond; {40#false} is VALID [2018-11-23 09:54:58,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 09:54:58,141 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 09:54:58,142 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:58,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:58,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:54:58,151 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 09:54:58,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:58,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:54:58,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:54:58,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:54:58,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:54:58,233 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 09:54:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,498 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2018-11-23 09:54:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:54:58,498 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 09:54:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-23 09:54:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-23 09:54:58,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2018-11-23 09:54:58,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,799 INFO L225 Difference]: With dead ends: 64 [2018-11-23 09:54:58,799 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 09:54:58,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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 09:54:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 09:54:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 09:54:58,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:58,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 09:54:58,897 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 09:54:58,897 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 09:54:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,903 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 09:54:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 09:54:58,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,905 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 09:54:58,905 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 09:54:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,910 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 09:54:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 09:54:58,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:58,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 09:54:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 09:54:58,917 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2018-11-23 09:54:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:58,917 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 09:54:58,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:54:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 09:54:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 09:54:58,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:58,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:58,920 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:58,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash 555030978, now seen corresponding path program 1 times [2018-11-23 09:54:58,921 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:58,921 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 09:54:58,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:59,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:59,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-23 09:54:59,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {291#true} is VALID [2018-11-23 09:54:59,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-23 09:54:59,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #105#return; {291#true} is VALID [2018-11-23 09:54:59,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret14 := main(); {291#true} is VALID [2018-11-23 09:54:59,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {311#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:59,687 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {292#false} is VALID [2018-11-23 09:54:59,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#false} havoc ~i~0;~i~0 := 0bv32; {292#false} is VALID [2018-11-23 09:54:59,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#false} assume !~bvslt32(~i~0, 100000bv32); {292#false} is VALID [2018-11-23 09:54:59,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#false} ~i~0 := 0bv32; {292#false} is VALID [2018-11-23 09:54:59,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#false} assume !~bvslt32(~i~0, 100000bv32); {292#false} is VALID [2018-11-23 09:54:59,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#false} ~i~0 := 0bv32; {292#false} is VALID [2018-11-23 09:54:59,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {292#false} assume !~bvslt32(~i~0, 100000bv32); {292#false} is VALID [2018-11-23 09:54:59,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {292#false} ~i~0 := 0bv32; {292#false} is VALID [2018-11-23 09:54:59,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {292#false} assume !~bvslt32(~i~0, 100000bv32); {292#false} is VALID [2018-11-23 09:54:59,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#false} havoc ~x~0;~x~0 := 0bv32; {292#false} is VALID [2018-11-23 09:54:59,691 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {292#false} is VALID [2018-11-23 09:54:59,691 INFO L256 TraceCheckUtils]: 17: Hoare triple {292#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {292#false} is VALID [2018-11-23 09:54:59,691 INFO L273 TraceCheckUtils]: 18: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2018-11-23 09:54:59,692 INFO L273 TraceCheckUtils]: 19: Hoare triple {292#false} assume 0bv32 == ~cond; {292#false} is VALID [2018-11-23 09:54:59,692 INFO L273 TraceCheckUtils]: 20: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-23 09:54:59,694 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 09:54:59,694 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:59,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:59,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:54:59,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 09:54:59,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:59,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:54:59,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:54:59,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:54:59,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:54:59,876 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-23 09:55:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,130 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 09:55:00,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:55:00,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 09:55:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 09:55:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 09:55:00,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 09:55:00,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,389 INFO L225 Difference]: With dead ends: 56 [2018-11-23 09:55:00,389 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 09:55:00,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:00,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 09:55:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 09:55:00,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:00,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 09:55:00,441 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 09:55:00,442 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 09:55:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,445 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 09:55:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 09:55:00,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,446 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 09:55:00,446 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 09:55:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,449 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 09:55:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 09:55:00,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:00,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 09:55:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 09:55:00,453 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 21 [2018-11-23 09:55:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:00,453 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 09:55:00,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:55:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 09:55:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 09:55:00,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:00,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:00,455 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:00,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:00,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1099948320, now seen corresponding path program 1 times [2018-11-23 09:55:00,456 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:00,456 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 09:55:00,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:55:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:00,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {543#true} is VALID [2018-11-23 09:55:00,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {543#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {543#true} is VALID [2018-11-23 09:55:00,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2018-11-23 09:55:00,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #105#return; {543#true} is VALID [2018-11-23 09:55:00,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret14 := main(); {543#true} is VALID [2018-11-23 09:55:00,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {543#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {563#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {563#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {563#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {563#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {570#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:00,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {570#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {544#false} is VALID [2018-11-23 09:55:00,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {544#false} havoc ~i~0;~i~0 := 0bv32; {544#false} is VALID [2018-11-23 09:55:00,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 09:55:00,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 09:55:00,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 09:55:00,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 09:55:00,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 09:55:00,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 09:55:00,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 09:55:00,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {544#false} havoc ~x~0;~x~0 := 0bv32; {544#false} is VALID [2018-11-23 09:55:00,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {544#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {544#false} is VALID [2018-11-23 09:55:00,637 INFO L256 TraceCheckUtils]: 19: Hoare triple {544#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {544#false} is VALID [2018-11-23 09:55:00,637 INFO L273 TraceCheckUtils]: 20: Hoare triple {544#false} ~cond := #in~cond; {544#false} is VALID [2018-11-23 09:55:00,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {544#false} assume 0bv32 == ~cond; {544#false} is VALID [2018-11-23 09:55:00,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {544#false} assume !false; {544#false} is VALID [2018-11-23 09:55:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:00,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:00,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {544#false} assume !false; {544#false} is VALID [2018-11-23 09:55:00,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {544#false} assume 0bv32 == ~cond; {544#false} is VALID [2018-11-23 09:55:00,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {544#false} ~cond := #in~cond; {544#false} is VALID [2018-11-23 09:55:00,818 INFO L256 TraceCheckUtils]: 19: Hoare triple {544#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {544#false} is VALID [2018-11-23 09:55:00,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {544#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {544#false} is VALID [2018-11-23 09:55:00,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {544#false} havoc ~x~0;~x~0 := 0bv32; {544#false} is VALID [2018-11-23 09:55:00,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 09:55:00,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 09:55:00,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 09:55:00,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 09:55:00,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 09:55:00,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 09:55:00,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 09:55:00,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {544#false} havoc ~i~0;~i~0 := 0bv32; {544#false} is VALID [2018-11-23 09:55:00,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {658#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {544#false} is VALID [2018-11-23 09:55:00,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {662#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {658#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:00,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {662#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {662#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:00,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {543#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {662#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:00,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret14 := main(); {543#true} is VALID [2018-11-23 09:55:00,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #105#return; {543#true} is VALID [2018-11-23 09:55:00,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2018-11-23 09:55:00,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {543#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {543#true} is VALID [2018-11-23 09:55:00,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {543#true} is VALID [2018-11-23 09:55:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:00,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:00,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:55:00,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 09:55:00,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:00,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:55:00,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:55:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:55:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:55:00,926 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2018-11-23 09:55:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,350 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-11-23 09:55:01,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:55:01,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 09:55:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 09:55:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 09:55:01,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2018-11-23 09:55:01,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,507 INFO L225 Difference]: With dead ends: 61 [2018-11-23 09:55:01,507 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 09:55:01,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:55:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 09:55:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 09:55:01,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:01,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 09:55:01,522 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 09:55:01,522 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 09:55:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,524 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 09:55:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 09:55:01,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:01,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:01,526 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 09:55:01,526 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 09:55:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,529 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 09:55:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 09:55:01,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:01,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:01,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:01,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 09:55:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 09:55:01,533 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 23 [2018-11-23 09:55:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:01,533 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 09:55:01,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:55:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 09:55:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 09:55:01,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:01,535 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:01,535 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:01,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash -799813318, now seen corresponding path program 2 times [2018-11-23 09:55:01,536 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:01,536 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 09:55:01,563 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:01,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 09:55:01,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:01,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:01,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {902#true} call ULTIMATE.init(); {902#true} is VALID [2018-11-23 09:55:01,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {902#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {902#true} is VALID [2018-11-23 09:55:01,675 INFO L273 TraceCheckUtils]: 2: Hoare triple {902#true} assume true; {902#true} is VALID [2018-11-23 09:55:01,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {902#true} {902#true} #105#return; {902#true} is VALID [2018-11-23 09:55:01,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {902#true} call #t~ret14 := main(); {902#true} is VALID [2018-11-23 09:55:01,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {902#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {902#true} is VALID [2018-11-23 09:55:01,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {902#true} is VALID [2018-11-23 09:55:01,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {902#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {902#true} is VALID [2018-11-23 09:55:01,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {902#true} is VALID [2018-11-23 09:55:01,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {902#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {902#true} is VALID [2018-11-23 09:55:01,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {902#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {902#true} is VALID [2018-11-23 09:55:01,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {902#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {902#true} is VALID [2018-11-23 09:55:01,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {902#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {902#true} is VALID [2018-11-23 09:55:01,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {902#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {902#true} is VALID [2018-11-23 09:55:01,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {902#true} assume !~bvslt32(~a~0, 100000bv32); {902#true} is VALID [2018-11-23 09:55:01,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {902#true} havoc ~i~0;~i~0 := 0bv32; {952#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:01,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {952#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {903#false} is VALID [2018-11-23 09:55:01,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {903#false} ~i~0 := 0bv32; {903#false} is VALID [2018-11-23 09:55:01,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {903#false} assume !~bvslt32(~i~0, 100000bv32); {903#false} is VALID [2018-11-23 09:55:01,680 INFO L273 TraceCheckUtils]: 19: Hoare triple {903#false} ~i~0 := 0bv32; {903#false} is VALID [2018-11-23 09:55:01,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {903#false} assume !~bvslt32(~i~0, 100000bv32); {903#false} is VALID [2018-11-23 09:55:01,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {903#false} ~i~0 := 0bv32; {903#false} is VALID [2018-11-23 09:55:01,681 INFO L273 TraceCheckUtils]: 22: Hoare triple {903#false} assume !~bvslt32(~i~0, 100000bv32); {903#false} is VALID [2018-11-23 09:55:01,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {903#false} havoc ~x~0;~x~0 := 0bv32; {903#false} is VALID [2018-11-23 09:55:01,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {903#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {903#false} is VALID [2018-11-23 09:55:01,681 INFO L256 TraceCheckUtils]: 25: Hoare triple {903#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {903#false} is VALID [2018-11-23 09:55:01,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {903#false} ~cond := #in~cond; {903#false} is VALID [2018-11-23 09:55:01,682 INFO L273 TraceCheckUtils]: 27: Hoare triple {903#false} assume 0bv32 == ~cond; {903#false} is VALID [2018-11-23 09:55:01,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {903#false} assume !false; {903#false} is VALID [2018-11-23 09:55:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 09:55:01,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:01,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:01,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:55:01,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 09:55:01,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:01,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:55:01,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:55:01,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:55:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:01,723 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 3 states. [2018-11-23 09:55:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,993 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 09:55:01,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:55:01,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 09:55:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-23 09:55:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-23 09:55:02,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2018-11-23 09:55:02,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:02,168 INFO L225 Difference]: With dead ends: 66 [2018-11-23 09:55:02,169 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 09:55:02,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 09:55:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-23 09:55:02,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:02,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2018-11-23 09:55:02,213 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2018-11-23 09:55:02,213 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2018-11-23 09:55:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,216 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 09:55:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 09:55:02,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:02,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:02,218 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2018-11-23 09:55:02,218 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2018-11-23 09:55:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,221 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 09:55:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 09:55:02,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:02,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:02,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:02,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 09:55:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 09:55:02,224 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 29 [2018-11-23 09:55:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:02,225 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 09:55:02,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:55:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 09:55:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 09:55:02,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:02,227 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:02,227 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:02,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1433530830, now seen corresponding path program 1 times [2018-11-23 09:55:02,228 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:02,228 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 09:55:02,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:55:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:02,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:02,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-23 09:55:02,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1237#true} is VALID [2018-11-23 09:55:02,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-23 09:55:02,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #105#return; {1237#true} is VALID [2018-11-23 09:55:02,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret14 := main(); {1237#true} is VALID [2018-11-23 09:55:02,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {1237#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1257#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {1257#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1257#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {1257#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1264#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:02,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {1264#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1264#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:02,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {1264#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1271#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:02,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {1271#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1271#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:02,555 INFO L273 TraceCheckUtils]: 11: Hoare triple {1271#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1278#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:02,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {1278#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1278#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:02,556 INFO L273 TraceCheckUtils]: 13: Hoare triple {1278#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1285#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:02,557 INFO L273 TraceCheckUtils]: 14: Hoare triple {1285#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1238#false} is VALID [2018-11-23 09:55:02,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {1238#false} havoc ~i~0;~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 09:55:02,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1238#false} is VALID [2018-11-23 09:55:02,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {1238#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1238#false} is VALID [2018-11-23 09:55:02,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 09:55:02,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 09:55:02,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1238#false} is VALID [2018-11-23 09:55:02,558 INFO L273 TraceCheckUtils]: 21: Hoare triple {1238#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1238#false} is VALID [2018-11-23 09:55:02,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 09:55:02,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 09:55:02,559 INFO L273 TraceCheckUtils]: 24: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1238#false} is VALID [2018-11-23 09:55:02,559 INFO L273 TraceCheckUtils]: 25: Hoare triple {1238#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1238#false} is VALID [2018-11-23 09:55:02,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 09:55:02,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 09:55:02,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {1238#false} is VALID [2018-11-23 09:55:02,560 INFO L273 TraceCheckUtils]: 29: Hoare triple {1238#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1238#false} is VALID [2018-11-23 09:55:02,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 09:55:02,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {1238#false} havoc ~x~0;~x~0 := 0bv32; {1238#false} is VALID [2018-11-23 09:55:02,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {1238#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1238#false} is VALID [2018-11-23 09:55:02,561 INFO L256 TraceCheckUtils]: 33: Hoare triple {1238#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {1238#false} is VALID [2018-11-23 09:55:02,561 INFO L273 TraceCheckUtils]: 34: Hoare triple {1238#false} ~cond := #in~cond; {1238#false} is VALID [2018-11-23 09:55:02,561 INFO L273 TraceCheckUtils]: 35: Hoare triple {1238#false} assume 0bv32 == ~cond; {1238#false} is VALID [2018-11-23 09:55:02,562 INFO L273 TraceCheckUtils]: 36: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-23 09:55:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:55:02,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:02,748 INFO L273 TraceCheckUtils]: 36: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-23 09:55:02,748 INFO L273 TraceCheckUtils]: 35: Hoare triple {1238#false} assume 0bv32 == ~cond; {1238#false} is VALID [2018-11-23 09:55:02,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {1238#false} ~cond := #in~cond; {1238#false} is VALID [2018-11-23 09:55:02,749 INFO L256 TraceCheckUtils]: 33: Hoare triple {1238#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {1238#false} is VALID [2018-11-23 09:55:02,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {1238#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1238#false} is VALID [2018-11-23 09:55:02,750 INFO L273 TraceCheckUtils]: 31: Hoare triple {1238#false} havoc ~x~0;~x~0 := 0bv32; {1238#false} is VALID [2018-11-23 09:55:02,750 INFO L273 TraceCheckUtils]: 30: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 09:55:02,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {1238#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1238#false} is VALID [2018-11-23 09:55:02,751 INFO L273 TraceCheckUtils]: 28: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {1238#false} is VALID [2018-11-23 09:55:02,751 INFO L273 TraceCheckUtils]: 27: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 09:55:02,751 INFO L273 TraceCheckUtils]: 26: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 09:55:02,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {1238#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1238#false} is VALID [2018-11-23 09:55:02,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1238#false} is VALID [2018-11-23 09:55:02,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 09:55:02,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 09:55:02,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {1238#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1238#false} is VALID [2018-11-23 09:55:02,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1238#false} is VALID [2018-11-23 09:55:02,753 INFO L273 TraceCheckUtils]: 19: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 09:55:02,753 INFO L273 TraceCheckUtils]: 18: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 09:55:02,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {1238#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1238#false} is VALID [2018-11-23 09:55:02,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1238#false} is VALID [2018-11-23 09:55:02,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {1238#false} havoc ~i~0;~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 09:55:02,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {1421#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1238#false} is VALID [2018-11-23 09:55:02,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {1425#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1421#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:02,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {1425#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1425#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {1432#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1425#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {1432#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1432#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {1439#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1432#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {1439#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1439#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {1446#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1439#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1446#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {1237#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1446#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret14 := main(); {1237#true} is VALID [2018-11-23 09:55:02,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #105#return; {1237#true} is VALID [2018-11-23 09:55:02,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-23 09:55:02,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1237#true} is VALID [2018-11-23 09:55:02,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-23 09:55:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:55:02,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:02,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:55:02,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 09:55:02,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:02,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:55:02,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:02,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:55:02,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:55:02,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:55:02,898 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 12 states. [2018-11-23 09:55:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:04,137 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2018-11-23 09:55:04,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:55:04,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 09:55:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 09:55:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 09:55:04,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2018-11-23 09:55:04,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:04,327 INFO L225 Difference]: With dead ends: 81 [2018-11-23 09:55:04,327 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 09:55:04,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 09:55:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 09:55:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 09:55:04,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:04,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 09:55:04,369 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 09:55:04,369 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 09:55:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:04,373 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 09:55:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 09:55:04,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:04,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:04,374 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 09:55:04,374 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 09:55:04,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:04,377 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 09:55:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 09:55:04,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:04,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:04,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:04,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 09:55:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-11-23 09:55:04,381 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 37 [2018-11-23 09:55:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:04,382 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-23 09:55:04,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:55:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 09:55:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 09:55:04,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:04,384 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:04,384 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:04,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:04,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1695718502, now seen corresponding path program 2 times [2018-11-23 09:55:04,385 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:04,385 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:04,405 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:04,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:55:04,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:04,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:04,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {1784#true} call ULTIMATE.init(); {1784#true} is VALID [2018-11-23 09:55:04,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {1784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1784#true} is VALID [2018-11-23 09:55:04,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {1784#true} assume true; {1784#true} is VALID [2018-11-23 09:55:04,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1784#true} {1784#true} #105#return; {1784#true} is VALID [2018-11-23 09:55:04,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {1784#true} call #t~ret14 := main(); {1784#true} is VALID [2018-11-23 09:55:04,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {1784#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1804#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {1804#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1804#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {1804#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1811#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:04,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {1811#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1811#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:04,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {1811#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1818#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:04,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {1818#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1818#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:04,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {1818#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1825#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:04,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {1825#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1825#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:04,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {1825#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1832#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:04,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {1832#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1832#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:04,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {1832#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1839#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:04,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {1839#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1839#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:04,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {1839#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1846#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:04,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {1846#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1846#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:04,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {1846#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1853#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:04,831 INFO L273 TraceCheckUtils]: 20: Hoare triple {1853#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1853#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:04,844 INFO L273 TraceCheckUtils]: 21: Hoare triple {1853#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1860#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:04,845 INFO L273 TraceCheckUtils]: 22: Hoare triple {1860#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1860#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:04,846 INFO L273 TraceCheckUtils]: 23: Hoare triple {1860#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1867#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:04,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {1867#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1867#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:04,847 INFO L273 TraceCheckUtils]: 25: Hoare triple {1867#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1874#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:04,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {1874#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1785#false} is VALID [2018-11-23 09:55:04,848 INFO L273 TraceCheckUtils]: 27: Hoare triple {1785#false} havoc ~i~0;~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 09:55:04,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1785#false} is VALID [2018-11-23 09:55:04,849 INFO L273 TraceCheckUtils]: 29: Hoare triple {1785#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1785#false} is VALID [2018-11-23 09:55:04,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 09:55:04,849 INFO L273 TraceCheckUtils]: 31: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 09:55:04,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1785#false} is VALID [2018-11-23 09:55:04,850 INFO L273 TraceCheckUtils]: 33: Hoare triple {1785#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1785#false} is VALID [2018-11-23 09:55:04,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 09:55:04,851 INFO L273 TraceCheckUtils]: 35: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 09:55:04,851 INFO L273 TraceCheckUtils]: 36: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1785#false} is VALID [2018-11-23 09:55:04,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {1785#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1785#false} is VALID [2018-11-23 09:55:04,852 INFO L273 TraceCheckUtils]: 38: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 09:55:04,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 09:55:04,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {1785#false} is VALID [2018-11-23 09:55:04,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {1785#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1785#false} is VALID [2018-11-23 09:55:04,853 INFO L273 TraceCheckUtils]: 42: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 09:55:04,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {1785#false} havoc ~x~0;~x~0 := 0bv32; {1785#false} is VALID [2018-11-23 09:55:04,853 INFO L273 TraceCheckUtils]: 44: Hoare triple {1785#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1785#false} is VALID [2018-11-23 09:55:04,853 INFO L256 TraceCheckUtils]: 45: Hoare triple {1785#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {1785#false} is VALID [2018-11-23 09:55:04,853 INFO L273 TraceCheckUtils]: 46: Hoare triple {1785#false} ~cond := #in~cond; {1785#false} is VALID [2018-11-23 09:55:04,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {1785#false} assume 0bv32 == ~cond; {1785#false} is VALID [2018-11-23 09:55:04,854 INFO L273 TraceCheckUtils]: 48: Hoare triple {1785#false} assume !false; {1785#false} is VALID [2018-11-23 09:55:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:55:04,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:05,597 INFO L273 TraceCheckUtils]: 48: Hoare triple {1785#false} assume !false; {1785#false} is VALID [2018-11-23 09:55:05,598 INFO L273 TraceCheckUtils]: 47: Hoare triple {1785#false} assume 0bv32 == ~cond; {1785#false} is VALID [2018-11-23 09:55:05,598 INFO L273 TraceCheckUtils]: 46: Hoare triple {1785#false} ~cond := #in~cond; {1785#false} is VALID [2018-11-23 09:55:05,599 INFO L256 TraceCheckUtils]: 45: Hoare triple {1785#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {1785#false} is VALID [2018-11-23 09:55:05,599 INFO L273 TraceCheckUtils]: 44: Hoare triple {1785#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1785#false} is VALID [2018-11-23 09:55:05,599 INFO L273 TraceCheckUtils]: 43: Hoare triple {1785#false} havoc ~x~0;~x~0 := 0bv32; {1785#false} is VALID [2018-11-23 09:55:05,600 INFO L273 TraceCheckUtils]: 42: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 09:55:05,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {1785#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1785#false} is VALID [2018-11-23 09:55:05,601 INFO L273 TraceCheckUtils]: 40: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {1785#false} is VALID [2018-11-23 09:55:05,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 09:55:05,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 09:55:05,601 INFO L273 TraceCheckUtils]: 37: Hoare triple {1785#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1785#false} is VALID [2018-11-23 09:55:05,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1785#false} is VALID [2018-11-23 09:55:05,602 INFO L273 TraceCheckUtils]: 35: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 09:55:05,602 INFO L273 TraceCheckUtils]: 34: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 09:55:05,602 INFO L273 TraceCheckUtils]: 33: Hoare triple {1785#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1785#false} is VALID [2018-11-23 09:55:05,603 INFO L273 TraceCheckUtils]: 32: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1785#false} is VALID [2018-11-23 09:55:05,603 INFO L273 TraceCheckUtils]: 31: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 09:55:05,603 INFO L273 TraceCheckUtils]: 30: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 09:55:05,604 INFO L273 TraceCheckUtils]: 29: Hoare triple {1785#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1785#false} is VALID [2018-11-23 09:55:05,604 INFO L273 TraceCheckUtils]: 28: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1785#false} is VALID [2018-11-23 09:55:05,604 INFO L273 TraceCheckUtils]: 27: Hoare triple {1785#false} havoc ~i~0;~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 09:55:05,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {2010#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1785#false} is VALID [2018-11-23 09:55:05,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {2014#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2010#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:05,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {2014#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2014#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {2021#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2014#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {2021#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2021#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {2028#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2021#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {2028#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2028#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,621 INFO L273 TraceCheckUtils]: 19: Hoare triple {2035#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2028#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,621 INFO L273 TraceCheckUtils]: 18: Hoare triple {2035#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2035#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {2042#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2035#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {2042#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2042#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,632 INFO L273 TraceCheckUtils]: 15: Hoare triple {2049#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2042#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {2049#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2049#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {2056#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2049#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {2056#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2056#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {2063#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2056#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {2063#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2063#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {2070#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2063#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {2070#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2070#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {2077#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2070#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {2077#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2077#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {1784#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2077#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {1784#true} call #t~ret14 := main(); {1784#true} is VALID [2018-11-23 09:55:05,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1784#true} {1784#true} #105#return; {1784#true} is VALID [2018-11-23 09:55:05,659 INFO L273 TraceCheckUtils]: 2: Hoare triple {1784#true} assume true; {1784#true} is VALID [2018-11-23 09:55:05,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {1784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1784#true} is VALID [2018-11-23 09:55:05,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {1784#true} call ULTIMATE.init(); {1784#true} is VALID [2018-11-23 09:55:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:55:05,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:05,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:55:05,667 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2018-11-23 09:55:05,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:05,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:55:05,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:05,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:55:05,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:55:05,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:55:05,843 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 24 states. [2018-11-23 09:55:08,523 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 7 [2018-11-23 09:55:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:10,423 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2018-11-23 09:55:10,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:55:10,424 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2018-11-23 09:55:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:55:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2018-11-23 09:55:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:55:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2018-11-23 09:55:10,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 118 transitions. [2018-11-23 09:55:10,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:10,653 INFO L225 Difference]: With dead ends: 105 [2018-11-23 09:55:10,653 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 09:55:10,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 09:55:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 09:55:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 09:55:10,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:10,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2018-11-23 09:55:10,691 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 09:55:10,691 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 09:55:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:10,695 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-23 09:55:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-23 09:55:10,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:10,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:10,696 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 09:55:10,696 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 09:55:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:10,699 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-23 09:55:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-23 09:55:10,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:10,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:10,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:10,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 09:55:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-11-23 09:55:10,704 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 49 [2018-11-23 09:55:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:10,704 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-11-23 09:55:10,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:55:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-23 09:55:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 09:55:10,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:10,707 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:10,707 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:10,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:10,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1395020082, now seen corresponding path program 3 times [2018-11-23 09:55:10,708 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:10,708 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:10,741 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:55:10,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 09:55:10,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:10,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:10,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {2547#true} call ULTIMATE.init(); {2547#true} is VALID [2018-11-23 09:55:10,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {2547#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2547#true} is VALID [2018-11-23 09:55:10,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {2547#true} assume true; {2547#true} is VALID [2018-11-23 09:55:10,958 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2547#true} {2547#true} #105#return; {2547#true} is VALID [2018-11-23 09:55:10,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {2547#true} call #t~ret14 := main(); {2547#true} is VALID [2018-11-23 09:55:10,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {2547#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2547#true} is VALID [2018-11-23 09:55:10,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,961 INFO L273 TraceCheckUtils]: 19: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,962 INFO L273 TraceCheckUtils]: 21: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,962 INFO L273 TraceCheckUtils]: 22: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,962 INFO L273 TraceCheckUtils]: 23: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,962 INFO L273 TraceCheckUtils]: 24: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,963 INFO L273 TraceCheckUtils]: 25: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,963 INFO L273 TraceCheckUtils]: 28: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,963 INFO L273 TraceCheckUtils]: 31: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,964 INFO L273 TraceCheckUtils]: 35: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,964 INFO L273 TraceCheckUtils]: 36: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,965 INFO L273 TraceCheckUtils]: 38: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,965 INFO L273 TraceCheckUtils]: 39: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,965 INFO L273 TraceCheckUtils]: 42: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,965 INFO L273 TraceCheckUtils]: 43: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,966 INFO L273 TraceCheckUtils]: 45: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,966 INFO L273 TraceCheckUtils]: 47: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:10,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:10,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {2547#true} assume !~bvslt32(~a~0, 100000bv32); {2547#true} is VALID [2018-11-23 09:55:10,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {2547#true} havoc ~i~0;~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 09:55:10,967 INFO L273 TraceCheckUtils]: 52: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2547#true} is VALID [2018-11-23 09:55:10,967 INFO L273 TraceCheckUtils]: 53: Hoare triple {2547#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2547#true} is VALID [2018-11-23 09:55:10,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 09:55:10,967 INFO L273 TraceCheckUtils]: 55: Hoare triple {2547#true} ~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 09:55:10,967 INFO L273 TraceCheckUtils]: 56: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2547#true} is VALID [2018-11-23 09:55:10,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {2547#true} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2547#true} is VALID [2018-11-23 09:55:10,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 09:55:10,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {2547#true} ~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 09:55:10,968 INFO L273 TraceCheckUtils]: 60: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {2547#true} is VALID [2018-11-23 09:55:10,968 INFO L273 TraceCheckUtils]: 61: Hoare triple {2547#true} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2547#true} is VALID [2018-11-23 09:55:10,968 INFO L273 TraceCheckUtils]: 62: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 09:55:10,975 INFO L273 TraceCheckUtils]: 63: Hoare triple {2547#true} ~i~0 := 0bv32; {2741#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:10,984 INFO L273 TraceCheckUtils]: 64: Hoare triple {2741#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {2741#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:10,985 INFO L273 TraceCheckUtils]: 65: Hoare triple {2741#(= main_~i~0 (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2748#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:10,986 INFO L273 TraceCheckUtils]: 66: Hoare triple {2748#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2548#false} is VALID [2018-11-23 09:55:10,986 INFO L273 TraceCheckUtils]: 67: Hoare triple {2548#false} havoc ~x~0;~x~0 := 0bv32; {2548#false} is VALID [2018-11-23 09:55:10,986 INFO L273 TraceCheckUtils]: 68: Hoare triple {2548#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2548#false} is VALID [2018-11-23 09:55:10,986 INFO L256 TraceCheckUtils]: 69: Hoare triple {2548#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {2548#false} is VALID [2018-11-23 09:55:10,986 INFO L273 TraceCheckUtils]: 70: Hoare triple {2548#false} ~cond := #in~cond; {2548#false} is VALID [2018-11-23 09:55:10,986 INFO L273 TraceCheckUtils]: 71: Hoare triple {2548#false} assume 0bv32 == ~cond; {2548#false} is VALID [2018-11-23 09:55:10,987 INFO L273 TraceCheckUtils]: 72: Hoare triple {2548#false} assume !false; {2548#false} is VALID [2018-11-23 09:55:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2018-11-23 09:55:10,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:11,132 INFO L273 TraceCheckUtils]: 72: Hoare triple {2548#false} assume !false; {2548#false} is VALID [2018-11-23 09:55:11,133 INFO L273 TraceCheckUtils]: 71: Hoare triple {2548#false} assume 0bv32 == ~cond; {2548#false} is VALID [2018-11-23 09:55:11,133 INFO L273 TraceCheckUtils]: 70: Hoare triple {2548#false} ~cond := #in~cond; {2548#false} is VALID [2018-11-23 09:55:11,133 INFO L256 TraceCheckUtils]: 69: Hoare triple {2548#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {2548#false} is VALID [2018-11-23 09:55:11,134 INFO L273 TraceCheckUtils]: 68: Hoare triple {2548#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2548#false} is VALID [2018-11-23 09:55:11,134 INFO L273 TraceCheckUtils]: 67: Hoare triple {2548#false} havoc ~x~0;~x~0 := 0bv32; {2548#false} is VALID [2018-11-23 09:55:11,135 INFO L273 TraceCheckUtils]: 66: Hoare triple {2788#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2548#false} is VALID [2018-11-23 09:55:11,135 INFO L273 TraceCheckUtils]: 65: Hoare triple {2792#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2788#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:11,136 INFO L273 TraceCheckUtils]: 64: Hoare triple {2792#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {2792#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:11,136 INFO L273 TraceCheckUtils]: 63: Hoare triple {2547#true} ~i~0 := 0bv32; {2792#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:11,136 INFO L273 TraceCheckUtils]: 62: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 09:55:11,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {2547#true} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2547#true} is VALID [2018-11-23 09:55:11,136 INFO L273 TraceCheckUtils]: 60: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {2547#true} is VALID [2018-11-23 09:55:11,137 INFO L273 TraceCheckUtils]: 59: Hoare triple {2547#true} ~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 09:55:11,137 INFO L273 TraceCheckUtils]: 58: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 09:55:11,137 INFO L273 TraceCheckUtils]: 57: Hoare triple {2547#true} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2547#true} is VALID [2018-11-23 09:55:11,137 INFO L273 TraceCheckUtils]: 56: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2547#true} is VALID [2018-11-23 09:55:11,137 INFO L273 TraceCheckUtils]: 55: Hoare triple {2547#true} ~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 09:55:11,137 INFO L273 TraceCheckUtils]: 54: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 09:55:11,138 INFO L273 TraceCheckUtils]: 53: Hoare triple {2547#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2547#true} is VALID [2018-11-23 09:55:11,138 INFO L273 TraceCheckUtils]: 52: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2547#true} is VALID [2018-11-23 09:55:11,138 INFO L273 TraceCheckUtils]: 51: Hoare triple {2547#true} havoc ~i~0;~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 09:55:11,138 INFO L273 TraceCheckUtils]: 50: Hoare triple {2547#true} assume !~bvslt32(~a~0, 100000bv32); {2547#true} is VALID [2018-11-23 09:55:11,139 INFO L273 TraceCheckUtils]: 49: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,139 INFO L273 TraceCheckUtils]: 48: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,139 INFO L273 TraceCheckUtils]: 47: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,139 INFO L273 TraceCheckUtils]: 46: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,139 INFO L273 TraceCheckUtils]: 45: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,140 INFO L273 TraceCheckUtils]: 43: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,140 INFO L273 TraceCheckUtils]: 42: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,140 INFO L273 TraceCheckUtils]: 41: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,140 INFO L273 TraceCheckUtils]: 40: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,141 INFO L273 TraceCheckUtils]: 39: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,141 INFO L273 TraceCheckUtils]: 38: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,142 INFO L273 TraceCheckUtils]: 34: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,142 INFO L273 TraceCheckUtils]: 33: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,142 INFO L273 TraceCheckUtils]: 32: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,142 INFO L273 TraceCheckUtils]: 31: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,144 INFO L273 TraceCheckUtils]: 30: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,144 INFO L273 TraceCheckUtils]: 28: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,144 INFO L273 TraceCheckUtils]: 27: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,145 INFO L273 TraceCheckUtils]: 25: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 09:55:11,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {2547#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2547#true} is VALID [2018-11-23 09:55:11,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {2547#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2547#true} is VALID [2018-11-23 09:55:11,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {2547#true} call #t~ret14 := main(); {2547#true} is VALID [2018-11-23 09:55:11,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2547#true} {2547#true} #105#return; {2547#true} is VALID [2018-11-23 09:55:11,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {2547#true} assume true; {2547#true} is VALID [2018-11-23 09:55:11,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {2547#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2547#true} is VALID [2018-11-23 09:55:11,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {2547#true} call ULTIMATE.init(); {2547#true} is VALID [2018-11-23 09:55:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2018-11-23 09:55:11,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:11,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:55:11,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-23 09:55:11,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:11,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:55:11,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:11,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:55:11,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:55:11,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:55:11,199 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2018-11-23 09:55:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:11,851 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-23 09:55:11,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:55:11,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-23 09:55:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 09:55:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 09:55:11,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2018-11-23 09:55:12,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:12,007 INFO L225 Difference]: With dead ends: 125 [2018-11-23 09:55:12,007 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 09:55:12,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:55:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 09:55:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-23 09:55:12,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:12,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 102 states. [2018-11-23 09:55:12,046 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 102 states. [2018-11-23 09:55:12,046 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 102 states. [2018-11-23 09:55:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:12,049 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-23 09:55:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-23 09:55:12,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:12,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:12,050 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 102 states. [2018-11-23 09:55:12,050 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 102 states. [2018-11-23 09:55:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:12,053 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-23 09:55:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-23 09:55:12,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:12,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:12,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:12,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 09:55:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-11-23 09:55:12,058 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 73 [2018-11-23 09:55:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:12,058 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-11-23 09:55:12,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:55:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-23 09:55:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 09:55:12,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:12,059 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:12,060 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:12,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:12,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1417462198, now seen corresponding path program 4 times [2018-11-23 09:55:12,061 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:12,061 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:12,087 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:55:12,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:55:12,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:12,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:12,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {3533#true} call ULTIMATE.init(); {3533#true} is VALID [2018-11-23 09:55:12,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {3533#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3533#true} is VALID [2018-11-23 09:55:12,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {3533#true} assume true; {3533#true} is VALID [2018-11-23 09:55:12,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3533#true} {3533#true} #105#return; {3533#true} is VALID [2018-11-23 09:55:12,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {3533#true} call #t~ret14 := main(); {3533#true} is VALID [2018-11-23 09:55:12,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {3533#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3553#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:12,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {3553#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3553#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:12,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {3553#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3560#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:12,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {3560#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3560#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:12,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {3560#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3567#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:12,822 INFO L273 TraceCheckUtils]: 10: Hoare triple {3567#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3567#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:12,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {3567#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3574#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:12,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {3574#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3574#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:12,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {3574#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3581#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:12,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {3581#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3581#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:12,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {3581#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3588#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:12,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {3588#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3588#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:12,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {3588#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3595#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:12,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {3595#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3595#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:12,856 INFO L273 TraceCheckUtils]: 19: Hoare triple {3595#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3602#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:12,856 INFO L273 TraceCheckUtils]: 20: Hoare triple {3602#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3602#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:12,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {3602#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3609#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:12,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {3609#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3609#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:12,858 INFO L273 TraceCheckUtils]: 23: Hoare triple {3609#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3616#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:12,858 INFO L273 TraceCheckUtils]: 24: Hoare triple {3616#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3616#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:12,858 INFO L273 TraceCheckUtils]: 25: Hoare triple {3616#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:12,859 INFO L273 TraceCheckUtils]: 26: Hoare triple {3623#(= (_ bv10 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3623#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:12,859 INFO L273 TraceCheckUtils]: 27: Hoare triple {3623#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3630#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 09:55:12,859 INFO L273 TraceCheckUtils]: 28: Hoare triple {3630#(= (_ bv11 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3630#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 09:55:12,860 INFO L273 TraceCheckUtils]: 29: Hoare triple {3630#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3637#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 09:55:12,861 INFO L273 TraceCheckUtils]: 30: Hoare triple {3637#(= (_ bv12 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3637#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 09:55:12,862 INFO L273 TraceCheckUtils]: 31: Hoare triple {3637#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3644#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 09:55:12,862 INFO L273 TraceCheckUtils]: 32: Hoare triple {3644#(= (_ bv13 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3644#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 09:55:12,863 INFO L273 TraceCheckUtils]: 33: Hoare triple {3644#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3651#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 09:55:12,863 INFO L273 TraceCheckUtils]: 34: Hoare triple {3651#(= (_ bv14 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3651#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 09:55:12,864 INFO L273 TraceCheckUtils]: 35: Hoare triple {3651#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3658#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 09:55:12,865 INFO L273 TraceCheckUtils]: 36: Hoare triple {3658#(= (_ bv15 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3658#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 09:55:12,865 INFO L273 TraceCheckUtils]: 37: Hoare triple {3658#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3665#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 09:55:12,866 INFO L273 TraceCheckUtils]: 38: Hoare triple {3665#(= (_ bv16 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3665#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 09:55:12,867 INFO L273 TraceCheckUtils]: 39: Hoare triple {3665#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3672#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 09:55:12,867 INFO L273 TraceCheckUtils]: 40: Hoare triple {3672#(= (_ bv17 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3672#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 09:55:12,868 INFO L273 TraceCheckUtils]: 41: Hoare triple {3672#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3679#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 09:55:12,868 INFO L273 TraceCheckUtils]: 42: Hoare triple {3679#(= (_ bv18 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3679#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 09:55:12,869 INFO L273 TraceCheckUtils]: 43: Hoare triple {3679#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3686#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 09:55:12,870 INFO L273 TraceCheckUtils]: 44: Hoare triple {3686#(= (_ bv19 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3686#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 09:55:12,870 INFO L273 TraceCheckUtils]: 45: Hoare triple {3686#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3693#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 09:55:12,871 INFO L273 TraceCheckUtils]: 46: Hoare triple {3693#(= (_ bv20 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3693#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 09:55:12,872 INFO L273 TraceCheckUtils]: 47: Hoare triple {3693#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3700#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 09:55:12,872 INFO L273 TraceCheckUtils]: 48: Hoare triple {3700#(= (_ bv21 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3700#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 09:55:12,873 INFO L273 TraceCheckUtils]: 49: Hoare triple {3700#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3707#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-23 09:55:12,873 INFO L273 TraceCheckUtils]: 50: Hoare triple {3707#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {3534#false} is VALID [2018-11-23 09:55:12,874 INFO L273 TraceCheckUtils]: 51: Hoare triple {3534#false} havoc ~i~0;~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 09:55:12,874 INFO L273 TraceCheckUtils]: 52: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3534#false} is VALID [2018-11-23 09:55:12,874 INFO L273 TraceCheckUtils]: 53: Hoare triple {3534#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3534#false} is VALID [2018-11-23 09:55:12,874 INFO L273 TraceCheckUtils]: 54: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3534#false} is VALID [2018-11-23 09:55:12,875 INFO L273 TraceCheckUtils]: 55: Hoare triple {3534#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3534#false} is VALID [2018-11-23 09:55:12,875 INFO L273 TraceCheckUtils]: 56: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3534#false} is VALID [2018-11-23 09:55:12,875 INFO L273 TraceCheckUtils]: 57: Hoare triple {3534#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3534#false} is VALID [2018-11-23 09:55:12,875 INFO L273 TraceCheckUtils]: 58: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3534#false} is VALID [2018-11-23 09:55:12,876 INFO L273 TraceCheckUtils]: 59: Hoare triple {3534#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3534#false} is VALID [2018-11-23 09:55:12,876 INFO L273 TraceCheckUtils]: 60: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 09:55:12,876 INFO L273 TraceCheckUtils]: 61: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 09:55:12,876 INFO L273 TraceCheckUtils]: 62: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3534#false} is VALID [2018-11-23 09:55:12,877 INFO L273 TraceCheckUtils]: 63: Hoare triple {3534#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3534#false} is VALID [2018-11-23 09:55:12,877 INFO L273 TraceCheckUtils]: 64: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3534#false} is VALID [2018-11-23 09:55:12,877 INFO L273 TraceCheckUtils]: 65: Hoare triple {3534#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3534#false} is VALID [2018-11-23 09:55:12,877 INFO L273 TraceCheckUtils]: 66: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3534#false} is VALID [2018-11-23 09:55:12,877 INFO L273 TraceCheckUtils]: 67: Hoare triple {3534#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3534#false} is VALID [2018-11-23 09:55:12,877 INFO L273 TraceCheckUtils]: 68: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3534#false} is VALID [2018-11-23 09:55:12,878 INFO L273 TraceCheckUtils]: 69: Hoare triple {3534#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3534#false} is VALID [2018-11-23 09:55:12,878 INFO L273 TraceCheckUtils]: 70: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 09:55:12,878 INFO L273 TraceCheckUtils]: 71: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 09:55:12,878 INFO L273 TraceCheckUtils]: 72: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3534#false} is VALID [2018-11-23 09:55:12,878 INFO L273 TraceCheckUtils]: 73: Hoare triple {3534#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3534#false} is VALID [2018-11-23 09:55:12,878 INFO L273 TraceCheckUtils]: 74: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3534#false} is VALID [2018-11-23 09:55:12,879 INFO L273 TraceCheckUtils]: 75: Hoare triple {3534#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3534#false} is VALID [2018-11-23 09:55:12,879 INFO L273 TraceCheckUtils]: 76: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3534#false} is VALID [2018-11-23 09:55:12,879 INFO L273 TraceCheckUtils]: 77: Hoare triple {3534#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3534#false} is VALID [2018-11-23 09:55:12,879 INFO L273 TraceCheckUtils]: 78: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3534#false} is VALID [2018-11-23 09:55:12,880 INFO L273 TraceCheckUtils]: 79: Hoare triple {3534#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3534#false} is VALID [2018-11-23 09:55:12,880 INFO L273 TraceCheckUtils]: 80: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 09:55:12,880 INFO L273 TraceCheckUtils]: 81: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 09:55:12,880 INFO L273 TraceCheckUtils]: 82: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3534#false} is VALID [2018-11-23 09:55:12,880 INFO L273 TraceCheckUtils]: 83: Hoare triple {3534#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3534#false} is VALID [2018-11-23 09:55:12,881 INFO L273 TraceCheckUtils]: 84: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3534#false} is VALID [2018-11-23 09:55:12,881 INFO L273 TraceCheckUtils]: 85: Hoare triple {3534#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3534#false} is VALID [2018-11-23 09:55:12,881 INFO L273 TraceCheckUtils]: 86: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3534#false} is VALID [2018-11-23 09:55:12,881 INFO L273 TraceCheckUtils]: 87: Hoare triple {3534#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3534#false} is VALID [2018-11-23 09:55:12,882 INFO L273 TraceCheckUtils]: 88: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3534#false} is VALID [2018-11-23 09:55:12,882 INFO L273 TraceCheckUtils]: 89: Hoare triple {3534#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3534#false} is VALID [2018-11-23 09:55:12,882 INFO L273 TraceCheckUtils]: 90: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 09:55:12,882 INFO L273 TraceCheckUtils]: 91: Hoare triple {3534#false} havoc ~x~0;~x~0 := 0bv32; {3534#false} is VALID [2018-11-23 09:55:12,883 INFO L273 TraceCheckUtils]: 92: Hoare triple {3534#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3534#false} is VALID [2018-11-23 09:55:12,883 INFO L256 TraceCheckUtils]: 93: Hoare triple {3534#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {3534#false} is VALID [2018-11-23 09:55:12,883 INFO L273 TraceCheckUtils]: 94: Hoare triple {3534#false} ~cond := #in~cond; {3534#false} is VALID [2018-11-23 09:55:12,883 INFO L273 TraceCheckUtils]: 95: Hoare triple {3534#false} assume 0bv32 == ~cond; {3534#false} is VALID [2018-11-23 09:55:12,884 INFO L273 TraceCheckUtils]: 96: Hoare triple {3534#false} assume !false; {3534#false} is VALID [2018-11-23 09:55:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 09:55:12,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:15,149 INFO L273 TraceCheckUtils]: 96: Hoare triple {3534#false} assume !false; {3534#false} is VALID [2018-11-23 09:55:15,150 INFO L273 TraceCheckUtils]: 95: Hoare triple {3534#false} assume 0bv32 == ~cond; {3534#false} is VALID [2018-11-23 09:55:15,150 INFO L273 TraceCheckUtils]: 94: Hoare triple {3534#false} ~cond := #in~cond; {3534#false} is VALID [2018-11-23 09:55:15,151 INFO L256 TraceCheckUtils]: 93: Hoare triple {3534#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {3534#false} is VALID [2018-11-23 09:55:15,151 INFO L273 TraceCheckUtils]: 92: Hoare triple {3534#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3534#false} is VALID [2018-11-23 09:55:15,151 INFO L273 TraceCheckUtils]: 91: Hoare triple {3534#false} havoc ~x~0;~x~0 := 0bv32; {3534#false} is VALID [2018-11-23 09:55:15,151 INFO L273 TraceCheckUtils]: 90: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 09:55:15,152 INFO L273 TraceCheckUtils]: 89: Hoare triple {3534#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3534#false} is VALID [2018-11-23 09:55:15,152 INFO L273 TraceCheckUtils]: 88: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3534#false} is VALID [2018-11-23 09:55:15,152 INFO L273 TraceCheckUtils]: 87: Hoare triple {3534#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3534#false} is VALID [2018-11-23 09:55:15,152 INFO L273 TraceCheckUtils]: 86: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3534#false} is VALID [2018-11-23 09:55:15,153 INFO L273 TraceCheckUtils]: 85: Hoare triple {3534#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3534#false} is VALID [2018-11-23 09:55:15,153 INFO L273 TraceCheckUtils]: 84: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3534#false} is VALID [2018-11-23 09:55:15,153 INFO L273 TraceCheckUtils]: 83: Hoare triple {3534#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3534#false} is VALID [2018-11-23 09:55:15,153 INFO L273 TraceCheckUtils]: 82: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3534#false} is VALID [2018-11-23 09:55:15,153 INFO L273 TraceCheckUtils]: 81: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 09:55:15,154 INFO L273 TraceCheckUtils]: 80: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 09:55:15,154 INFO L273 TraceCheckUtils]: 79: Hoare triple {3534#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3534#false} is VALID [2018-11-23 09:55:15,154 INFO L273 TraceCheckUtils]: 78: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3534#false} is VALID [2018-11-23 09:55:15,154 INFO L273 TraceCheckUtils]: 77: Hoare triple {3534#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3534#false} is VALID [2018-11-23 09:55:15,154 INFO L273 TraceCheckUtils]: 76: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3534#false} is VALID [2018-11-23 09:55:15,154 INFO L273 TraceCheckUtils]: 75: Hoare triple {3534#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3534#false} is VALID [2018-11-23 09:55:15,154 INFO L273 TraceCheckUtils]: 74: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3534#false} is VALID [2018-11-23 09:55:15,155 INFO L273 TraceCheckUtils]: 73: Hoare triple {3534#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3534#false} is VALID [2018-11-23 09:55:15,155 INFO L273 TraceCheckUtils]: 72: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3534#false} is VALID [2018-11-23 09:55:15,155 INFO L273 TraceCheckUtils]: 71: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 09:55:15,155 INFO L273 TraceCheckUtils]: 70: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 09:55:15,155 INFO L273 TraceCheckUtils]: 69: Hoare triple {3534#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3534#false} is VALID [2018-11-23 09:55:15,155 INFO L273 TraceCheckUtils]: 68: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3534#false} is VALID [2018-11-23 09:55:15,156 INFO L273 TraceCheckUtils]: 67: Hoare triple {3534#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3534#false} is VALID [2018-11-23 09:55:15,156 INFO L273 TraceCheckUtils]: 66: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3534#false} is VALID [2018-11-23 09:55:15,156 INFO L273 TraceCheckUtils]: 65: Hoare triple {3534#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3534#false} is VALID [2018-11-23 09:55:15,156 INFO L273 TraceCheckUtils]: 64: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3534#false} is VALID [2018-11-23 09:55:15,156 INFO L273 TraceCheckUtils]: 63: Hoare triple {3534#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3534#false} is VALID [2018-11-23 09:55:15,156 INFO L273 TraceCheckUtils]: 62: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3534#false} is VALID [2018-11-23 09:55:15,156 INFO L273 TraceCheckUtils]: 61: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 09:55:15,157 INFO L273 TraceCheckUtils]: 60: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 09:55:15,157 INFO L273 TraceCheckUtils]: 59: Hoare triple {3534#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3534#false} is VALID [2018-11-23 09:55:15,157 INFO L273 TraceCheckUtils]: 58: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3534#false} is VALID [2018-11-23 09:55:15,157 INFO L273 TraceCheckUtils]: 57: Hoare triple {3534#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3534#false} is VALID [2018-11-23 09:55:15,157 INFO L273 TraceCheckUtils]: 56: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3534#false} is VALID [2018-11-23 09:55:15,157 INFO L273 TraceCheckUtils]: 55: Hoare triple {3534#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3534#false} is VALID [2018-11-23 09:55:15,158 INFO L273 TraceCheckUtils]: 54: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3534#false} is VALID [2018-11-23 09:55:15,158 INFO L273 TraceCheckUtils]: 53: Hoare triple {3534#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3534#false} is VALID [2018-11-23 09:55:15,158 INFO L273 TraceCheckUtils]: 52: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3534#false} is VALID [2018-11-23 09:55:15,158 INFO L273 TraceCheckUtils]: 51: Hoare triple {3534#false} havoc ~i~0;~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 09:55:15,159 INFO L273 TraceCheckUtils]: 50: Hoare triple {3987#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {3534#false} is VALID [2018-11-23 09:55:15,160 INFO L273 TraceCheckUtils]: 49: Hoare triple {3991#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3987#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:15,160 INFO L273 TraceCheckUtils]: 48: Hoare triple {3991#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3991#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,167 INFO L273 TraceCheckUtils]: 47: Hoare triple {3998#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3991#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,167 INFO L273 TraceCheckUtils]: 46: Hoare triple {3998#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3998#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,172 INFO L273 TraceCheckUtils]: 45: Hoare triple {4005#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3998#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,172 INFO L273 TraceCheckUtils]: 44: Hoare triple {4005#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4005#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,176 INFO L273 TraceCheckUtils]: 43: Hoare triple {4012#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4005#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,177 INFO L273 TraceCheckUtils]: 42: Hoare triple {4012#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4012#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,184 INFO L273 TraceCheckUtils]: 41: Hoare triple {4019#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4012#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,184 INFO L273 TraceCheckUtils]: 40: Hoare triple {4019#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4019#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,189 INFO L273 TraceCheckUtils]: 39: Hoare triple {4026#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4019#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,189 INFO L273 TraceCheckUtils]: 38: Hoare triple {4026#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4026#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,196 INFO L273 TraceCheckUtils]: 37: Hoare triple {4033#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4026#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,196 INFO L273 TraceCheckUtils]: 36: Hoare triple {4033#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4033#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,202 INFO L273 TraceCheckUtils]: 35: Hoare triple {4040#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4033#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,203 INFO L273 TraceCheckUtils]: 34: Hoare triple {4040#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4040#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {4047#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4040#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,207 INFO L273 TraceCheckUtils]: 32: Hoare triple {4047#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4047#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,214 INFO L273 TraceCheckUtils]: 31: Hoare triple {4054#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4047#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {4054#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4054#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,220 INFO L273 TraceCheckUtils]: 29: Hoare triple {4061#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4054#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,220 INFO L273 TraceCheckUtils]: 28: Hoare triple {4061#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4061#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,228 INFO L273 TraceCheckUtils]: 27: Hoare triple {4068#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4061#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,228 INFO L273 TraceCheckUtils]: 26: Hoare triple {4068#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4068#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,234 INFO L273 TraceCheckUtils]: 25: Hoare triple {4075#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4068#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,235 INFO L273 TraceCheckUtils]: 24: Hoare triple {4075#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4075#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {4082#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4075#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {4082#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4082#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,248 INFO L273 TraceCheckUtils]: 21: Hoare triple {4089#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4082#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {4089#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4089#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {4096#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4089#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {4096#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4096#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {4103#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4096#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {4103#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4103#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {4110#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4103#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {4110#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4110#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {4117#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4110#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {4117#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4117#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {4124#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4117#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4124#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {4131#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4124#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {4131#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4131#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {4138#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4131#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {4138#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4138#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {3533#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {4138#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:15,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {3533#true} call #t~ret14 := main(); {3533#true} is VALID [2018-11-23 09:55:15,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3533#true} {3533#true} #105#return; {3533#true} is VALID [2018-11-23 09:55:15,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {3533#true} assume true; {3533#true} is VALID [2018-11-23 09:55:15,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {3533#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3533#true} is VALID [2018-11-23 09:55:15,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {3533#true} call ULTIMATE.init(); {3533#true} is VALID [2018-11-23 09:55:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 09:55:15,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:15,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:55:15,313 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 97 [2018-11-23 09:55:15,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:15,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:55:15,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:15,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:55:15,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:55:15,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:55:15,770 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 48 states. [2018-11-23 09:55:23,650 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:55:24,171 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:55:24,682 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:55:25,215 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:55:25,784 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:55:26,370 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:55:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:35,011 INFO L93 Difference]: Finished difference Result 201 states and 234 transitions. [2018-11-23 09:55:35,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:55:35,012 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 97 [2018-11-23 09:55:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:55:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 178 transitions. [2018-11-23 09:55:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:55:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 178 transitions. [2018-11-23 09:55:35,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 178 transitions. [2018-11-23 09:55:35,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:35,404 INFO L225 Difference]: With dead ends: 201 [2018-11-23 09:55:35,404 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 09:55:35,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 09:55:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 09:55:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-23 09:55:35,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:35,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 150 states. [2018-11-23 09:55:35,481 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 150 states. [2018-11-23 09:55:35,481 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 150 states. [2018-11-23 09:55:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:35,485 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-23 09:55:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-11-23 09:55:35,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:35,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:35,486 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 150 states. [2018-11-23 09:55:35,486 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 150 states. [2018-11-23 09:55:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:35,490 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-23 09:55:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-11-23 09:55:35,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:35,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:35,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:35,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 09:55:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 155 transitions. [2018-11-23 09:55:35,496 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 155 transitions. Word has length 97 [2018-11-23 09:55:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:35,496 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 155 transitions. [2018-11-23 09:55:35,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:55:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-11-23 09:55:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 09:55:35,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:35,499 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:35,499 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:35,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:35,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1524190854, now seen corresponding path program 5 times [2018-11-23 09:55:35,500 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:35,500 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:35,527 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1