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_init4_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:58:37,900 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:37,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:37,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:37,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:37,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:37,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:37,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:37,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:37,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:37,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:37,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:37,928 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:37,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:37,934 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:37,935 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:37,936 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:37,941 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:37,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:37,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:37,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:37,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:37,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:37,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:37,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:37,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:37,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:37,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:37,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:37,966 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:37,966 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:37,967 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:37,967 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:37,967 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:37,968 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:37,970 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:37,971 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:58:37,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:37,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:37,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:37,990 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:37,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:37,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:37,991 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:37,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:37,991 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:37,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:37,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:37,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:37,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:37,992 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:37,993 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:58:37,993 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:58:37,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:37,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:37,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:37,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:37,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:37,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:37,994 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:37,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:37,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:37,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:37,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:37,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:37,995 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:58:37,995 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:37,996 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:58:37,996 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:58:37,996 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:58:38,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:38,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:38,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:38,084 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:38,084 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:38,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init4_false-unreach-call_ground.i [2018-11-23 09:58:38,149 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0eb1e829/4ece1d9b45604cb78238a9b7481d4387/FLAG8347398fd [2018-11-23 09:58:38,572 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:38,573 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init4_false-unreach-call_ground.i [2018-11-23 09:58:38,579 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0eb1e829/4ece1d9b45604cb78238a9b7481d4387/FLAG8347398fd [2018-11-23 09:58:38,948 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0eb1e829/4ece1d9b45604cb78238a9b7481d4387 [2018-11-23 09:58:38,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:38,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:38,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:38,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:38,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:38,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:38" (1/1) ... [2018-11-23 09:58:38,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe4de69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:38, skipping insertion in model container [2018-11-23 09:58:38,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:38" (1/1) ... [2018-11-23 09:58:38,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:39,004 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:39,270 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:39,278 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:39,316 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:39,350 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:39,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39 WrapperNode [2018-11-23 09:58:39,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:39,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:39,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:39,352 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:39,361 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:58:39" (1/1) ... [2018-11-23 09:58:39,371 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:58:39" (1/1) ... [2018-11-23 09:58:39,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:39,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:39,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:39,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:39,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39" (1/1) ... [2018-11-23 09:58:39,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39" (1/1) ... [2018-11-23 09:58:39,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39" (1/1) ... [2018-11-23 09:58:39,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39" (1/1) ... [2018-11-23 09:58:39,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39" (1/1) ... [2018-11-23 09:58:39,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39" (1/1) ... [2018-11-23 09:58:39,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39" (1/1) ... [2018-11-23 09:58:39,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:39,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:39,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:39,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:39,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39" (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:58:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:39,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:58:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:39,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:39,535 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:58:39,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:58:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:58:40,119 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:40,120 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 09:58:40,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:40 BoogieIcfgContainer [2018-11-23 09:58:40,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:40,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:40,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:40,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:40,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:38" (1/3) ... [2018-11-23 09:58:40,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9fd933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:40, skipping insertion in model container [2018-11-23 09:58:40,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39" (2/3) ... [2018-11-23 09:58:40,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9fd933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:40, skipping insertion in model container [2018-11-23 09:58:40,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:40" (3/3) ... [2018-11-23 09:58:40,129 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init4_false-unreach-call_ground.i [2018-11-23 09:58:40,137 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:40,145 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:40,164 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:40,197 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:40,198 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:40,198 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:40,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:40,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:40,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:40,199 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:40,199 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:40,199 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 09:58:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 09:58:40,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:40,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:40,228 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:40,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:40,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1568614638, now seen corresponding path program 1 times [2018-11-23 09:58:40,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:40,239 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:58:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:40,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:40,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 09:58:40,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {32#true} is VALID [2018-11-23 09:58:40,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 09:58:40,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #87#return; {32#true} is VALID [2018-11-23 09:58:40,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2018-11-23 09:58:40,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {32#true} is VALID [2018-11-23 09:58:40,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 09:58:40,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-23 09:58:40,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !~bvslt32(~i~0, 100000bv32); {33#false} is VALID [2018-11-23 09:58:40,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-23 09:58:40,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !~bvslt32(~i~0, 100000bv32); {33#false} is VALID [2018-11-23 09:58:40,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-23 09:58:40,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !~bvslt32(~i~0, 100000bv32); {33#false} is VALID [2018-11-23 09:58:40,480 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} havoc ~x~0;~x~0 := 0bv32; {33#false} is VALID [2018-11-23 09:58:40,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {33#false} is VALID [2018-11-23 09:58:40,481 INFO L256 TraceCheckUtils]: 15: Hoare triple {33#false} call __VERIFIER_assert((if 46bv32 == #t~mem1 then 1bv32 else 0bv32)); {33#false} is VALID [2018-11-23 09:58:40,482 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 09:58:40,482 INFO L273 TraceCheckUtils]: 17: Hoare triple {33#false} assume 0bv32 == ~cond; {33#false} is VALID [2018-11-23 09:58:40,482 INFO L273 TraceCheckUtils]: 18: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 09:58:40,486 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:58:40,487 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:40,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:40,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:40,501 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 09:58:40,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:40,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:58:40,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:40,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:40,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:40,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:40,757 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 09:58:40,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:40,954 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2018-11-23 09:58:40,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:40,955 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 09:58:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 09:58:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 09:58:40,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2018-11-23 09:58:41,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:41,245 INFO L225 Difference]: With dead ends: 51 [2018-11-23 09:58:41,246 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 09:58:41,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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:58:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 09:58:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 09:58:41,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:41,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 09:58:41,302 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 09:58:41,302 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 09:58:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:41,307 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 09:58:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 09:58:41,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:41,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:41,308 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 09:58:41,308 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 09:58:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:41,313 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 09:58:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 09:58:41,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:41,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:41,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:41,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 09:58:41,319 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2018-11-23 09:58:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:41,319 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 09:58:41,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 09:58:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 09:58:41,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:41,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:41,322 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:41,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash -395002610, now seen corresponding path program 1 times [2018-11-23 09:58:41,323 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:41,323 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:58:41,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:41,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:41,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2018-11-23 09:58:41,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {241#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {241#true} is VALID [2018-11-23 09:58:41,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2018-11-23 09:58:41,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #87#return; {241#true} is VALID [2018-11-23 09:58:41,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret2 := main(); {241#true} is VALID [2018-11-23 09:58:41,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {241#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {261#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:41,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {261#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {242#false} is VALID [2018-11-23 09:58:41,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {242#false} ~i~0 := 0bv32; {242#false} is VALID [2018-11-23 09:58:41,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {242#false} assume !~bvslt32(~i~0, 100000bv32); {242#false} is VALID [2018-11-23 09:58:41,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {242#false} ~i~0 := 0bv32; {242#false} is VALID [2018-11-23 09:58:41,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {242#false} assume !~bvslt32(~i~0, 100000bv32); {242#false} is VALID [2018-11-23 09:58:41,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {242#false} ~i~0 := 0bv32; {242#false} is VALID [2018-11-23 09:58:41,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {242#false} assume !~bvslt32(~i~0, 100000bv32); {242#false} is VALID [2018-11-23 09:58:41,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {242#false} havoc ~x~0;~x~0 := 0bv32; {242#false} is VALID [2018-11-23 09:58:41,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {242#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {242#false} is VALID [2018-11-23 09:58:41,485 INFO L256 TraceCheckUtils]: 15: Hoare triple {242#false} call __VERIFIER_assert((if 46bv32 == #t~mem1 then 1bv32 else 0bv32)); {242#false} is VALID [2018-11-23 09:58:41,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {242#false} ~cond := #in~cond; {242#false} is VALID [2018-11-23 09:58:41,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {242#false} assume 0bv32 == ~cond; {242#false} is VALID [2018-11-23 09:58:41,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {242#false} assume !false; {242#false} is VALID [2018-11-23 09:58:41,488 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:58:41,488 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:41,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:41,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:41,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 09:58:41,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:41,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:58:41,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:41,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:41,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:41,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:41,590 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-23 09:58:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:42,083 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 09:58:42,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:42,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 09:58:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 09:58:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 09:58:42,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-23 09:58:42,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:42,249 INFO L225 Difference]: With dead ends: 45 [2018-11-23 09:58:42,249 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 09:58:42,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:58:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 09:58:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 09:58:42,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:42,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:42,264 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:42,264 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:42,268 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 09:58:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 09:58:42,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:42,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:42,269 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:42,269 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:42,272 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 09:58:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 09:58:42,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:42,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:42,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:42,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 09:58:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 09:58:42,276 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2018-11-23 09:58:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:42,277 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 09:58:42,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 09:58:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 09:58:42,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:42,278 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:58:42,279 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:42,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash 47445068, now seen corresponding path program 1 times [2018-11-23 09:58:42,280 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:42,280 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:58:42,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:42,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:42,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2018-11-23 09:58:42,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {465#true} is VALID [2018-11-23 09:58:42,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-23 09:58:42,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #87#return; {465#true} is VALID [2018-11-23 09:58:42,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret2 := main(); {465#true} is VALID [2018-11-23 09:58:42,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {485#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:42,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {485#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {489#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:42,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {489#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {466#false} is VALID [2018-11-23 09:58:42,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {466#false} ~i~0 := 0bv32; {466#false} is VALID [2018-11-23 09:58:42,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {466#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {466#false} is VALID [2018-11-23 09:58:42,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {466#false} assume !~bvslt32(~i~0, 100000bv32); {466#false} is VALID [2018-11-23 09:58:42,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {466#false} ~i~0 := 0bv32; {466#false} is VALID [2018-11-23 09:58:42,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {466#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {466#false} is VALID [2018-11-23 09:58:42,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {466#false} assume !~bvslt32(~i~0, 100000bv32); {466#false} is VALID [2018-11-23 09:58:42,484 INFO L273 TraceCheckUtils]: 14: Hoare triple {466#false} ~i~0 := 0bv32; {466#false} is VALID [2018-11-23 09:58:42,484 INFO L273 TraceCheckUtils]: 15: Hoare triple {466#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {466#false} is VALID [2018-11-23 09:58:42,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {466#false} assume !~bvslt32(~i~0, 100000bv32); {466#false} is VALID [2018-11-23 09:58:42,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {466#false} havoc ~x~0;~x~0 := 0bv32; {466#false} is VALID [2018-11-23 09:58:42,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {466#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {466#false} is VALID [2018-11-23 09:58:42,486 INFO L256 TraceCheckUtils]: 19: Hoare triple {466#false} call __VERIFIER_assert((if 46bv32 == #t~mem1 then 1bv32 else 0bv32)); {466#false} is VALID [2018-11-23 09:58:42,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {466#false} ~cond := #in~cond; {466#false} is VALID [2018-11-23 09:58:42,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {466#false} assume 0bv32 == ~cond; {466#false} is VALID [2018-11-23 09:58:42,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {466#false} assume !false; {466#false} is VALID [2018-11-23 09:58:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 09:58:42,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:42,565 INFO L273 TraceCheckUtils]: 22: Hoare triple {466#false} assume !false; {466#false} is VALID [2018-11-23 09:58:42,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {466#false} assume 0bv32 == ~cond; {466#false} is VALID [2018-11-23 09:58:42,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {466#false} ~cond := #in~cond; {466#false} is VALID [2018-11-23 09:58:42,566 INFO L256 TraceCheckUtils]: 19: Hoare triple {466#false} call __VERIFIER_assert((if 46bv32 == #t~mem1 then 1bv32 else 0bv32)); {466#false} is VALID [2018-11-23 09:58:42,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {466#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {466#false} is VALID [2018-11-23 09:58:42,566 INFO L273 TraceCheckUtils]: 17: Hoare triple {466#false} havoc ~x~0;~x~0 := 0bv32; {466#false} is VALID [2018-11-23 09:58:42,567 INFO L273 TraceCheckUtils]: 16: Hoare triple {466#false} assume !~bvslt32(~i~0, 100000bv32); {466#false} is VALID [2018-11-23 09:58:42,567 INFO L273 TraceCheckUtils]: 15: Hoare triple {466#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {466#false} is VALID [2018-11-23 09:58:42,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {466#false} ~i~0 := 0bv32; {466#false} is VALID [2018-11-23 09:58:42,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {466#false} assume !~bvslt32(~i~0, 100000bv32); {466#false} is VALID [2018-11-23 09:58:42,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {466#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {466#false} is VALID [2018-11-23 09:58:42,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {466#false} ~i~0 := 0bv32; {466#false} is VALID [2018-11-23 09:58:42,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {466#false} assume !~bvslt32(~i~0, 100000bv32); {466#false} is VALID [2018-11-23 09:58:42,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {466#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {466#false} is VALID [2018-11-23 09:58:42,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {466#false} ~i~0 := 0bv32; {466#false} is VALID [2018-11-23 09:58:42,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {583#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {466#false} is VALID [2018-11-23 09:58:42,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {587#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {583#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:42,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {587#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret2 := main(); {465#true} is VALID [2018-11-23 09:58:42,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #87#return; {465#true} is VALID [2018-11-23 09:58:42,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-23 09:58:42,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {465#true} is VALID [2018-11-23 09:58:42,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2018-11-23 09:58:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 09:58:42,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:42,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:58:42,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 09:58:42,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:42,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:58:42,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:42,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:58:42,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:58:42,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:42,644 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2018-11-23 09:58:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:43,468 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-11-23 09:58:43,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:58:43,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 09:58:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-23 09:58:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-23 09:58:43,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2018-11-23 09:58:43,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:43,649 INFO L225 Difference]: With dead ends: 60 [2018-11-23 09:58:43,649 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 09:58:43,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:58:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 09:58:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 09:58:43,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:43,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:43,701 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:43,701 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:43,706 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 09:58:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 09:58:43,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:43,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:43,707 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:43,708 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:43,710 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 09:58:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 09:58:43,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:43,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:43,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:43,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 09:58:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 09:58:43,715 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 23 [2018-11-23 09:58:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:43,715 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 09:58:43,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:58:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 09:58:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:58:43,717 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:43,717 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:43,717 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:43,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:43,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1451349618, now seen corresponding path program 2 times [2018-11-23 09:58:43,718 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:43,718 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:58:43,737 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:58:43,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:58:43,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:43,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:44,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2018-11-23 09:58:44,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {853#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {853#true} is VALID [2018-11-23 09:58:44,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2018-11-23 09:58:44,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #87#return; {853#true} is VALID [2018-11-23 09:58:44,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret2 := main(); {853#true} is VALID [2018-11-23 09:58:44,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {853#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {873#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:44,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {873#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {877#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:44,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {877#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {881#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:44,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {881#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {885#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:44,080 INFO L273 TraceCheckUtils]: 9: Hoare triple {885#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {889#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:44,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {889#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {854#false} is VALID [2018-11-23 09:58:44,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {854#false} ~i~0 := 0bv32; {854#false} is VALID [2018-11-23 09:58:44,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,083 INFO L273 TraceCheckUtils]: 13: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,084 INFO L273 TraceCheckUtils]: 15: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {854#false} assume !~bvslt32(~i~0, 100000bv32); {854#false} is VALID [2018-11-23 09:58:44,085 INFO L273 TraceCheckUtils]: 17: Hoare triple {854#false} ~i~0 := 0bv32; {854#false} is VALID [2018-11-23 09:58:44,085 INFO L273 TraceCheckUtils]: 18: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {854#false} assume !~bvslt32(~i~0, 100000bv32); {854#false} is VALID [2018-11-23 09:58:44,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {854#false} ~i~0 := 0bv32; {854#false} is VALID [2018-11-23 09:58:44,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,088 INFO L273 TraceCheckUtils]: 26: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,088 INFO L273 TraceCheckUtils]: 28: Hoare triple {854#false} assume !~bvslt32(~i~0, 100000bv32); {854#false} is VALID [2018-11-23 09:58:44,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {854#false} havoc ~x~0;~x~0 := 0bv32; {854#false} is VALID [2018-11-23 09:58:44,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {854#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {854#false} is VALID [2018-11-23 09:58:44,089 INFO L256 TraceCheckUtils]: 31: Hoare triple {854#false} call __VERIFIER_assert((if 46bv32 == #t~mem1 then 1bv32 else 0bv32)); {854#false} is VALID [2018-11-23 09:58:44,089 INFO L273 TraceCheckUtils]: 32: Hoare triple {854#false} ~cond := #in~cond; {854#false} is VALID [2018-11-23 09:58:44,090 INFO L273 TraceCheckUtils]: 33: Hoare triple {854#false} assume 0bv32 == ~cond; {854#false} is VALID [2018-11-23 09:58:44,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {854#false} assume !false; {854#false} is VALID [2018-11-23 09:58:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 09:58:44,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:44,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {854#false} assume !false; {854#false} is VALID [2018-11-23 09:58:44,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {854#false} assume 0bv32 == ~cond; {854#false} is VALID [2018-11-23 09:58:44,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {854#false} ~cond := #in~cond; {854#false} is VALID [2018-11-23 09:58:44,371 INFO L256 TraceCheckUtils]: 31: Hoare triple {854#false} call __VERIFIER_assert((if 46bv32 == #t~mem1 then 1bv32 else 0bv32)); {854#false} is VALID [2018-11-23 09:58:44,371 INFO L273 TraceCheckUtils]: 30: Hoare triple {854#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {854#false} is VALID [2018-11-23 09:58:44,372 INFO L273 TraceCheckUtils]: 29: Hoare triple {854#false} havoc ~x~0;~x~0 := 0bv32; {854#false} is VALID [2018-11-23 09:58:44,372 INFO L273 TraceCheckUtils]: 28: Hoare triple {854#false} assume !~bvslt32(~i~0, 100000bv32); {854#false} is VALID [2018-11-23 09:58:44,372 INFO L273 TraceCheckUtils]: 27: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {854#false} ~i~0 := 0bv32; {854#false} is VALID [2018-11-23 09:58:44,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {854#false} assume !~bvslt32(~i~0, 100000bv32); {854#false} is VALID [2018-11-23 09:58:44,374 INFO L273 TraceCheckUtils]: 21: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {854#false} ~i~0 := 0bv32; {854#false} is VALID [2018-11-23 09:58:44,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {854#false} assume !~bvslt32(~i~0, 100000bv32); {854#false} is VALID [2018-11-23 09:58:44,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,377 INFO L273 TraceCheckUtils]: 13: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {854#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {854#false} is VALID [2018-11-23 09:58:44,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {854#false} ~i~0 := 0bv32; {854#false} is VALID [2018-11-23 09:58:44,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {1037#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {854#false} is VALID [2018-11-23 09:58:44,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1037#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:44,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:44,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {1049#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:44,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {1053#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1049#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:44,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {853#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1053#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:44,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret2 := main(); {853#true} is VALID [2018-11-23 09:58:44,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #87#return; {853#true} is VALID [2018-11-23 09:58:44,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2018-11-23 09:58:44,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {853#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {853#true} is VALID [2018-11-23 09:58:44,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2018-11-23 09:58:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 09:58:44,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:44,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:58:44,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-23 09:58:44,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:44,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:58:44,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:44,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:58:44,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:58:44,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:58:44,486 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 12 states. [2018-11-23 09:58:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:46,377 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2018-11-23 09:58:46,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:58:46,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-23 09:58:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 09:58:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 09:58:46,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2018-11-23 09:58:46,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:46,663 INFO L225 Difference]: With dead ends: 93 [2018-11-23 09:58:46,663 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 09:58:46,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 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:58:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 09:58:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 09:58:46,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:46,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:46,742 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:46,742 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:46,746 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-23 09:58:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 09:58:46,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:46,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:46,747 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:46,748 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:46,751 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-23 09:58:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 09:58:46,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:46,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:46,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:46,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 09:58:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-23 09:58:46,756 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 35 [2018-11-23 09:58:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:46,756 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-23 09:58:46,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:58:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 09:58:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 09:58:46,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:46,758 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:46,759 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:46,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:46,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1177185202, now seen corresponding path program 3 times [2018-11-23 09:58:46,760 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:46,760 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:58:46,778 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:58:47,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 09:58:47,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:48,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:48,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {1487#true} call ULTIMATE.init(); {1487#true} is VALID [2018-11-23 09:58:48,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {1487#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1487#true} is VALID [2018-11-23 09:58:48,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {1487#true} assume true; {1487#true} is VALID [2018-11-23 09:58:48,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1487#true} {1487#true} #87#return; {1487#true} is VALID [2018-11-23 09:58:48,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {1487#true} call #t~ret2 := main(); {1487#true} is VALID [2018-11-23 09:58:48,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {1487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1487#true} is VALID [2018-11-23 09:58:48,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,342 INFO L273 TraceCheckUtils]: 11: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,343 INFO L273 TraceCheckUtils]: 15: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {1487#true} assume !~bvslt32(~i~0, 100000bv32); {1487#true} is VALID [2018-11-23 09:58:48,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {1487#true} ~i~0 := 0bv32; {1487#true} is VALID [2018-11-23 09:58:48,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,344 INFO L273 TraceCheckUtils]: 21: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,345 INFO L273 TraceCheckUtils]: 26: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,345 INFO L273 TraceCheckUtils]: 27: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:48,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {1487#true} assume !~bvslt32(~i~0, 100000bv32); {1487#true} is VALID [2018-11-23 09:58:48,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {1487#true} ~i~0 := 0bv32; {1579#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:48,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {1579#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1583#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:48,347 INFO L273 TraceCheckUtils]: 31: Hoare triple {1583#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1587#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:48,347 INFO L273 TraceCheckUtils]: 32: Hoare triple {1587#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1591#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:48,348 INFO L273 TraceCheckUtils]: 33: Hoare triple {1591#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1595#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:48,349 INFO L273 TraceCheckUtils]: 34: Hoare triple {1595#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1599#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:48,351 INFO L273 TraceCheckUtils]: 35: Hoare triple {1599#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1603#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:48,353 INFO L273 TraceCheckUtils]: 36: Hoare triple {1603#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1607#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:48,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {1607#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1611#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:58:48,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {1611#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1615#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:48,361 INFO L273 TraceCheckUtils]: 39: Hoare triple {1615#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1619#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:48,361 INFO L273 TraceCheckUtils]: 40: Hoare triple {1619#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1488#false} is VALID [2018-11-23 09:58:48,362 INFO L273 TraceCheckUtils]: 41: Hoare triple {1488#false} ~i~0 := 0bv32; {1488#false} is VALID [2018-11-23 09:58:48,362 INFO L273 TraceCheckUtils]: 42: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:48,362 INFO L273 TraceCheckUtils]: 43: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:48,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:48,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:48,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:48,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:48,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:48,363 INFO L273 TraceCheckUtils]: 49: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:48,363 INFO L273 TraceCheckUtils]: 50: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:48,363 INFO L273 TraceCheckUtils]: 51: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:48,364 INFO L273 TraceCheckUtils]: 52: Hoare triple {1488#false} assume !~bvslt32(~i~0, 100000bv32); {1488#false} is VALID [2018-11-23 09:58:48,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {1488#false} havoc ~x~0;~x~0 := 0bv32; {1488#false} is VALID [2018-11-23 09:58:48,364 INFO L273 TraceCheckUtils]: 54: Hoare triple {1488#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1488#false} is VALID [2018-11-23 09:58:48,364 INFO L256 TraceCheckUtils]: 55: Hoare triple {1488#false} call __VERIFIER_assert((if 46bv32 == #t~mem1 then 1bv32 else 0bv32)); {1488#false} is VALID [2018-11-23 09:58:48,365 INFO L273 TraceCheckUtils]: 56: Hoare triple {1488#false} ~cond := #in~cond; {1488#false} is VALID [2018-11-23 09:58:48,365 INFO L273 TraceCheckUtils]: 57: Hoare triple {1488#false} assume 0bv32 == ~cond; {1488#false} is VALID [2018-11-23 09:58:48,365 INFO L273 TraceCheckUtils]: 58: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2018-11-23 09:58:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 09:58:48,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:49,057 INFO L273 TraceCheckUtils]: 58: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2018-11-23 09:58:49,057 INFO L273 TraceCheckUtils]: 57: Hoare triple {1488#false} assume 0bv32 == ~cond; {1488#false} is VALID [2018-11-23 09:58:49,057 INFO L273 TraceCheckUtils]: 56: Hoare triple {1488#false} ~cond := #in~cond; {1488#false} is VALID [2018-11-23 09:58:49,058 INFO L256 TraceCheckUtils]: 55: Hoare triple {1488#false} call __VERIFIER_assert((if 46bv32 == #t~mem1 then 1bv32 else 0bv32)); {1488#false} is VALID [2018-11-23 09:58:49,058 INFO L273 TraceCheckUtils]: 54: Hoare triple {1488#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1488#false} is VALID [2018-11-23 09:58:49,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {1488#false} havoc ~x~0;~x~0 := 0bv32; {1488#false} is VALID [2018-11-23 09:58:49,058 INFO L273 TraceCheckUtils]: 52: Hoare triple {1488#false} assume !~bvslt32(~i~0, 100000bv32); {1488#false} is VALID [2018-11-23 09:58:49,059 INFO L273 TraceCheckUtils]: 51: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:49,059 INFO L273 TraceCheckUtils]: 50: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:49,059 INFO L273 TraceCheckUtils]: 49: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:49,059 INFO L273 TraceCheckUtils]: 48: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:49,060 INFO L273 TraceCheckUtils]: 47: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:49,060 INFO L273 TraceCheckUtils]: 46: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:49,060 INFO L273 TraceCheckUtils]: 45: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:49,060 INFO L273 TraceCheckUtils]: 44: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:49,060 INFO L273 TraceCheckUtils]: 43: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:49,061 INFO L273 TraceCheckUtils]: 42: Hoare triple {1488#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1488#false} is VALID [2018-11-23 09:58:49,061 INFO L273 TraceCheckUtils]: 41: Hoare triple {1488#false} ~i~0 := 0bv32; {1488#false} is VALID [2018-11-23 09:58:49,064 INFO L273 TraceCheckUtils]: 40: Hoare triple {1731#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1488#false} is VALID [2018-11-23 09:58:49,064 INFO L273 TraceCheckUtils]: 39: Hoare triple {1735#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1731#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:49,069 INFO L273 TraceCheckUtils]: 38: Hoare triple {1739#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1735#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,076 INFO L273 TraceCheckUtils]: 37: Hoare triple {1743#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1739#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,080 INFO L273 TraceCheckUtils]: 36: Hoare triple {1747#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1743#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,088 INFO L273 TraceCheckUtils]: 35: Hoare triple {1751#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1747#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {1755#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1751#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,098 INFO L273 TraceCheckUtils]: 33: Hoare triple {1759#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1755#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,106 INFO L273 TraceCheckUtils]: 32: Hoare triple {1763#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1759#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,110 INFO L273 TraceCheckUtils]: 31: Hoare triple {1767#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1763#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {1771#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1767#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,116 INFO L273 TraceCheckUtils]: 29: Hoare triple {1487#true} ~i~0 := 0bv32; {1771#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,117 INFO L273 TraceCheckUtils]: 28: Hoare triple {1487#true} assume !~bvslt32(~i~0, 100000bv32); {1487#true} is VALID [2018-11-23 09:58:49,117 INFO L273 TraceCheckUtils]: 27: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,117 INFO L273 TraceCheckUtils]: 26: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,118 INFO L273 TraceCheckUtils]: 23: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,118 INFO L273 TraceCheckUtils]: 22: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {1487#true} ~i~0 := 0bv32; {1487#true} is VALID [2018-11-23 09:58:49,120 INFO L273 TraceCheckUtils]: 16: Hoare triple {1487#true} assume !~bvslt32(~i~0, 100000bv32); {1487#true} is VALID [2018-11-23 09:58:49,120 INFO L273 TraceCheckUtils]: 15: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,122 INFO L273 TraceCheckUtils]: 10: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {1487#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1487#true} is VALID [2018-11-23 09:58:49,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {1487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1487#true} is VALID [2018-11-23 09:58:49,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {1487#true} call #t~ret2 := main(); {1487#true} is VALID [2018-11-23 09:58:49,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1487#true} {1487#true} #87#return; {1487#true} is VALID [2018-11-23 09:58:49,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {1487#true} assume true; {1487#true} is VALID [2018-11-23 09:58:49,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {1487#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1487#true} is VALID [2018-11-23 09:58:49,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {1487#true} call ULTIMATE.init(); {1487#true} is VALID [2018-11-23 09:58:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 09:58:49,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:49,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:58:49,135 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-11-23 09:58:49,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:49,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:58:49,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:49,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:58:49,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:58:49,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:58:49,301 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 24 states. [2018-11-23 09:58:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:57,269 INFO L93 Difference]: Finished difference Result 159 states and 214 transitions. [2018-11-23 09:58:57,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:58:57,269 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-11-23 09:58:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 184 transitions. [2018-11-23 09:58:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 184 transitions. [2018-11-23 09:58:57,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 184 transitions. [2018-11-23 09:58:57,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:57,742 INFO L225 Difference]: With dead ends: 159 [2018-11-23 09:58:57,742 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 09:58:57,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 105 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:58:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 09:58:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-23 09:58:57,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:57,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 112 states. [2018-11-23 09:58:57,929 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 09:58:57,929 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 09:58:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:57,933 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-11-23 09:58:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-11-23 09:58:57,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:57,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:57,935 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 09:58:57,935 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 09:58:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:57,939 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-11-23 09:58:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-11-23 09:58:57,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:57,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:57,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:57,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 09:58:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-11-23 09:58:57,945 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 59 [2018-11-23 09:58:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:57,945 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-11-23 09:58:57,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:58:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-11-23 09:58:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 09:58:57,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:57,948 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:57,948 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:57,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1590412850, now seen corresponding path program 4 times [2018-11-23 09:58:57,950 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:57,951 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:58:57,974 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:58:58,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:58:58,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:58,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:59,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {2623#true} call ULTIMATE.init(); {2623#true} is VALID [2018-11-23 09:58:59,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {2623#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2623#true} is VALID [2018-11-23 09:58:59,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2018-11-23 09:58:59,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2623#true} #87#return; {2623#true} is VALID [2018-11-23 09:58:59,175 INFO L256 TraceCheckUtils]: 4: Hoare triple {2623#true} call #t~ret2 := main(); {2623#true} is VALID [2018-11-23 09:58:59,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {2623#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2643#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:59,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {2643#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2647#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {2647#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2651#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:59,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {2651#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2655#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {2655#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2659#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:59,182 INFO L273 TraceCheckUtils]: 10: Hoare triple {2659#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2663#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {2663#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2667#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {2667#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2671#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {2671#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2675#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:58:59,186 INFO L273 TraceCheckUtils]: 14: Hoare triple {2675#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2679#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {2679#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2683#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {2683#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2687#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-23 09:58:59,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {2687#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2691#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {2691#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2695#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {2695#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2699#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {2699#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2703#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 09:58:59,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {2703#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2707#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {2707#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2711#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 09:58:59,198 INFO L273 TraceCheckUtils]: 23: Hoare triple {2711#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2715#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {2715#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2719#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 09:58:59,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {2719#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2723#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {2723#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2727#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-23 09:58:59,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {2727#(= (_ bv21 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2731#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,203 INFO L273 TraceCheckUtils]: 28: Hoare triple {2731#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2624#false} is VALID [2018-11-23 09:58:59,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {2624#false} ~i~0 := 0bv32; {2624#false} is VALID [2018-11-23 09:58:59,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,204 INFO L273 TraceCheckUtils]: 31: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,204 INFO L273 TraceCheckUtils]: 32: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,205 INFO L273 TraceCheckUtils]: 36: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,205 INFO L273 TraceCheckUtils]: 37: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,205 INFO L273 TraceCheckUtils]: 39: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,206 INFO L273 TraceCheckUtils]: 41: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,206 INFO L273 TraceCheckUtils]: 42: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,206 INFO L273 TraceCheckUtils]: 43: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,206 INFO L273 TraceCheckUtils]: 44: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,206 INFO L273 TraceCheckUtils]: 45: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,207 INFO L273 TraceCheckUtils]: 46: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,207 INFO L273 TraceCheckUtils]: 47: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,207 INFO L273 TraceCheckUtils]: 48: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,207 INFO L273 TraceCheckUtils]: 49: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,207 INFO L273 TraceCheckUtils]: 50: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,208 INFO L273 TraceCheckUtils]: 52: Hoare triple {2624#false} assume !~bvslt32(~i~0, 100000bv32); {2624#false} is VALID [2018-11-23 09:58:59,208 INFO L273 TraceCheckUtils]: 53: Hoare triple {2624#false} ~i~0 := 0bv32; {2624#false} is VALID [2018-11-23 09:58:59,208 INFO L273 TraceCheckUtils]: 54: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,208 INFO L273 TraceCheckUtils]: 55: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,208 INFO L273 TraceCheckUtils]: 56: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,208 INFO L273 TraceCheckUtils]: 57: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,208 INFO L273 TraceCheckUtils]: 58: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,209 INFO L273 TraceCheckUtils]: 59: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,209 INFO L273 TraceCheckUtils]: 60: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,209 INFO L273 TraceCheckUtils]: 61: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,209 INFO L273 TraceCheckUtils]: 62: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,209 INFO L273 TraceCheckUtils]: 63: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,209 INFO L273 TraceCheckUtils]: 64: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,209 INFO L273 TraceCheckUtils]: 65: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,210 INFO L273 TraceCheckUtils]: 66: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,210 INFO L273 TraceCheckUtils]: 67: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,210 INFO L273 TraceCheckUtils]: 68: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,210 INFO L273 TraceCheckUtils]: 69: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,210 INFO L273 TraceCheckUtils]: 70: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,210 INFO L273 TraceCheckUtils]: 71: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,210 INFO L273 TraceCheckUtils]: 72: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,211 INFO L273 TraceCheckUtils]: 73: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,211 INFO L273 TraceCheckUtils]: 74: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,211 INFO L273 TraceCheckUtils]: 75: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,211 INFO L273 TraceCheckUtils]: 76: Hoare triple {2624#false} assume !~bvslt32(~i~0, 100000bv32); {2624#false} is VALID [2018-11-23 09:58:59,211 INFO L273 TraceCheckUtils]: 77: Hoare triple {2624#false} ~i~0 := 0bv32; {2624#false} is VALID [2018-11-23 09:58:59,211 INFO L273 TraceCheckUtils]: 78: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,211 INFO L273 TraceCheckUtils]: 79: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,212 INFO L273 TraceCheckUtils]: 80: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,212 INFO L273 TraceCheckUtils]: 81: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,212 INFO L273 TraceCheckUtils]: 82: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,212 INFO L273 TraceCheckUtils]: 83: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,212 INFO L273 TraceCheckUtils]: 84: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,213 INFO L273 TraceCheckUtils]: 85: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,213 INFO L273 TraceCheckUtils]: 86: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,213 INFO L273 TraceCheckUtils]: 87: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,213 INFO L273 TraceCheckUtils]: 88: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,213 INFO L273 TraceCheckUtils]: 89: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,214 INFO L273 TraceCheckUtils]: 90: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,214 INFO L273 TraceCheckUtils]: 91: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,214 INFO L273 TraceCheckUtils]: 92: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,214 INFO L273 TraceCheckUtils]: 93: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,214 INFO L273 TraceCheckUtils]: 94: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,215 INFO L273 TraceCheckUtils]: 95: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,215 INFO L273 TraceCheckUtils]: 96: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,215 INFO L273 TraceCheckUtils]: 97: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,215 INFO L273 TraceCheckUtils]: 98: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,215 INFO L273 TraceCheckUtils]: 99: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:58:59,216 INFO L273 TraceCheckUtils]: 100: Hoare triple {2624#false} assume !~bvslt32(~i~0, 100000bv32); {2624#false} is VALID [2018-11-23 09:58:59,216 INFO L273 TraceCheckUtils]: 101: Hoare triple {2624#false} havoc ~x~0;~x~0 := 0bv32; {2624#false} is VALID [2018-11-23 09:58:59,216 INFO L273 TraceCheckUtils]: 102: Hoare triple {2624#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2624#false} is VALID [2018-11-23 09:58:59,216 INFO L256 TraceCheckUtils]: 103: Hoare triple {2624#false} call __VERIFIER_assert((if 46bv32 == #t~mem1 then 1bv32 else 0bv32)); {2624#false} is VALID [2018-11-23 09:58:59,216 INFO L273 TraceCheckUtils]: 104: Hoare triple {2624#false} ~cond := #in~cond; {2624#false} is VALID [2018-11-23 09:58:59,217 INFO L273 TraceCheckUtils]: 105: Hoare triple {2624#false} assume 0bv32 == ~cond; {2624#false} is VALID [2018-11-23 09:58:59,217 INFO L273 TraceCheckUtils]: 106: Hoare triple {2624#false} assume !false; {2624#false} is VALID [2018-11-23 09:58:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-23 09:58:59,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:59:01,208 INFO L273 TraceCheckUtils]: 106: Hoare triple {2624#false} assume !false; {2624#false} is VALID [2018-11-23 09:59:01,209 INFO L273 TraceCheckUtils]: 105: Hoare triple {2624#false} assume 0bv32 == ~cond; {2624#false} is VALID [2018-11-23 09:59:01,209 INFO L273 TraceCheckUtils]: 104: Hoare triple {2624#false} ~cond := #in~cond; {2624#false} is VALID [2018-11-23 09:59:01,209 INFO L256 TraceCheckUtils]: 103: Hoare triple {2624#false} call __VERIFIER_assert((if 46bv32 == #t~mem1 then 1bv32 else 0bv32)); {2624#false} is VALID [2018-11-23 09:59:01,209 INFO L273 TraceCheckUtils]: 102: Hoare triple {2624#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2624#false} is VALID [2018-11-23 09:59:01,211 INFO L273 TraceCheckUtils]: 101: Hoare triple {2624#false} havoc ~x~0;~x~0 := 0bv32; {2624#false} is VALID [2018-11-23 09:59:01,211 INFO L273 TraceCheckUtils]: 100: Hoare triple {2624#false} assume !~bvslt32(~i~0, 100000bv32); {2624#false} is VALID [2018-11-23 09:59:01,211 INFO L273 TraceCheckUtils]: 99: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,211 INFO L273 TraceCheckUtils]: 98: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,212 INFO L273 TraceCheckUtils]: 97: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,212 INFO L273 TraceCheckUtils]: 96: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,212 INFO L273 TraceCheckUtils]: 95: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,212 INFO L273 TraceCheckUtils]: 94: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,212 INFO L273 TraceCheckUtils]: 93: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,213 INFO L273 TraceCheckUtils]: 92: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,213 INFO L273 TraceCheckUtils]: 91: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,213 INFO L273 TraceCheckUtils]: 90: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,213 INFO L273 TraceCheckUtils]: 89: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,214 INFO L273 TraceCheckUtils]: 88: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,214 INFO L273 TraceCheckUtils]: 87: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,214 INFO L273 TraceCheckUtils]: 86: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,214 INFO L273 TraceCheckUtils]: 85: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,215 INFO L273 TraceCheckUtils]: 84: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,215 INFO L273 TraceCheckUtils]: 83: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,215 INFO L273 TraceCheckUtils]: 82: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,215 INFO L273 TraceCheckUtils]: 81: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,215 INFO L273 TraceCheckUtils]: 80: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,216 INFO L273 TraceCheckUtils]: 79: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,216 INFO L273 TraceCheckUtils]: 78: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,216 INFO L273 TraceCheckUtils]: 77: Hoare triple {2624#false} ~i~0 := 0bv32; {2624#false} is VALID [2018-11-23 09:59:01,216 INFO L273 TraceCheckUtils]: 76: Hoare triple {2624#false} assume !~bvslt32(~i~0, 100000bv32); {2624#false} is VALID [2018-11-23 09:59:01,216 INFO L273 TraceCheckUtils]: 75: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,217 INFO L273 TraceCheckUtils]: 74: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,217 INFO L273 TraceCheckUtils]: 73: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,217 INFO L273 TraceCheckUtils]: 72: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,217 INFO L273 TraceCheckUtils]: 71: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,217 INFO L273 TraceCheckUtils]: 70: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,218 INFO L273 TraceCheckUtils]: 69: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,218 INFO L273 TraceCheckUtils]: 68: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,218 INFO L273 TraceCheckUtils]: 67: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,218 INFO L273 TraceCheckUtils]: 66: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,218 INFO L273 TraceCheckUtils]: 65: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,219 INFO L273 TraceCheckUtils]: 64: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,219 INFO L273 TraceCheckUtils]: 63: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,219 INFO L273 TraceCheckUtils]: 62: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,219 INFO L273 TraceCheckUtils]: 61: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,219 INFO L273 TraceCheckUtils]: 60: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,220 INFO L273 TraceCheckUtils]: 59: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,220 INFO L273 TraceCheckUtils]: 58: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,220 INFO L273 TraceCheckUtils]: 57: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,220 INFO L273 TraceCheckUtils]: 56: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,220 INFO L273 TraceCheckUtils]: 55: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,221 INFO L273 TraceCheckUtils]: 54: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,221 INFO L273 TraceCheckUtils]: 53: Hoare triple {2624#false} ~i~0 := 0bv32; {2624#false} is VALID [2018-11-23 09:59:01,221 INFO L273 TraceCheckUtils]: 52: Hoare triple {2624#false} assume !~bvslt32(~i~0, 100000bv32); {2624#false} is VALID [2018-11-23 09:59:01,221 INFO L273 TraceCheckUtils]: 51: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,221 INFO L273 TraceCheckUtils]: 50: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,221 INFO L273 TraceCheckUtils]: 49: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,222 INFO L273 TraceCheckUtils]: 48: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,222 INFO L273 TraceCheckUtils]: 47: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,222 INFO L273 TraceCheckUtils]: 46: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,222 INFO L273 TraceCheckUtils]: 45: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,222 INFO L273 TraceCheckUtils]: 44: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,223 INFO L273 TraceCheckUtils]: 43: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,223 INFO L273 TraceCheckUtils]: 42: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,223 INFO L273 TraceCheckUtils]: 41: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,223 INFO L273 TraceCheckUtils]: 40: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,223 INFO L273 TraceCheckUtils]: 39: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,224 INFO L273 TraceCheckUtils]: 38: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,224 INFO L273 TraceCheckUtils]: 37: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,224 INFO L273 TraceCheckUtils]: 36: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,224 INFO L273 TraceCheckUtils]: 35: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,224 INFO L273 TraceCheckUtils]: 34: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,225 INFO L273 TraceCheckUtils]: 33: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,225 INFO L273 TraceCheckUtils]: 31: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,225 INFO L273 TraceCheckUtils]: 30: Hoare triple {2624#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2624#false} is VALID [2018-11-23 09:59:01,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {2624#false} ~i~0 := 0bv32; {2624#false} is VALID [2018-11-23 09:59:01,228 INFO L273 TraceCheckUtils]: 28: Hoare triple {3203#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2624#false} is VALID [2018-11-23 09:59:01,229 INFO L273 TraceCheckUtils]: 27: Hoare triple {3207#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3203#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:59:01,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {3211#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3207#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {3215#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3211#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {3219#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3215#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,247 INFO L273 TraceCheckUtils]: 23: Hoare triple {3223#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3219#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {3227#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3223#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,257 INFO L273 TraceCheckUtils]: 21: Hoare triple {3231#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3227#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {3235#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3231#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {3239#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3235#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {3243#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3239#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {3247#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3243#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {3251#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3247#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {3255#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3251#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {3259#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3255#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {3263#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3259#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {3267#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3263#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {3271#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3267#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {3275#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3271#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {3279#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3275#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {3283#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3279#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,325 INFO L273 TraceCheckUtils]: 7: Hoare triple {3287#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3283#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {3291#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3287#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {2623#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {3291#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {2623#true} call #t~ret2 := main(); {2623#true} is VALID [2018-11-23 09:59:01,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2623#true} #87#return; {2623#true} is VALID [2018-11-23 09:59:01,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2018-11-23 09:59:01,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {2623#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2623#true} is VALID [2018-11-23 09:59:01,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {2623#true} call ULTIMATE.init(); {2623#true} is VALID [2018-11-23 09:59:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-23 09:59:01,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:59:01,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:59:01,343 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 107 [2018-11-23 09:59:01,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:59:01,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:59:01,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:01,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:59:01,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:59:01,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:59:01,469 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 48 states. [2018-11-23 09:59:04,923 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:59:05,393 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:59:05,900 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:59:06,441 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:59:06,991 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:59:07,565 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:59:08,117 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 09:59:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:36,328 INFO L93 Difference]: Finished difference Result 291 states and 394 transitions. [2018-11-23 09:59:36,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:59:36,329 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 107 [2018-11-23 09:59:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 328 transitions. [2018-11-23 09:59:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 328 transitions. [2018-11-23 09:59:36,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 328 transitions. [2018-11-23 09:59:37,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:37,289 INFO L225 Difference]: With dead ends: 291 [2018-11-23 09:59:37,289 INFO L226 Difference]: Without dead ends: 208 [2018-11-23 09:59:37,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 09:59:37,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-23 09:59:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-11-23 09:59:37,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:59:37,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand 208 states. [2018-11-23 09:59:37,663 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 208 states. [2018-11-23 09:59:37,663 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 208 states. [2018-11-23 09:59:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:37,671 INFO L93 Difference]: Finished difference Result 208 states and 212 transitions. [2018-11-23 09:59:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2018-11-23 09:59:37,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:37,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:37,672 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 208 states. [2018-11-23 09:59:37,672 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 208 states. [2018-11-23 09:59:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:37,680 INFO L93 Difference]: Finished difference Result 208 states and 212 transitions. [2018-11-23 09:59:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2018-11-23 09:59:37,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:37,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:37,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:59:37,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:59:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-23 09:59:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 212 transitions. [2018-11-23 09:59:37,688 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 212 transitions. Word has length 107 [2018-11-23 09:59:37,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:37,688 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 212 transitions. [2018-11-23 09:59:37,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:59:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2018-11-23 09:59:37,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-23 09:59:37,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:37,692 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:37,692 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:37,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:37,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1326499022, now seen corresponding path program 5 times [2018-11-23 09:59:37,694 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:59:37,694 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:59:37,713 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1